./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f4d1033cc80461b2e37f8849427907937a08432fe41ab4a97273e1b98e1dc1f
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 12:41:26,758 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 12:41:26,760 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 12:41:26,780 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 12:41:26,781 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 12:41:26,781 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 12:41:26,782 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 12:41:26,783 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 12:41:26,784 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 12:41:26,785 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 12:41:26,786 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 12:41:26,786 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 12:41:26,787 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 12:41:26,787 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 12:41:26,788 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 12:41:26,789 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 12:41:26,789 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 12:41:26,790 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 12:41:26,791 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 12:41:26,792 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 12:41:26,793 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 12:41:26,794 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 12:41:26,795 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 12:41:26,796 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 12:41:26,798 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 12:41:26,798 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 12:41:26,798 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 12:41:26,799 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 12:41:26,799 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 12:41:26,800 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 12:41:26,800 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 12:41:26,800 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 12:41:26,801 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 12:41:26,801 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 12:41:26,802 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 12:41:26,802 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 12:41:26,803 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 12:41:26,803 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 12:41:26,803 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 12:41:26,804 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 12:41:26,804 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 12:41:26,805 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 12:41:26,818 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 12:41:26,819 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 12:41:26,819 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 12:41:26,819 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 12:41:26,819 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 12:41:26,819 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 12:41:26,820 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 12:41:26,820 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 12:41:26,820 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 12:41:26,820 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 12:41:26,820 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 12:41:26,820 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 12:41:26,820 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 12:41:26,821 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 12:41:26,821 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 12:41:26,821 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 12:41:26,821 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 12:41:26,821 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 12:41:26,821 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 12:41:26,821 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 12:41:26,821 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 12:41:26,821 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 12:41:26,821 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 12:41:26,822 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 12:41:26,822 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 12:41:26,822 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 12:41:26,822 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 12:41:26,822 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 12:41:26,822 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 12:41:26,822 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 12:41:26,822 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 12:41:26,822 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 12:41:26,822 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 12:41:26,823 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 12:41:26,823 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 12:41:26,823 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 12:41:26,823 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 12:41:26,823 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f4d1033cc80461b2e37f8849427907937a08432fe41ab4a97273e1b98e1dc1f
[2023-11-03 12:41:27,031 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 12:41:27,052 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 12:41:27,054 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 12:41:27,055 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 12:41:27,055 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 12:41:27,056 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2023-11-03 12:41:28,132 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 12:41:28,317 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 12:41:28,318 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2023-11-03 12:41:28,328 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/09cacd573/04b5971be6a945e3817ef45ff6bf1794/FLAG68c277800
[2023-11-03 12:41:28,341 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/09cacd573/04b5971be6a945e3817ef45ff6bf1794
[2023-11-03 12:41:28,343 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 12:41:28,345 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 12:41:28,346 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 12:41:28,346 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 12:41:28,349 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 12:41:28,350 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,351 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5338540c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28, skipping insertion in model container
[2023-11-03 12:41:28,351 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,357 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 12:41:28,392 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 12:41:28,508 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 12:41:28,651 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 12:41:28,657 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 12:41:28,668 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 12:41:28,692 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 12:41:28,729 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 12:41:28,729 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28 WrapperNode
[2023-11-03 12:41:28,729 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 12:41:28,730 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 12:41:28,731 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 12:41:28,731 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 12:41:28,736 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,752 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,773 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78
[2023-11-03 12:41:28,773 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 12:41:28,774 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 12:41:28,774 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 12:41:28,774 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 12:41:28,782 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,782 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,786 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,786 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,793 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,796 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,797 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,798 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,800 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 12:41:28,801 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 12:41:28,801 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 12:41:28,801 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 12:41:28,802 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (1/1) ...
[2023-11-03 12:41:28,808 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 12:41:28,816 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:41:28,833 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-03 12:41:28,837 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-03 12:41:28,864 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 12:41:28,864 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 12:41:28,864 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 12:41:28,864 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 12:41:28,864 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 12:41:28,865 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 12:41:28,865 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 12:41:28,865 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 12:41:28,865 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 12:41:28,865 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 12:41:28,865 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 12:41:28,866 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 12:41:29,013 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 12:41:29,014 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 12:41:29,211 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 12:41:29,217 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 12:41:29,218 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 12:41:29,219 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:41:29 BoogieIcfgContainer
[2023-11-03 12:41:29,219 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 12:41:29,221 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 12:41:29,221 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 12:41:29,223 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 12:41:29,223 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 12:41:28" (1/3) ...
[2023-11-03 12:41:29,224 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409b2f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:41:29, skipping insertion in model container
[2023-11-03 12:41:29,224 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:28" (2/3) ...
[2023-11-03 12:41:29,224 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409b2f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:41:29, skipping insertion in model container
[2023-11-03 12:41:29,224 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:41:29" (3/3) ...
[2023-11-03 12:41:29,225 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i
[2023-11-03 12:41:29,231 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 12:41:29,239 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 12:41:29,239 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2023-11-03 12:41:29,239 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 12:41:29,277 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 12:41:29,304 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2023-11-03 12:41:29,347 INFO  L130       PetriNetUnfolder]: 6/150 cut-off events.
[2023-11-03 12:41:29,347 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:41:29,351 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156 conditions, 150 events. 6/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 288 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2023-11-03 12:41:29,351 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 214 flow
[2023-11-03 12:41:29,355 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 214 flow
[2023-11-03 12:41:29,357 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 12:41:29,365 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 103 transitions, 214 flow
[2023-11-03 12:41:29,367 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 103 transitions, 214 flow
[2023-11-03 12:41:29,367 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2023-11-03 12:41:29,390 INFO  L130       PetriNetUnfolder]: 6/150 cut-off events.
[2023-11-03 12:41:29,390 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:41:29,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156 conditions, 150 events. 6/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 288 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2023-11-03 12:41:29,392 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1620
[2023-11-03 12:41:31,556 INFO  L134        LiptonReduction]: Checked pairs total: 7490
[2023-11-03 12:41:31,557 INFO  L136        LiptonReduction]: Total number of compositions: 68
[2023-11-03 12:41:31,573 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 12:41:31,578 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54086596, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 12:41:31,578 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-11-03 12:41:31,582 INFO  L130       PetriNetUnfolder]: 0/17 cut-off events.
[2023-11-03 12:41:31,583 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 12:41:31,583 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:41:31,583 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:41:31,584 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-11-03 12:41:31,588 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:41:31,589 INFO  L85        PathProgramCache]: Analyzing trace with hash 201821214, now seen corresponding path program 1 times
[2023-11-03 12:41:31,595 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:41:31,596 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704608727]
[2023-11-03 12:41:31,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:31,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:41:31,699 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:32,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:32,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:41:32,017 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704608727]
[2023-11-03 12:41:32,017 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704608727] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:41:32,017 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:41:32,017 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:41:32,019 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261406534]
[2023-11-03 12:41:32,019 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:41:32,025 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:41:32,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:41:32,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:41:32,042 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:41:32,299 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 171
[2023-11-03 12:41:32,303 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 flow. Second operand  has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:32,303 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:41:32,303 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 171
[2023-11-03 12:41:32,305 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:41:32,505 INFO  L130       PetriNetUnfolder]: 181/536 cut-off events.
[2023-11-03 12:41:32,505 INFO  L131       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2023-11-03 12:41:32,507 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 994 conditions, 536 events. 181/536 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2880 event pairs, 42 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 895. Up to 266 conditions per place. 
[2023-11-03 12:41:32,510 INFO  L137   encePairwiseOnDemand]: 149/171 looper letters, 54 selfloop transitions, 28 changer transitions 0/92 dead transitions.
[2023-11-03 12:41:32,510 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 92 transitions, 359 flow
[2023-11-03 12:41:32,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:41:32,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:41:32,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions.
[2023-11-03 12:41:32,526 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5097465886939572
[2023-11-03 12:41:32,526 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 523 transitions.
[2023-11-03 12:41:32,527 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 523 transitions.
[2023-11-03 12:41:32,528 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:41:32,530 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 523 transitions.
[2023-11-03 12:41:32,535 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:32,540 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:32,541 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:32,543 INFO  L175             Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 6 states and 523 transitions.
[2023-11-03 12:41:32,543 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 92 transitions, 359 flow
[2023-11-03 12:41:32,546 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 359 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:41:32,548 INFO  L231             Difference]: Finished difference. Result has 55 places, 71 transitions, 306 flow
[2023-11-03 12:41:32,550 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=55, PETRI_TRANSITIONS=71}
[2023-11-03 12:41:32,553 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places.
[2023-11-03 12:41:32,553 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 71 transitions, 306 flow
[2023-11-03 12:41:32,554 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:32,554 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:41:32,554 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:41:32,554 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 12:41:32,554 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-11-03 12:41:32,555 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:41:32,555 INFO  L85        PathProgramCache]: Analyzing trace with hash 1161189494, now seen corresponding path program 1 times
[2023-11-03 12:41:32,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:41:32,555 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183284622]
[2023-11-03 12:41:32,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:32,556 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:41:32,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:32,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:32,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:41:32,765 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183284622]
[2023-11-03 12:41:32,765 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183284622] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:41:32,766 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:41:32,766 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:41:32,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520432980]
[2023-11-03 12:41:32,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:41:32,767 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:41:32,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:41:32,768 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:41:32,768 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:41:33,092 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 171
[2023-11-03 12:41:33,093 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 71 transitions, 306 flow. Second operand  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:33,093 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:41:33,094 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 171
[2023-11-03 12:41:33,094 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:41:33,288 INFO  L130       PetriNetUnfolder]: 182/544 cut-off events.
[2023-11-03 12:41:33,288 INFO  L131       PetriNetUnfolder]: For 242/250 co-relation queries the response was YES.
[2023-11-03 12:41:33,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 544 events. 182/544 cut-off events. For 242/250 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2871 event pairs, 36 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 1263. Up to 276 conditions per place. 
[2023-11-03 12:41:33,294 INFO  L137   encePairwiseOnDemand]: 160/171 looper letters, 37 selfloop transitions, 33 changer transitions 8/113 dead transitions.
[2023-11-03 12:41:33,294 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 113 transitions, 637 flow
[2023-11-03 12:41:33,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:41:33,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:41:33,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 551 transitions.
[2023-11-03 12:41:33,300 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5370370370370371
[2023-11-03 12:41:33,300 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 551 transitions.
[2023-11-03 12:41:33,300 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 551 transitions.
[2023-11-03 12:41:33,301 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:41:33,301 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 551 transitions.
[2023-11-03 12:41:33,302 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:33,304 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:33,305 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:33,305 INFO  L175             Difference]: Start difference. First operand has 55 places, 71 transitions, 306 flow. Second operand 6 states and 551 transitions.
[2023-11-03 12:41:33,305 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 113 transitions, 637 flow
[2023-11-03 12:41:33,308 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 637 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:41:33,309 INFO  L231             Difference]: Finished difference. Result has 65 places, 101 transitions, 607 flow
[2023-11-03 12:41:33,310 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=607, PETRI_PLACES=65, PETRI_TRANSITIONS=101}
[2023-11-03 12:41:33,310 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places.
[2023-11-03 12:41:33,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 101 transitions, 607 flow
[2023-11-03 12:41:33,311 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:33,311 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:41:33,311 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:41:33,311 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 12:41:33,312 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-11-03 12:41:33,312 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:41:33,312 INFO  L85        PathProgramCache]: Analyzing trace with hash 930028087, now seen corresponding path program 1 times
[2023-11-03 12:41:33,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:41:33,312 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165095301]
[2023-11-03 12:41:33,313 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:33,313 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:41:33,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:33,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:33,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:41:33,519 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165095301]
[2023-11-03 12:41:33,519 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165095301] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:41:33,519 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:41:33,520 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:41:33,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355715444]
[2023-11-03 12:41:33,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:41:33,520 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:41:33,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:41:33,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:41:33,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:41:33,604 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 171
[2023-11-03 12:41:33,604 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 101 transitions, 607 flow. Second operand  has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:33,604 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:41:33,604 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 171
[2023-11-03 12:41:33,605 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:41:33,993 INFO  L130       PetriNetUnfolder]: 316/822 cut-off events.
[2023-11-03 12:41:33,993 INFO  L131       PetriNetUnfolder]: For 635/643 co-relation queries the response was YES.
[2023-11-03 12:41:33,996 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 822 events. 316/822 cut-off events. For 635/643 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4777 event pairs, 49 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 2572. Up to 579 conditions per place. 
[2023-11-03 12:41:34,001 INFO  L137   encePairwiseOnDemand]: 149/171 looper letters, 100 selfloop transitions, 76 changer transitions 10/199 dead transitions.
[2023-11-03 12:41:34,001 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 199 transitions, 1391 flow
[2023-11-03 12:41:34,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:41:34,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:41:34,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions.
[2023-11-03 12:41:34,004 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5477582846003899
[2023-11-03 12:41:34,004 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 562 transitions.
[2023-11-03 12:41:34,004 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions.
[2023-11-03 12:41:34,004 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:41:34,004 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions.
[2023-11-03 12:41:34,005 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:34,007 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:34,008 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:34,008 INFO  L175             Difference]: Start difference. First operand has 65 places, 101 transitions, 607 flow. Second operand 6 states and 562 transitions.
[2023-11-03 12:41:34,008 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 199 transitions, 1391 flow
[2023-11-03 12:41:34,013 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 199 transitions, 1391 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:41:34,016 INFO  L231             Difference]: Finished difference. Result has 73 places, 169 transitions, 1207 flow
[2023-11-03 12:41:34,016 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1207, PETRI_PLACES=73, PETRI_TRANSITIONS=169}
[2023-11-03 12:41:34,017 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places.
[2023-11-03 12:41:34,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 169 transitions, 1207 flow
[2023-11-03 12:41:34,017 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:34,017 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:41:34,017 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-11-03 12:41:34,018 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 12:41:34,018 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-11-03 12:41:34,018 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:41:34,018 INFO  L85        PathProgramCache]: Analyzing trace with hash -1797388716, now seen corresponding path program 1 times
[2023-11-03 12:41:34,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:41:34,018 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698609307]
[2023-11-03 12:41:34,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:34,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:41:34,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 12:41:34,044 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 12:41:34,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 12:41:34,073 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 12:41:34,073 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 12:41:34,074 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-11-03 12:41:34,075 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-11-03 12:41:34,075 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-11-03 12:41:34,076 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-11-03 12:41:34,076 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-11-03 12:41:34,076 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-11-03 12:41:34,076 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-11-03 12:41:34,076 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 12:41:34,076 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-11-03 12:41:34,078 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 12:41:34,078 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 12:41:34,094 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-03 12:41:34,097 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 120 transitions, 258 flow
[2023-11-03 12:41:34,120 INFO  L130       PetriNetUnfolder]: 11/265 cut-off events.
[2023-11-03 12:41:34,120 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 12:41:34,121 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 279 conditions, 265 events. 11/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 612 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. 
[2023-11-03 12:41:34,121 INFO  L82        GeneralOperation]: Start removeDead. Operand has 120 places, 120 transitions, 258 flow
[2023-11-03 12:41:34,122 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 120 places, 120 transitions, 258 flow
[2023-11-03 12:41:34,122 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 12:41:34,122 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 120 transitions, 258 flow
[2023-11-03 12:41:34,122 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 120 transitions, 258 flow
[2023-11-03 12:41:34,122 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 120 transitions, 258 flow
[2023-11-03 12:41:34,138 INFO  L130       PetriNetUnfolder]: 11/265 cut-off events.
[2023-11-03 12:41:34,138 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 12:41:34,139 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 279 conditions, 265 events. 11/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 612 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. 
[2023-11-03 12:41:34,141 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4080
[2023-11-03 12:41:36,210 INFO  L134        LiptonReduction]: Checked pairs total: 17583
[2023-11-03 12:41:36,210 INFO  L136        LiptonReduction]: Total number of compositions: 71
[2023-11-03 12:41:36,212 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 12:41:36,213 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54086596, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 12:41:36,213 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-11-03 12:41:36,215 INFO  L130       PetriNetUnfolder]: 0/17 cut-off events.
[2023-11-03 12:41:36,215 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 12:41:36,215 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:41:36,215 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:41:36,215 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:41:36,216 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:41:36,216 INFO  L85        PathProgramCache]: Analyzing trace with hash 2072815190, now seen corresponding path program 1 times
[2023-11-03 12:41:36,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:41:36,216 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368907159]
[2023-11-03 12:41:36,216 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:36,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:41:36,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:36,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:36,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:41:36,346 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368907159]
[2023-11-03 12:41:36,347 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368907159] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:41:36,347 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:41:36,347 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:41:36,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677323325]
[2023-11-03 12:41:36,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:41:36,347 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:41:36,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:41:36,348 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:41:36,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:41:36,563 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191
[2023-11-03 12:41:36,564 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 126 flow. Second operand  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:36,564 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:41:36,564 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191
[2023-11-03 12:41:36,564 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:41:37,194 INFO  L130       PetriNetUnfolder]: 3686/6983 cut-off events.
[2023-11-03 12:41:37,195 INFO  L131       PetriNetUnfolder]: For 206/241 co-relation queries the response was YES.
[2023-11-03 12:41:37,202 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13338 conditions, 6983 events. 3686/6983 cut-off events. For 206/241 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 47182 event pairs, 884 based on Foata normal form. 12/6617 useless extension candidates. Maximal degree in co-relation 6457. Up to 4233 conditions per place. 
[2023-11-03 12:41:37,223 INFO  L137   encePairwiseOnDemand]: 165/191 looper letters, 75 selfloop transitions, 47 changer transitions 0/135 dead transitions.
[2023-11-03 12:41:37,223 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 135 transitions, 543 flow
[2023-11-03 12:41:37,224 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:41:37,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:41:37,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions.
[2023-11-03 12:41:37,225 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5488656195462478
[2023-11-03 12:41:37,225 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 629 transitions.
[2023-11-03 12:41:37,226 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions.
[2023-11-03 12:41:37,226 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:41:37,226 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions.
[2023-11-03 12:41:37,228 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:37,229 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:37,230 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:37,230 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 629 transitions.
[2023-11-03 12:41:37,230 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 135 transitions, 543 flow
[2023-11-03 12:41:37,231 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 135 transitions, 543 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:41:37,246 INFO  L231             Difference]: Finished difference. Result has 67 places, 101 transitions, 460 flow
[2023-11-03 12:41:37,247 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=67, PETRI_TRANSITIONS=101}
[2023-11-03 12:41:37,247 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places.
[2023-11-03 12:41:37,248 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 460 flow
[2023-11-03 12:41:37,248 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:37,248 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:41:37,248 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:41:37,248 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 12:41:37,248 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:41:37,249 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:41:37,249 INFO  L85        PathProgramCache]: Analyzing trace with hash -1179066042, now seen corresponding path program 1 times
[2023-11-03 12:41:37,249 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:41:37,249 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555015103]
[2023-11-03 12:41:37,249 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:37,250 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:41:37,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:37,389 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:37,389 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:41:37,390 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555015103]
[2023-11-03 12:41:37,390 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555015103] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:41:37,390 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:41:37,390 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:41:37,390 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600560924]
[2023-11-03 12:41:37,390 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:41:37,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:41:37,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:41:37,391 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:41:37,391 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:41:37,574 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 191
[2023-11-03 12:41:37,575 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 460 flow. Second operand  has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:37,575 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:41:37,575 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 191
[2023-11-03 12:41:37,575 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:41:38,381 INFO  L130       PetriNetUnfolder]: 3875/7372 cut-off events.
[2023-11-03 12:41:38,381 INFO  L131       PetriNetUnfolder]: For 4552/4677 co-relation queries the response was YES.
[2023-11-03 12:41:38,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19732 conditions, 7372 events. 3875/7372 cut-off events. For 4552/4677 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 50211 event pairs, 1160 based on Foata normal form. 0/6970 useless extension candidates. Maximal degree in co-relation 10705. Up to 4740 conditions per place. 
[2023-11-03 12:41:38,417 INFO  L137   encePairwiseOnDemand]: 176/191 looper letters, 81 selfloop transitions, 70 changer transitions 0/188 dead transitions.
[2023-11-03 12:41:38,417 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 188 transitions, 1134 flow
[2023-11-03 12:41:38,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:41:38,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:41:38,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2023-11-03 12:41:38,420 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5680628272251309
[2023-11-03 12:41:38,420 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2023-11-03 12:41:38,420 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2023-11-03 12:41:38,420 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:41:38,420 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2023-11-03 12:41:38,422 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:38,423 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:38,424 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:38,424 INFO  L175             Difference]: Start difference. First operand has 67 places, 101 transitions, 460 flow. Second operand 6 states and 651 transitions.
[2023-11-03 12:41:38,424 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 188 transitions, 1134 flow
[2023-11-03 12:41:38,432 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 188 transitions, 1134 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:41:38,434 INFO  L231             Difference]: Finished difference. Result has 77 places, 170 transitions, 1114 flow
[2023-11-03 12:41:38,434 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1114, PETRI_PLACES=77, PETRI_TRANSITIONS=170}
[2023-11-03 12:41:38,435 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2023-11-03 12:41:38,435 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 170 transitions, 1114 flow
[2023-11-03 12:41:38,436 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:38,436 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:41:38,436 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:41:38,436 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 12:41:38,436 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:41:38,437 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:41:38,437 INFO  L85        PathProgramCache]: Analyzing trace with hash 1166645746, now seen corresponding path program 1 times
[2023-11-03 12:41:38,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:41:38,437 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681388510]
[2023-11-03 12:41:38,437 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:38,437 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:41:38,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:38,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:38,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:41:38,577 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681388510]
[2023-11-03 12:41:38,577 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681388510] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:41:38,578 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:41:38,578 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:41:38,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134797]
[2023-11-03 12:41:38,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:41:38,578 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:41:38,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:41:38,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:41:38,579 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:41:38,684 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191
[2023-11-03 12:41:38,685 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 170 transitions, 1114 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:38,685 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:41:38,685 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191
[2023-11-03 12:41:38,685 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:41:39,993 INFO  L130       PetriNetUnfolder]: 6828/12078 cut-off events.
[2023-11-03 12:41:39,994 INFO  L131       PetriNetUnfolder]: For 11482/11566 co-relation queries the response was YES.
[2023-11-03 12:41:40,011 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40089 conditions, 12078 events. 6828/12078 cut-off events. For 11482/11566 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 82831 event pairs, 1685 based on Foata normal form. 0/11341 useless extension candidates. Maximal degree in co-relation 33299. Up to 9361 conditions per place. 
[2023-11-03 12:41:40,050 INFO  L137   encePairwiseOnDemand]: 165/191 looper letters, 184 selfloop transitions, 147 changer transitions 0/348 dead transitions.
[2023-11-03 12:41:40,050 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 348 transitions, 2660 flow
[2023-11-03 12:41:40,051 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:41:40,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:41:40,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions.
[2023-11-03 12:41:40,053 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5881326352530541
[2023-11-03 12:41:40,053 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 674 transitions.
[2023-11-03 12:41:40,053 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions.
[2023-11-03 12:41:40,053 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:41:40,053 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions.
[2023-11-03 12:41:40,054 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:40,056 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:40,056 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:40,056 INFO  L175             Difference]: Start difference. First operand has 77 places, 170 transitions, 1114 flow. Second operand 6 states and 674 transitions.
[2023-11-03 12:41:40,056 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 348 transitions, 2660 flow
[2023-11-03 12:41:40,076 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 348 transitions, 2660 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:41:40,080 INFO  L231             Difference]: Finished difference. Result has 86 places, 304 transitions, 2404 flow
[2023-11-03 12:41:40,081 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2404, PETRI_PLACES=86, PETRI_TRANSITIONS=304}
[2023-11-03 12:41:40,081 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places.
[2023-11-03 12:41:40,081 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 304 transitions, 2404 flow
[2023-11-03 12:41:40,082 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:40,082 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:41:40,082 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:41:40,082 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-03 12:41:40,082 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:41:40,082 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:41:40,082 INFO  L85        PathProgramCache]: Analyzing trace with hash 1453756839, now seen corresponding path program 1 times
[2023-11-03 12:41:40,082 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:41:40,082 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141875269]
[2023-11-03 12:41:40,083 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:40,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:41:40,121 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:40,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:40,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:41:40,365 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141875269]
[2023-11-03 12:41:40,365 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141875269] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:41:40,365 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775975309]
[2023-11-03 12:41:40,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:40,366 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:41:40,366 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:41:40,367 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:41:40,373 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-03 12:41:40,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:40,472 INFO  L263         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core
[2023-11-03 12:41:40,477 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:41:40,596 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:41:40,646 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:41:40,694 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:41:40,694 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:41:40,737 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:41:40,738 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:41:40,803 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:40,804 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:41:40,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:40,816 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:41:40,849 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-11-03 12:41:40,881 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-11-03 12:41:41,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-03 12:41:41,019 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775975309] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:41:41,019 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:41:41,020 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20
[2023-11-03 12:41:41,020 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575460753]
[2023-11-03 12:41:41,020 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:41:41,020 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2023-11-03 12:41:41,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:41:41,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2023-11-03 12:41:41,021 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=301, Unknown=2, NotChecked=74, Total=462
[2023-11-03 12:41:41,055 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 191
[2023-11-03 12:41:41,056 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 304 transitions, 2404 flow. Second operand  has 22 states, 22 states have (on average 62.27272727272727) internal successors, (1370), 22 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:41,056 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:41:41,056 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 191
[2023-11-03 12:41:41,057 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:41:45,222 INFO  L130       PetriNetUnfolder]: 11359/18832 cut-off events.
[2023-11-03 12:41:45,222 INFO  L131       PetriNetUnfolder]: For 32133/32135 co-relation queries the response was YES.
[2023-11-03 12:41:45,255 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75968 conditions, 18832 events. 11359/18832 cut-off events. For 32133/32135 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 128390 event pairs, 1116 based on Foata normal form. 2/17121 useless extension candidates. Maximal degree in co-relation 66241. Up to 10934 conditions per place. 
[2023-11-03 12:41:45,321 INFO  L137   encePairwiseOnDemand]: 142/191 looper letters, 523 selfloop transitions, 331 changer transitions 19/878 dead transitions.
[2023-11-03 12:41:45,321 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 878 transitions, 7634 flow
[2023-11-03 12:41:45,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-11-03 12:41:45,322 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-11-03 12:41:45,325 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1166 transitions.
[2023-11-03 12:41:45,325 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4695932339911397
[2023-11-03 12:41:45,326 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1166 transitions.
[2023-11-03 12:41:45,326 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1166 transitions.
[2023-11-03 12:41:45,326 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:41:45,326 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1166 transitions.
[2023-11-03 12:41:45,328 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 89.6923076923077) internal successors, (1166), 13 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:45,331 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 191.0) internal successors, (2674), 14 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:45,331 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 191.0) internal successors, (2674), 14 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:45,332 INFO  L175             Difference]: Start difference. First operand has 86 places, 304 transitions, 2404 flow. Second operand 13 states and 1166 transitions.
[2023-11-03 12:41:45,332 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 878 transitions, 7634 flow
[2023-11-03 12:41:45,740 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 878 transitions, 7490 flow, removed 72 selfloop flow, removed 0 redundant places.
[2023-11-03 12:41:45,749 INFO  L231             Difference]: Finished difference. Result has 108 places, 587 transitions, 5820 flow
[2023-11-03 12:41:45,750 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5820, PETRI_PLACES=108, PETRI_TRANSITIONS=587}
[2023-11-03 12:41:45,750 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 51 predicate places.
[2023-11-03 12:41:45,750 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 587 transitions, 5820 flow
[2023-11-03 12:41:45,751 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 62.27272727272727) internal successors, (1370), 22 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:45,751 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:41:45,751 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:41:45,774 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-03 12:41:45,952 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:41:45,953 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:41:45,954 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:41:45,954 INFO  L85        PathProgramCache]: Analyzing trace with hash -968981031, now seen corresponding path program 1 times
[2023-11-03 12:41:45,954 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:41:45,954 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167011795]
[2023-11-03 12:41:45,955 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:45,955 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:41:45,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:46,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:46,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:41:46,210 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167011795]
[2023-11-03 12:41:46,210 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167011795] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:41:46,210 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441290861]
[2023-11-03 12:41:46,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:46,211 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:41:46,211 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:41:46,212 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:41:46,215 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-03 12:41:46,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:46,303 INFO  L263         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core
[2023-11-03 12:41:46,306 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:41:46,387 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:41:46,411 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:46,411 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:41:46,442 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:46,443 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:46,444 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:41:46,485 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:46,486 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:46,487 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:46,487 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:41:46,574 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:46,575 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:41:46,606 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:46,606 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:41:46,792 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= 0 (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35) (forall ((v_ArrVal_369 (Array Int Int))) (= 0 (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35)))) is different from false
[2023-11-03 12:41:46,859 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35)))))) is different from false
[2023-11-03 12:41:46,908 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))))) is different from false
[2023-11-03 12:41:47,209 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:41:47,210 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-11-03 12:41:47,223 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:41:47,224 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-11-03 12:41:47,228 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-11-03 12:41:47,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-11-03 12:41:47,284 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [441290861] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:41:47,284 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:41:47,284 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23
[2023-11-03 12:41:47,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396570373]
[2023-11-03 12:41:47,285 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:41:47,285 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2023-11-03 12:41:47,286 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:41:47,286 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-11-03 12:41:47,286 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=334, Unknown=34, NotChecked=126, Total=600
[2023-11-03 12:41:47,582 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 191
[2023-11-03 12:41:47,585 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 587 transitions, 5820 flow. Second operand  has 25 states, 25 states have (on average 66.0) internal successors, (1650), 25 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:47,585 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:41:47,585 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 191
[2023-11-03 12:41:47,586 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:41:55,254 INFO  L130       PetriNetUnfolder]: 11892/19961 cut-off events.
[2023-11-03 12:41:55,255 INFO  L131       PetriNetUnfolder]: For 79130/79169 co-relation queries the response was YES.
[2023-11-03 12:41:55,306 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110611 conditions, 19961 events. 11892/19961 cut-off events. For 79130/79169 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 138395 event pairs, 970 based on Foata normal form. 75/18790 useless extension candidates. Maximal degree in co-relation 103696. Up to 12372 conditions per place. 
[2023-11-03 12:41:55,380 INFO  L137   encePairwiseOnDemand]: 161/191 looper letters, 624 selfloop transitions, 378 changer transitions 12/1023 dead transitions.
[2023-11-03 12:41:55,380 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 1023 transitions, 11617 flow
[2023-11-03 12:41:55,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-11-03 12:41:55,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-03 12:41:55,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 979 transitions.
[2023-11-03 12:41:55,383 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46596858638743455
[2023-11-03 12:41:55,383 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 979 transitions.
[2023-11-03 12:41:55,383 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 979 transitions.
[2023-11-03 12:41:55,384 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:41:55,384 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 979 transitions.
[2023-11-03 12:41:55,385 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:55,387 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 191.0) internal successors, (2292), 12 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:55,388 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 191.0) internal successors, (2292), 12 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:55,388 INFO  L175             Difference]: Start difference. First operand has 108 places, 587 transitions, 5820 flow. Second operand 11 states and 979 transitions.
[2023-11-03 12:41:55,388 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 1023 transitions, 11617 flow
[2023-11-03 12:41:56,134 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 1023 transitions, 11458 flow, removed 78 selfloop flow, removed 1 redundant places.
[2023-11-03 12:41:56,146 INFO  L231             Difference]: Finished difference. Result has 125 places, 784 transitions, 9384 flow
[2023-11-03 12:41:56,146 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=5662, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9384, PETRI_PLACES=125, PETRI_TRANSITIONS=784}
[2023-11-03 12:41:56,147 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 68 predicate places.
[2023-11-03 12:41:56,147 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 784 transitions, 9384 flow
[2023-11-03 12:41:56,148 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 66.0) internal successors, (1650), 25 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:56,148 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:41:56,148 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:41:56,155 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-03 12:41:56,348 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:41:56,349 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:41:56,350 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:41:56,350 INFO  L85        PathProgramCache]: Analyzing trace with hash 2096503118, now seen corresponding path program 1 times
[2023-11-03 12:41:56,350 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:41:56,350 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441414586]
[2023-11-03 12:41:56,350 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:56,351 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:41:56,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:56,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:56,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:41:56,605 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441414586]
[2023-11-03 12:41:56,605 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441414586] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:41:56,605 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765648938]
[2023-11-03 12:41:56,605 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:41:56,605 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:41:56,605 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:41:56,607 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:41:56,607 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-03 12:41:56,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:41:56,729 INFO  L263         TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-11-03 12:41:56,733 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:41:56,739 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:41:56,743 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12
[2023-11-03 12:41:56,818 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:41:56,842 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:56,842 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:41:56,871 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:56,872 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:56,873 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:41:56,907 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2023-11-03 12:41:56,932 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:56,933 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:56,934 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:41:56,935 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:41:56,936 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:41:56,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:56,963 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:41:56,985 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2023-11-03 12:41:57,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:41:57,056 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765648938] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:41:57,056 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:41:57,056 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18
[2023-11-03 12:41:57,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729084193]
[2023-11-03 12:41:57,056 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:41:57,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2023-11-03 12:41:57,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:41:57,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2023-11-03 12:41:57,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=275, Unknown=1, NotChecked=34, Total=380
[2023-11-03 12:41:57,058 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 191
[2023-11-03 12:41:57,059 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 784 transitions, 9384 flow. Second operand  has 20 states, 20 states have (on average 64.5) internal successors, (1290), 20 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:57,059 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:41:57,059 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 191
[2023-11-03 12:41:57,059 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:42:03,843 INFO  L130       PetriNetUnfolder]: 15686/26053 cut-off events.
[2023-11-03 12:42:03,844 INFO  L131       PetriNetUnfolder]: For 152073/152110 co-relation queries the response was YES.
[2023-11-03 12:42:03,937 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 163006 conditions, 26053 events. 15686/26053 cut-off events. For 152073/152110 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 185962 event pairs, 860 based on Foata normal form. 363/24869 useless extension candidates. Maximal degree in co-relation 152926. Up to 10197 conditions per place. 
[2023-11-03 12:42:04,059 INFO  L137   encePairwiseOnDemand]: 157/191 looper letters, 1004 selfloop transitions, 639 changer transitions 11/1659 dead transitions.
[2023-11-03 12:42:04,059 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1659 transitions, 21644 flow
[2023-11-03 12:42:04,060 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-11-03 12:42:04,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2023-11-03 12:42:04,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1182 transitions.
[2023-11-03 12:42:04,063 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.44203440538519073
[2023-11-03 12:42:04,063 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1182 transitions.
[2023-11-03 12:42:04,063 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1182 transitions.
[2023-11-03 12:42:04,063 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:42:04,063 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1182 transitions.
[2023-11-03 12:42:04,065 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 84.42857142857143) internal successors, (1182), 14 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:04,068 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 191.0) internal successors, (2865), 15 states have internal predecessors, (2865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:04,068 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 191.0) internal successors, (2865), 15 states have internal predecessors, (2865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:04,068 INFO  L175             Difference]: Start difference. First operand has 125 places, 784 transitions, 9384 flow. Second operand 14 states and 1182 transitions.
[2023-11-03 12:42:04,069 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 1659 transitions, 21644 flow
[2023-11-03 12:42:07,052 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 1659 transitions, 21612 flow, removed 15 selfloop flow, removed 1 redundant places.
[2023-11-03 12:42:07,071 INFO  L231             Difference]: Finished difference. Result has 145 places, 1191 transitions, 17011 flow
[2023-11-03 12:42:07,072 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=9370, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=17011, PETRI_PLACES=145, PETRI_TRANSITIONS=1191}
[2023-11-03 12:42:07,072 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 88 predicate places.
[2023-11-03 12:42:07,072 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 1191 transitions, 17011 flow
[2023-11-03 12:42:07,073 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 64.5) internal successors, (1290), 20 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:07,073 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:42:07,073 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:42:07,081 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-03 12:42:07,273 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-11-03 12:42:07,274 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:42:07,274 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:42:07,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -1997653206, now seen corresponding path program 1 times
[2023-11-03 12:42:07,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:42:07,275 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640602434]
[2023-11-03 12:42:07,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:42:07,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:42:07,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:42:07,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:42:07,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:42:07,354 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640602434]
[2023-11-03 12:42:07,354 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640602434] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:42:07,354 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880538245]
[2023-11-03 12:42:07,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:42:07,355 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:42:07,355 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:42:07,356 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:42:07,357 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-03 12:42:07,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:42:07,487 INFO  L263         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 12:42:07,488 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:42:07,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:42:07,526 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:42:07,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:42:07,557 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880538245] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:42:07,557 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:42:07,557 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 12:42:07,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886821043]
[2023-11-03 12:42:07,557 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:42:07,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 12:42:07,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:42:07,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 12:42:07,558 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 12:42:07,660 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 191
[2023-11-03 12:42:07,661 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 1191 transitions, 17011 flow. Second operand  has 9 states, 9 states have (on average 104.88888888888889) internal successors, (944), 9 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:07,661 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:42:07,661 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 191
[2023-11-03 12:42:07,661 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:42:11,248 INFO  L130       PetriNetUnfolder]: 10331/18836 cut-off events.
[2023-11-03 12:42:11,248 INFO  L131       PetriNetUnfolder]: For 158424/160637 co-relation queries the response was YES.
[2023-11-03 12:42:11,381 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120162 conditions, 18836 events. 10331/18836 cut-off events. For 158424/160637 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 143801 event pairs, 1037 based on Foata normal form. 594/18963 useless extension candidates. Maximal degree in co-relation 120040. Up to 6725 conditions per place. 
[2023-11-03 12:42:11,460 INFO  L137   encePairwiseOnDemand]: 184/191 looper letters, 251 selfloop transitions, 14 changer transitions 37/1256 dead transitions.
[2023-11-03 12:42:11,461 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1256 transitions, 18740 flow
[2023-11-03 12:42:11,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 12:42:11,462 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 12:42:11,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 867 transitions.
[2023-11-03 12:42:11,463 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5674083769633508
[2023-11-03 12:42:11,463 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 867 transitions.
[2023-11-03 12:42:11,463 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 867 transitions.
[2023-11-03 12:42:11,464 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:42:11,464 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 867 transitions.
[2023-11-03 12:42:11,465 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 108.375) internal successors, (867), 8 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:11,467 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:11,467 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:11,467 INFO  L175             Difference]: Start difference. First operand has 145 places, 1191 transitions, 17011 flow. Second operand 8 states and 867 transitions.
[2023-11-03 12:42:11,467 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 1256 transitions, 18740 flow
[2023-11-03 12:42:13,042 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 1256 transitions, 18568 flow, removed 73 selfloop flow, removed 4 redundant places.
[2023-11-03 12:42:13,059 INFO  L231             Difference]: Finished difference. Result has 152 places, 1124 transitions, 16122 flow
[2023-11-03 12:42:13,059 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=16409, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16122, PETRI_PLACES=152, PETRI_TRANSITIONS=1124}
[2023-11-03 12:42:13,060 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 95 predicate places.
[2023-11-03 12:42:13,060 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 1124 transitions, 16122 flow
[2023-11-03 12:42:13,060 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 104.88888888888889) internal successors, (944), 9 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:13,060 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:42:13,060 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:42:13,067 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-03 12:42:13,261 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:42:13,261 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:42:13,262 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:42:13,262 INFO  L85        PathProgramCache]: Analyzing trace with hash 213974305, now seen corresponding path program 1 times
[2023-11-03 12:42:13,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:42:13,262 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524785388]
[2023-11-03 12:42:13,262 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:42:13,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:42:13,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:42:13,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-03 12:42:13,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:42:13,440 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524785388]
[2023-11-03 12:42:13,440 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524785388] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:42:13,440 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:42:13,440 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:42:13,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130619317]
[2023-11-03 12:42:13,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:42:13,441 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:42:13,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:42:13,441 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:42:13,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:42:13,557 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191
[2023-11-03 12:42:13,557 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 1124 transitions, 16122 flow. Second operand  has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:13,557 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:42:13,557 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191
[2023-11-03 12:42:13,557 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:42:19,771 INFO  L130       PetriNetUnfolder]: 13474/23272 cut-off events.
[2023-11-03 12:42:19,772 INFO  L131       PetriNetUnfolder]: For 200952/201655 co-relation queries the response was YES.
[2023-11-03 12:42:19,900 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 161199 conditions, 23272 events. 13474/23272 cut-off events. For 200952/201655 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 170618 event pairs, 1875 based on Foata normal form. 93/22220 useless extension candidates. Maximal degree in co-relation 161143. Up to 18552 conditions per place. 
[2023-11-03 12:42:20,010 INFO  L137   encePairwiseOnDemand]: 165/191 looper letters, 1016 selfloop transitions, 242 changer transitions 9/1339 dead transitions.
[2023-11-03 12:42:20,011 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 1339 transitions, 21430 flow
[2023-11-03 12:42:20,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:42:20,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:42:20,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 670 transitions.
[2023-11-03 12:42:20,013 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5846422338568935
[2023-11-03 12:42:20,013 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 670 transitions.
[2023-11-03 12:42:20,013 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 670 transitions.
[2023-11-03 12:42:20,014 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:42:20,014 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 670 transitions.
[2023-11-03 12:42:20,015 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:20,016 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:20,016 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:20,016 INFO  L175             Difference]: Start difference. First operand has 152 places, 1124 transitions, 16122 flow. Second operand 6 states and 670 transitions.
[2023-11-03 12:42:20,016 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 1339 transitions, 21430 flow
[2023-11-03 12:42:21,889 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 1339 transitions, 20971 flow, removed 10 selfloop flow, removed 5 redundant places.
[2023-11-03 12:42:21,907 INFO  L231             Difference]: Finished difference. Result has 154 places, 1286 transitions, 18848 flow
[2023-11-03 12:42:21,908 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=15715, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18848, PETRI_PLACES=154, PETRI_TRANSITIONS=1286}
[2023-11-03 12:42:21,908 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 97 predicate places.
[2023-11-03 12:42:21,908 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 1286 transitions, 18848 flow
[2023-11-03 12:42:21,909 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:21,909 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:42:21,909 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:42:21,909 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-03 12:42:21,909 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:42:21,909 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:42:21,909 INFO  L85        PathProgramCache]: Analyzing trace with hash -219037260, now seen corresponding path program 1 times
[2023-11-03 12:42:21,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:42:21,910 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838909888]
[2023-11-03 12:42:21,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:42:21,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:42:21,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:42:22,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:42:22,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:42:22,270 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838909888]
[2023-11-03 12:42:22,270 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838909888] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:42:22,270 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763883833]
[2023-11-03 12:42:22,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:42:22,270 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:42:22,270 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:42:22,272 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:42:22,273 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-11-03 12:42:22,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:42:22,369 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 41 conjunts are in the unsatisfiable core
[2023-11-03 12:42:22,373 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:42:22,384 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-11-03 12:42:22,385 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27
[2023-11-03 12:42:22,484 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 12:42:22,484 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-11-03 12:42:22,530 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-11-03 12:42:22,566 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-03 12:42:22,587 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:42:22,594 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:42:22,607 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:42:22,608 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:42:22,623 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:42:22,623 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:42:22,651 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:42:22,661 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:42:22,662 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:42:22,685 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2023-11-03 12:42:22,812 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-11-03 12:42:22,830 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-03 12:42:22,851 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:42:22,851 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-11-03 12:42:22,859 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:42:22,860 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 32
[2023-11-03 12:42:22,871 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:42:22,872 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-11-03 12:42:22,878 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:42:22,878 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 12:42:22,884 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:42:22,884 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 12:42:22,900 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-11-03 12:42:22,911 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-11-03 12:42:22,921 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_712 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_712) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2023-11-03 12:42:22,947 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_712 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_712) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2023-11-03 12:42:22,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-03 12:42:22,948 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763883833] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:42:22,949 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:42:22,949 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 22
[2023-11-03 12:42:22,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147783916]
[2023-11-03 12:42:22,949 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:42:22,949 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2023-11-03 12:42:22,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:42:22,950 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2023-11-03 12:42:22,950 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=222, Unknown=12, NotChecked=252, Total=552
[2023-11-03 12:42:22,952 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-11-03 12:42:22,953 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 1286 transitions, 18848 flow. Second operand  has 24 states, 24 states have (on average 59.25) internal successors, (1422), 24 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:22,953 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:42:22,953 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-11-03 12:42:22,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:42:33,474 INFO  L130       PetriNetUnfolder]: 18971/31588 cut-off events.
[2023-11-03 12:42:33,474 INFO  L131       PetriNetUnfolder]: For 302050/302050 co-relation queries the response was YES.
[2023-11-03 12:42:33,639 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 230149 conditions, 31588 events. 18971/31588 cut-off events. For 302050/302050 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 229110 event pairs, 2613 based on Foata normal form. 77/30637 useless extension candidates. Maximal degree in co-relation 178999. Up to 25759 conditions per place. 
[2023-11-03 12:42:33,788 INFO  L137   encePairwiseOnDemand]: 159/191 looper letters, 2020 selfloop transitions, 564 changer transitions 1/2587 dead transitions.
[2023-11-03 12:42:33,788 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 2587 transitions, 41068 flow
[2023-11-03 12:42:33,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-11-03 12:42:33,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-11-03 12:42:33,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1588 transitions.
[2023-11-03 12:42:33,792 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37791527843883865
[2023-11-03 12:42:33,792 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1588 transitions.
[2023-11-03 12:42:33,792 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1588 transitions.
[2023-11-03 12:42:33,793 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:42:33,793 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1588 transitions.
[2023-11-03 12:42:33,796 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 72.18181818181819) internal successors, (1588), 22 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:33,800 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 191.0) internal successors, (4393), 23 states have internal predecessors, (4393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:33,801 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 191.0) internal successors, (4393), 23 states have internal predecessors, (4393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:33,801 INFO  L175             Difference]: Start difference. First operand has 154 places, 1286 transitions, 18848 flow. Second operand 22 states and 1588 transitions.
[2023-11-03 12:42:33,801 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 2587 transitions, 41068 flow
[2023-11-03 12:42:37,423 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 2587 transitions, 40480 flow, removed 294 selfloop flow, removed 0 redundant places.
[2023-11-03 12:42:37,455 INFO  L231             Difference]: Finished difference. Result has 193 places, 1854 transitions, 29524 flow
[2023-11-03 12:42:37,455 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=18338, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=29524, PETRI_PLACES=193, PETRI_TRANSITIONS=1854}
[2023-11-03 12:42:37,456 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 136 predicate places.
[2023-11-03 12:42:37,456 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 1854 transitions, 29524 flow
[2023-11-03 12:42:37,456 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 59.25) internal successors, (1422), 24 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:37,456 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:42:37,457 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:42:37,465 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2023-11-03 12:42:37,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2023-11-03 12:42:37,658 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:42:37,659 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:42:37,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -468814104, now seen corresponding path program 2 times
[2023-11-03 12:42:37,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:42:37,659 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008292147]
[2023-11-03 12:42:37,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:42:37,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:42:37,679 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:42:38,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:42:38,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:42:38,150 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008292147]
[2023-11-03 12:42:38,150 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008292147] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:42:38,150 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652897541]
[2023-11-03 12:42:38,150 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 12:42:38,150 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:42:38,150 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:42:38,152 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:42:38,153 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-11-03 12:42:38,268 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 12:42:38,269 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:42:38,270 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 58 conjunts are in the unsatisfiable core
[2023-11-03 12:42:38,275 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:42:38,285 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:38,290 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2023-11-03 12:42:38,494 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 12:42:38,494 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37
[2023-11-03 12:42:38,500 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:38,501 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-03 12:42:38,583 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:38,584 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 12:42:38,603 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:38,604 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 12:42:38,663 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:42:38,730 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:38,731 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:42:38,880 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:38,881 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:38,882 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:42:38,968 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:38,969 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:38,971 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:38,971 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:42:39,081 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-11-03 12:42:39,098 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 12:42:39,156 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:39,157 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:42:39,195 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:39,196 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:42:39,227 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:39,228 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:42:39,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:39,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:42:39,373 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:39,374 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:39,375 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:42:39,376 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-11-03 12:42:39,419 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:42:39,419 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:42:39,608 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-11-03 12:42:48,588 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:42:48,589 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 72
[2023-11-03 12:42:48,610 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:42:48,611 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 516 treesize of output 452
[2023-11-03 12:42:48,628 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 478 treesize of output 462
[2023-11-03 12:42:48,725 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 254
[2023-11-03 12:42:49,068 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:42:49,069 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 89
[2023-11-03 12:42:49,121 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:42:49,121 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-03 12:42:49,128 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:42:49,145 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:42:49,145 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 138
[2023-11-03 12:42:49,156 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67
[2023-11-03 12:42:49,167 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 128
[2023-11-03 12:42:49,219 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:42:49,219 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-03 12:42:49,227 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:42:49,252 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:42:49,253 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 138
[2023-11-03 12:42:49,264 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67
[2023-11-03 12:42:49,276 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 128
[2023-11-03 12:42:49,335 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:42:49,335 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-03 12:42:49,344 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:42:49,364 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:42:49,365 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 126
[2023-11-03 12:42:49,381 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52
[2023-11-03 12:42:49,395 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 98
[2023-11-03 12:42:55,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:42:55,422 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [652897541] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:42:55,422 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:42:55,423 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36
[2023-11-03 12:42:55,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533592320]
[2023-11-03 12:42:55,423 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:42:55,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2023-11-03 12:42:55,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:42:55,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2023-11-03 12:42:55,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1075, Unknown=64, NotChecked=70, Total=1406
[2023-11-03 12:42:55,838 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 191
[2023-11-03 12:42:55,840 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 1854 transitions, 29524 flow. Second operand  has 38 states, 38 states have (on average 53.94736842105263) internal successors, (2050), 38 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:55,841 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:42:55,841 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 191
[2023-11-03 12:42:55,841 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:43:19,347 INFO  L130       PetriNetUnfolder]: 19633/32557 cut-off events.
[2023-11-03 12:43:19,348 INFO  L131       PetriNetUnfolder]: For 429901/429901 co-relation queries the response was YES.
[2023-11-03 12:43:19,592 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 266660 conditions, 32557 events. 19633/32557 cut-off events. For 429901/429901 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 236029 event pairs, 1732 based on Foata normal form. 50/31579 useless extension candidates. Maximal degree in co-relation 248663. Up to 27706 conditions per place. 
[2023-11-03 12:43:19,754 INFO  L137   encePairwiseOnDemand]: 163/191 looper letters, 2151 selfloop transitions, 383 changer transitions 2/2538 dead transitions.
[2023-11-03 12:43:19,754 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 2538 transitions, 44115 flow
[2023-11-03 12:43:19,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-11-03 12:43:19,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-11-03 12:43:19,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1645 transitions.
[2023-11-03 12:43:19,758 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34450261780104713
[2023-11-03 12:43:19,758 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1645 transitions.
[2023-11-03 12:43:19,758 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1645 transitions.
[2023-11-03 12:43:19,759 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:43:19,759 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1645 transitions.
[2023-11-03 12:43:19,761 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 65.8) internal successors, (1645), 25 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:43:19,765 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 191.0) internal successors, (4966), 26 states have internal predecessors, (4966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:43:19,766 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 191.0) internal successors, (4966), 26 states have internal predecessors, (4966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:43:19,766 INFO  L175             Difference]: Start difference. First operand has 193 places, 1854 transitions, 29524 flow. Second operand 25 states and 1645 transitions.
[2023-11-03 12:43:19,766 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 2538 transitions, 44115 flow
[2023-11-03 12:43:25,924 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 2538 transitions, 43803 flow, removed 154 selfloop flow, removed 2 redundant places.
[2023-11-03 12:43:25,964 INFO  L231             Difference]: Finished difference. Result has 229 places, 2150 transitions, 35213 flow
[2023-11-03 12:43:25,965 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=29224, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=35213, PETRI_PLACES=229, PETRI_TRANSITIONS=2150}
[2023-11-03 12:43:25,966 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 172 predicate places.
[2023-11-03 12:43:25,966 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 2150 transitions, 35213 flow
[2023-11-03 12:43:25,967 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 38 states have (on average 53.94736842105263) internal successors, (2050), 38 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:43:25,967 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:43:25,967 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:43:25,977 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2023-11-03 12:43:26,168 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2023-11-03 12:43:26,169 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:43:26,169 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:43:26,169 INFO  L85        PathProgramCache]: Analyzing trace with hash 1582367040, now seen corresponding path program 3 times
[2023-11-03 12:43:26,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:43:26,170 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336454849]
[2023-11-03 12:43:26,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:43:26,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:43:26,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:43:26,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:43:26,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:43:26,818 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336454849]
[2023-11-03 12:43:26,818 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336454849] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:43:26,818 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178118981]
[2023-11-03 12:43:26,818 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-03 12:43:26,818 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:43:26,818 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:43:26,820 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:43:26,821 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-11-03 12:43:26,961 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-03 12:43:26,961 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:43:26,964 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 50 conjunts are in the unsatisfiable core
[2023-11-03 12:43:26,971 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:43:26,982 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-11-03 12:43:27,216 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 12:43:27,217 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-11-03 12:43:27,286 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 12:43:27,396 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:43:27,467 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 12:43:27,528 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:43:27,529 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:43:27,603 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:43:27,605 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:43:27,606 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:43:27,697 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:43:27,699 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:43:27,700 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:43:27,701 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:43:27,785 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:43:27,828 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:43:27,874 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:43:27,921 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:43:28,045 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:43:28,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:43:28,110 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:43:28,145 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_947 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-03 12:43:28,198 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-11-03 12:43:31,261 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) .cse1 v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) .cse1 v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) .cse1 v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) .cse1 v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-11-03 12:43:31,290 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:43:31,291 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2023-11-03 12:43:31,300 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:43:31,301 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 82
[2023-11-03 12:43:31,308 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32
[2023-11-03 12:43:31,312 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46
[2023-11-03 12:43:31,344 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:43:31,345 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-03 12:43:31,353 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:43:31,353 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2023-11-03 12:43:31,361 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:43:31,361 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-03 12:43:31,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:43:31,565 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [178118981] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:43:31,565 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:43:31,565 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31
[2023-11-03 12:43:31,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975651059]
[2023-11-03 12:43:31,565 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:43:31,566 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2023-11-03 12:43:31,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:43:31,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2023-11-03 12:43:31,567 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=698, Unknown=50, NotChecked=174, Total=1056
[2023-11-03 12:43:31,714 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-11-03 12:43:31,717 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 2150 transitions, 35213 flow. Second operand  has 33 states, 33 states have (on average 59.121212121212125) internal successors, (1951), 33 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:43:31,717 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:43:31,717 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-11-03 12:43:31,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:43:53,095 INFO  L130       PetriNetUnfolder]: 21907/36131 cut-off events.
[2023-11-03 12:43:53,095 INFO  L131       PetriNetUnfolder]: For 552954/552956 co-relation queries the response was YES.
[2023-11-03 12:43:53,428 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 311933 conditions, 36131 events. 21907/36131 cut-off events. For 552954/552956 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 263777 event pairs, 1843 based on Foata normal form. 94/35197 useless extension candidates. Maximal degree in co-relation 306337. Up to 28840 conditions per place. 
[2023-11-03 12:43:53,620 INFO  L137   encePairwiseOnDemand]: 164/191 looper letters, 2578 selfloop transitions, 554 changer transitions 0/3134 dead transitions.
[2023-11-03 12:43:53,620 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 3134 transitions, 57710 flow
[2023-11-03 12:43:53,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-11-03 12:43:53,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-11-03 12:43:53,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1440 transitions.
[2023-11-03 12:43:53,623 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3769633507853403
[2023-11-03 12:43:53,623 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1440 transitions.
[2023-11-03 12:43:53,623 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1440 transitions.
[2023-11-03 12:43:53,623 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:43:53,623 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1440 transitions.
[2023-11-03 12:43:53,625 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 72.0) internal successors, (1440), 20 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:43:53,627 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 191.0) internal successors, (4011), 21 states have internal predecessors, (4011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:43:53,628 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 191.0) internal successors, (4011), 21 states have internal predecessors, (4011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:43:53,628 INFO  L175             Difference]: Start difference. First operand has 229 places, 2150 transitions, 35213 flow. Second operand 20 states and 1440 transitions.
[2023-11-03 12:43:53,628 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 3134 transitions, 57710 flow
[2023-11-03 12:44:03,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 3134 transitions, 56880 flow, removed 398 selfloop flow, removed 8 redundant places.
[2023-11-03 12:44:03,737 INFO  L231             Difference]: Finished difference. Result has 252 places, 2534 transitions, 43861 flow
[2023-11-03 12:44:03,738 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=34755, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1776, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=43861, PETRI_PLACES=252, PETRI_TRANSITIONS=2534}
[2023-11-03 12:44:03,739 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 195 predicate places.
[2023-11-03 12:44:03,739 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 2534 transitions, 43861 flow
[2023-11-03 12:44:03,739 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 59.121212121212125) internal successors, (1951), 33 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:44:03,739 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:44:03,739 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:44:03,746 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-11-03 12:44:03,940 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2023-11-03 12:44:03,941 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:44:03,941 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:44:03,941 INFO  L85        PathProgramCache]: Analyzing trace with hash -1511522336, now seen corresponding path program 4 times
[2023-11-03 12:44:03,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:44:03,942 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473509348]
[2023-11-03 12:44:03,942 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:44:03,942 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:44:03,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:44:04,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:44:04,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:44:04,556 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473509348]
[2023-11-03 12:44:04,556 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473509348] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:44:04,556 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196769604]
[2023-11-03 12:44:04,556 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-03 12:44:04,556 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:44:04,556 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:44:04,558 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:44:04,559 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-11-03 12:44:04,775 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-03 12:44:04,776 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:44:04,778 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 51 conjunts are in the unsatisfiable core
[2023-11-03 12:44:04,783 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:44:04,792 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-11-03 12:44:05,040 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 12:44:05,041 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-11-03 12:44:05,127 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 12:44:05,208 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:44:05,293 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:05,294 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:44:05,444 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 12:44:05,518 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:05,519 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:05,520 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:44:05,612 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:05,613 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:05,614 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:05,615 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:44:05,700 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:44:05,741 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:44:05,781 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:44:05,823 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:44:05,946 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:44:06,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:44:06,003 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:44:06,195 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1057 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1057) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1058) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1057 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1057) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1058) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1057 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1057) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1058) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1057 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1057) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1058) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-11-03 12:44:07,417 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:44:07,417 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2023-11-03 12:44:07,428 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:44:07,428 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 248 treesize of output 154
[2023-11-03 12:44:07,439 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55
[2023-11-03 12:44:07,443 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102
[2023-11-03 12:44:07,486 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:44:07,486 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2023-11-03 12:44:07,494 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:44:07,494 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-03 12:44:07,501 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:44:07,501 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-03 12:44:07,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:44:07,689 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196769604] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:44:07,689 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:44:07,689 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31
[2023-11-03 12:44:07,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463097311]
[2023-11-03 12:44:07,689 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:44:07,690 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2023-11-03 12:44:07,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:44:07,690 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2023-11-03 12:44:07,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=789, Unknown=74, NotChecked=60, Total=1056
[2023-11-03 12:44:08,505 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-11-03 12:44:08,507 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 2534 transitions, 43861 flow. Second operand  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:44:08,507 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:44:08,507 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-11-03 12:44:08,507 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:44:33,473 INFO  L130       PetriNetUnfolder]: 23112/37994 cut-off events.
[2023-11-03 12:44:33,473 INFO  L131       PetriNetUnfolder]: For 674170/674170 co-relation queries the response was YES.
[2023-11-03 12:44:33,898 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 345531 conditions, 37994 events. 23112/37994 cut-off events. For 674170/674170 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 278500 event pairs, 1836 based on Foata normal form. 128/37094 useless extension candidates. Maximal degree in co-relation 339086. Up to 29801 conditions per place. 
[2023-11-03 12:44:34,132 INFO  L137   encePairwiseOnDemand]: 168/191 looper letters, 2525 selfloop transitions, 748 changer transitions 0/3275 dead transitions.
[2023-11-03 12:44:34,132 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 3275 transitions, 63465 flow
[2023-11-03 12:44:34,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-03 12:44:34,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-03 12:44:34,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1367 transitions.
[2023-11-03 12:44:34,135 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3766877927803803
[2023-11-03 12:44:34,135 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1367 transitions.
[2023-11-03 12:44:34,135 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1367 transitions.
[2023-11-03 12:44:34,136 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:44:34,136 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1367 transitions.
[2023-11-03 12:44:34,138 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 71.94736842105263) internal successors, (1367), 19 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:44:34,141 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 191.0) internal successors, (3820), 20 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:44:34,142 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 191.0) internal successors, (3820), 20 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:44:34,142 INFO  L175             Difference]: Start difference. First operand has 252 places, 2534 transitions, 43861 flow. Second operand 19 states and 1367 transitions.
[2023-11-03 12:44:34,142 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 3275 transitions, 63465 flow
[2023-11-03 12:44:50,039 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 3275 transitions, 63178 flow, removed 134 selfloop flow, removed 4 redundant places.
[2023-11-03 12:44:50,092 INFO  L231             Difference]: Finished difference. Result has 274 places, 2841 transitions, 52704 flow
[2023-11-03 12:44:50,094 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=43576, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=475, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1963, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=52704, PETRI_PLACES=274, PETRI_TRANSITIONS=2841}
[2023-11-03 12:44:50,094 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 217 predicate places.
[2023-11-03 12:44:50,095 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 2841 transitions, 52704 flow
[2023-11-03 12:44:50,095 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:44:50,095 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:44:50,095 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:44:50,103 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-11-03 12:44:50,296 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-11-03 12:44:50,296 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:44:50,297 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:44:50,297 INFO  L85        PathProgramCache]: Analyzing trace with hash -1374245526, now seen corresponding path program 5 times
[2023-11-03 12:44:50,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:44:50,298 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245163539]
[2023-11-03 12:44:50,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:44:50,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:44:50,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:44:50,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:44:50,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:44:50,981 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245163539]
[2023-11-03 12:44:50,981 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245163539] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:44:50,981 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564028744]
[2023-11-03 12:44:50,981 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-11-03 12:44:50,982 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:44:50,982 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:44:50,983 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:44:50,985 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-03 12:44:51,116 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 12:44:51,117 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:44:51,119 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 61 conjunts are in the unsatisfiable core
[2023-11-03 12:44:51,126 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:44:51,134 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:51,139 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-11-03 12:44:51,140 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36
[2023-11-03 12:44:51,398 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 12:44:51,398 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36
[2023-11-03 12:44:51,410 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-03 12:44:51,504 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:51,505 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-11-03 12:44:51,519 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:51,520 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 12:44:51,582 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:44:51,769 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:51,770 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:44:51,912 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:51,914 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:51,915 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:44:52,029 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-11-03 12:44:52,041 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-03 12:44:52,145 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:52,147 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:52,148 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:52,150 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:44:52,257 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:52,258 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:44:52,297 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:52,298 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:44:52,342 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:52,343 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:44:52,396 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:52,397 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:44:52,535 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:52,537 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:52,538 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:44:52,539 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-11-03 12:44:52,594 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:44:52,595 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:44:52,774 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1172 Int) (v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1171))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_1172))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1171))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_1172))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1171))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_1172))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1171))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_1172))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-11-03 12:44:57,919 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:44:57,919 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-03 12:44:57,936 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:44:57,936 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 404 treesize of output 350
[2023-11-03 12:44:57,950 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 348 treesize of output 328
[2023-11-03 12:44:58,043 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 250
[2023-11-03 12:44:58,225 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:44:58,226 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 81
[2023-11-03 12:44:58,275 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:44:58,275 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-03 12:44:58,284 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:44:58,304 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:44:58,305 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 150
[2023-11-03 12:44:58,318 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73
[2023-11-03 12:44:58,329 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 128
[2023-11-03 12:44:58,381 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:44:58,382 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-03 12:44:58,388 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:44:58,408 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:44:58,409 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 138
[2023-11-03 12:44:58,424 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67
[2023-11-03 12:44:58,437 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 128
[2023-11-03 12:44:58,483 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:44:58,484 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 72
[2023-11-03 12:44:58,492 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:44:58,517 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:44:58,517 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 142
[2023-11-03 12:44:58,532 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67
[2023-11-03 12:44:58,545 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 120
[2023-11-03 12:45:07,625 WARN  L233               SmtUtils]: Spent 8.67s on a formula simplification. DAG size of input: 49 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-11-03 12:45:14,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:45:14,654 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [564028744] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:45:14,654 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:45:14,654 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36
[2023-11-03 12:45:14,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090050986]
[2023-11-03 12:45:14,655 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:45:14,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2023-11-03 12:45:14,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:45:14,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2023-11-03 12:45:14,656 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1099, Unknown=58, NotChecked=70, Total=1406
[2023-11-03 12:45:17,071 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 191
[2023-11-03 12:45:17,073 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 2841 transitions, 52704 flow. Second operand  has 38 states, 38 states have (on average 53.94736842105263) internal successors, (2050), 38 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:45:17,073 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:45:17,073 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 191
[2023-11-03 12:45:17,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:45:53,073 INFO  L130       PetriNetUnfolder]: 24096/39545 cut-off events.
[2023-11-03 12:45:53,073 INFO  L131       PetriNetUnfolder]: For 820898/820900 co-relation queries the response was YES.
[2023-11-03 12:45:53,604 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 381411 conditions, 39545 events. 24096/39545 cut-off events. For 820898/820900 co-relation queries the response was YES. Maximal size of possible extension queue 1103. Compared 290520 event pairs, 1751 based on Foata normal form. 238/38755 useless extension candidates. Maximal degree in co-relation 374200. Up to 30553 conditions per place. 
[2023-11-03 12:45:53,840 INFO  L137   encePairwiseOnDemand]: 160/191 looper letters, 2609 selfloop transitions, 1043 changer transitions 0/3654 dead transitions.
[2023-11-03 12:45:53,841 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 3654 transitions, 75328 flow
[2023-11-03 12:45:53,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2023-11-03 12:45:53,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2023-11-03 12:45:53,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2049 transitions.
[2023-11-03 12:45:53,844 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3460564093903057
[2023-11-03 12:45:53,844 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2049 transitions.
[2023-11-03 12:45:53,844 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2049 transitions.
[2023-11-03 12:45:53,845 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:45:53,845 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2049 transitions.
[2023-11-03 12:45:53,847 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 66.09677419354838) internal successors, (2049), 31 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:45:53,851 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 191.0) internal successors, (6112), 32 states have internal predecessors, (6112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:45:53,852 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 191.0) internal successors, (6112), 32 states have internal predecessors, (6112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:45:53,852 INFO  L175             Difference]: Start difference. First operand has 274 places, 2841 transitions, 52704 flow. Second operand 31 states and 2049 transitions.
[2023-11-03 12:45:53,852 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 3654 transitions, 75328 flow
[2023-11-03 12:46:15,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 3654 transitions, 74619 flow, removed 308 selfloop flow, removed 6 redundant places.
[2023-11-03 12:46:15,785 INFO  L231             Difference]: Finished difference. Result has 309 places, 3163 transitions, 62956 flow
[2023-11-03 12:46:15,786 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=51718, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2823, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=731, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2066, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=62956, PETRI_PLACES=309, PETRI_TRANSITIONS=3163}
[2023-11-03 12:46:15,787 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 252 predicate places.
[2023-11-03 12:46:15,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 3163 transitions, 62956 flow
[2023-11-03 12:46:15,787 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 38 states have (on average 53.94736842105263) internal successors, (2050), 38 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:46:15,787 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:46:15,787 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:46:15,796 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2023-11-03 12:46:15,988 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-11-03 12:46:15,988 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:46:15,990 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:46:15,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -1256111306, now seen corresponding path program 6 times
[2023-11-03 12:46:15,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:46:15,990 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424623569]
[2023-11-03 12:46:15,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:46:15,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:46:16,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:46:16,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:46:16,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:46:16,668 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424623569]
[2023-11-03 12:46:16,668 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424623569] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:46:16,668 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319721933]
[2023-11-03 12:46:16,668 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2023-11-03 12:46:16,668 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:46:16,669 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:46:16,670 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:46:16,672 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-11-03 12:46:16,840 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2023-11-03 12:46:16,841 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:46:16,842 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 48 conjunts are in the unsatisfiable core
[2023-11-03 12:46:16,846 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:46:16,854 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-11-03 12:46:17,083 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 12:46:17,084 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-11-03 12:46:17,164 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 12:46:17,316 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 12:46:17,391 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:46:17,456 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 12:46:17,499 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:46:17,500 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:46:17,563 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:46:17,564 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:46:17,565 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:46:17,630 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:46:17,631 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:46:17,632 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:46:17,634 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:46:17,743 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:46:17,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:46:17,797 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:46:17,832 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1281 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1281 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1281 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-03 12:46:18,085 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-11-03 12:46:18,116 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-11-03 12:46:18,143 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (and (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1274))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (store (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1274))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (store (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1274))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (store (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1274))) (store .cse6 c_threadThread1of2ForFork0_~t~0.base (store (store (store (select .cse6 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1281) c_threadThread1of2ForFork0_~t~0.base) .cse2))))) is different from false
[2023-11-03 12:46:18,157 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:46:18,158 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47
[2023-11-03 12:46:18,162 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42
[2023-11-03 12:46:18,166 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26
[2023-11-03 12:46:18,190 INFO  L321             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2023-11-03 12:46:18,190 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1
[2023-11-03 12:46:18,197 INFO  L321             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2023-11-03 12:46:18,197 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1
[2023-11-03 12:46:18,206 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:46:18,206 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 45
[2023-11-03 12:46:18,210 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:46:18,213 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14
[2023-11-03 12:46:18,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:46:18,454 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319721933] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:46:18,454 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:46:18,454 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30
[2023-11-03 12:46:18,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873588530]
[2023-11-03 12:46:18,454 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:46:18,455 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-11-03 12:46:18,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:46:18,455 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-11-03 12:46:18,456 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=640, Unknown=21, NotChecked=220, Total=992
[2023-11-03 12:46:18,780 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-11-03 12:46:18,782 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 3163 transitions, 62956 flow. Second operand  has 32 states, 32 states have (on average 59.0625) internal successors, (1890), 32 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:46:18,782 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:46:18,782 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-11-03 12:46:18,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:47:00,083 INFO  L130       PetriNetUnfolder]: 32246/52706 cut-off events.
[2023-11-03 12:47:00,083 INFO  L131       PetriNetUnfolder]: For 1187353/1187353 co-relation queries the response was YES.
[2023-11-03 12:47:00,841 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 515720 conditions, 52706 events. 32246/52706 cut-off events. For 1187353/1187353 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 404124 event pairs, 2516 based on Foata normal form. 290/51338 useless extension candidates. Maximal degree in co-relation 505763. Up to 24113 conditions per place. 
[2023-11-03 12:47:01,151 INFO  L137   encePairwiseOnDemand]: 160/191 looper letters, 3485 selfloop transitions, 1467 changer transitions 3/4957 dead transitions.
[2023-11-03 12:47:01,151 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 4957 transitions, 104469 flow
[2023-11-03 12:47:01,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-11-03 12:47:01,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-11-03 12:47:01,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1482 transitions.
[2023-11-03 12:47:01,153 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3879581151832461
[2023-11-03 12:47:01,153 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1482 transitions.
[2023-11-03 12:47:01,153 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1482 transitions.
[2023-11-03 12:47:01,154 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:47:01,154 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1482 transitions.
[2023-11-03 12:47:01,155 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 74.1) internal successors, (1482), 20 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:01,158 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 191.0) internal successors, (4011), 21 states have internal predecessors, (4011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:01,158 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 191.0) internal successors, (4011), 21 states have internal predecessors, (4011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:01,158 INFO  L175             Difference]: Start difference. First operand has 309 places, 3163 transitions, 62956 flow. Second operand 20 states and 1482 transitions.
[2023-11-03 12:47:01,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 4957 transitions, 104469 flow
[2023-11-03 12:47:36,799 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 4957 transitions, 103499 flow, removed 297 selfloop flow, removed 13 redundant places.
[2023-11-03 12:47:36,879 INFO  L231             Difference]: Finished difference. Result has 328 places, 3980 transitions, 84738 flow
[2023-11-03 12:47:36,882 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=62030, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=758, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=84738, PETRI_PLACES=328, PETRI_TRANSITIONS=3980}
[2023-11-03 12:47:36,882 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 271 predicate places.
[2023-11-03 12:47:36,882 INFO  L495      AbstractCegarLoop]: Abstraction has has 328 places, 3980 transitions, 84738 flow
[2023-11-03 12:47:36,883 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 59.0625) internal successors, (1890), 32 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:36,883 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:47:36,883 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:47:36,891 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2023-11-03 12:47:37,083 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-11-03 12:47:37,084 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:47:37,085 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:47:37,085 INFO  L85        PathProgramCache]: Analyzing trace with hash -699171873, now seen corresponding path program 1 times
[2023-11-03 12:47:37,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:47:37,086 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416490673]
[2023-11-03 12:47:37,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:47:37,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:47:37,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:47:37,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:47:37,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:47:37,504 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416490673]
[2023-11-03 12:47:37,505 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416490673] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:47:37,505 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150611824]
[2023-11-03 12:47:37,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:47:37,505 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:47:37,505 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:47:37,507 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:47:37,509 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-11-03 12:47:37,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:47:37,640 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 63 conjunts are in the unsatisfiable core
[2023-11-03 12:47:37,646 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:47:37,660 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-11-03 12:47:37,951 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 12:47:37,951 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-11-03 12:47:37,958 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:47:37,959 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 12:47:38,111 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 12:47:38,126 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 12:47:38,281 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 12:47:38,291 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-11-03 12:47:38,383 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:47:38,436 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:47:38,515 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:47:38,612 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 12:47:38,693 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:47:38,693 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:47:38,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:47:38,761 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:47:38,803 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1389 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1389) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1389 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1389) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1389 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1389) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)))) is different from false
[2023-11-03 12:47:38,966 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1389 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1389) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1389 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1389) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)) (forall ((v_ArrVal_1389 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1389) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3) 0)))))) is different from false
[2023-11-03 12:47:38,987 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:47:38,987 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 54
[2023-11-03 12:47:38,995 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:47:38,995 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 35
[2023-11-03 12:47:39,004 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2023-11-03 12:47:39,012 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:47:39,013 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 1
[2023-11-03 12:47:39,020 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:47:39,021 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 1
[2023-11-03 12:47:39,105 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1382 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1382) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2023-11-03 12:47:39,113 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1382 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1382) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2023-11-03 12:47:39,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:47:39,277 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150611824] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:47:39,277 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:47:39,277 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 30
[2023-11-03 12:47:39,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012257821]
[2023-11-03 12:47:39,278 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:47:39,278 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-11-03 12:47:39,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:47:39,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-11-03 12:47:39,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=637, Unknown=19, NotChecked=220, Total=992
[2023-11-03 12:47:39,533 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 46 out of 191
[2023-11-03 12:47:39,534 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 3980 transitions, 84738 flow. Second operand  has 32 states, 32 states have (on average 48.0) internal successors, (1536), 32 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:39,534 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:47:39,534 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 191
[2023-11-03 12:47:39,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:49:00,145 INFO  L130       PetriNetUnfolder]: 53217/87297 cut-off events.
[2023-11-03 12:49:00,145 INFO  L131       PetriNetUnfolder]: For 2331528/2331528 co-relation queries the response was YES.
[2023-11-03 12:49:01,826 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 904148 conditions, 87297 events. 53217/87297 cut-off events. For 2331528/2331528 co-relation queries the response was YES. Maximal size of possible extension queue 2392. Compared 722886 event pairs, 4059 based on Foata normal form. 528/84824 useless extension candidates. Maximal degree in co-relation 874987. Up to 31177 conditions per place. 
[2023-11-03 12:49:02,371 INFO  L137   encePairwiseOnDemand]: 164/191 looper letters, 6429 selfloop transitions, 3655 changer transitions 6/10092 dead transitions.
[2023-11-03 12:49:02,371 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 10092 transitions, 230802 flow
[2023-11-03 12:49:02,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2023-11-03 12:49:02,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 38 states.
[2023-11-03 12:49:02,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2268 transitions.
[2023-11-03 12:49:02,375 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.31248277762469
[2023-11-03 12:49:02,375 INFO  L72            ComplementDD]: Start complementDD. Operand 38 states and 2268 transitions.
[2023-11-03 12:49:02,375 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 38 states and 2268 transitions.
[2023-11-03 12:49:02,376 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:49:02,376 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2268 transitions.
[2023-11-03 12:49:02,378 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 39 states, 38 states have (on average 59.68421052631579) internal successors, (2268), 38 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:02,383 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 39 states, 39 states have (on average 191.0) internal successors, (7449), 39 states have internal predecessors, (7449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:02,384 INFO  L81            ComplementDD]: Finished complementDD. Result  has 39 states, 39 states have (on average 191.0) internal successors, (7449), 39 states have internal predecessors, (7449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:02,384 INFO  L175             Difference]: Start difference. First operand has 328 places, 3980 transitions, 84738 flow. Second operand 38 states and 2268 transitions.
[2023-11-03 12:49:02,384 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 10092 transitions, 230802 flow
[2023-11-03 12:51:14,871 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 10092 transitions, 227673 flow, removed 1526 selfloop flow, removed 5 redundant places.
[2023-11-03 12:51:15,028 INFO  L231             Difference]: Finished difference. Result has 390 places, 6615 transitions, 157879 flow
[2023-11-03 12:51:15,031 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=83475, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=157879, PETRI_PLACES=390, PETRI_TRANSITIONS=6615}
[2023-11-03 12:51:15,031 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 333 predicate places.
[2023-11-03 12:51:15,031 INFO  L495      AbstractCegarLoop]: Abstraction has has 390 places, 6615 transitions, 157879 flow
[2023-11-03 12:51:15,032 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 48.0) internal successors, (1536), 32 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:51:15,032 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:51:15,032 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:51:15,040 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2023-11-03 12:51:15,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:51:15,233 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:51:15,234 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:51:15,234 INFO  L85        PathProgramCache]: Analyzing trace with hash -1987894726, now seen corresponding path program 7 times
[2023-11-03 12:51:15,235 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:51:15,235 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649926904]
[2023-11-03 12:51:15,235 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:51:15,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:51:15,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:51:15,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:51:15,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:51:15,668 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649926904]
[2023-11-03 12:51:15,668 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649926904] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:51:15,668 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737165844]
[2023-11-03 12:51:15,669 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2023-11-03 12:51:15,669 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:51:15,669 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:51:15,670 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:51:15,673 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-11-03 12:51:15,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:51:15,829 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjunts are in the unsatisfiable core
[2023-11-03 12:51:15,833 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:51:15,845 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-11-03 12:51:15,846 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 56
[2023-11-03 12:51:16,021 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 12:51:16,022 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-11-03 12:51:16,094 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-03 12:51:16,122 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:51:16,134 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:51:16,152 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:51:16,152 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:51:16,180 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:51:16,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:51:16,202 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:51:16,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:51:16,217 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:51:16,549 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1498 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1498) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1498 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1498) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1498 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1498) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1498) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-03 12:51:16,669 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1489) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2023-11-03 12:51:16,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:51:16,746 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737165844] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:51:16,746 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:51:16,746 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 19
[2023-11-03 12:51:16,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799770343]
[2023-11-03 12:51:16,747 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:51:16,747 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2023-11-03 12:51:16,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:51:16,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2023-11-03 12:51:16,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=254, Unknown=29, NotChecked=70, Total=420
[2023-11-03 12:51:16,997 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-11-03 12:51:16,999 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 6615 transitions, 157879 flow. Second operand  has 21 states, 21 states have (on average 59.333333333333336) internal successors, (1246), 21 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:51:16,999 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:51:16,999 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-11-03 12:51:16,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:53:42,331 INFO  L130       PetriNetUnfolder]: 62112/101568 cut-off events.
[2023-11-03 12:53:42,331 INFO  L131       PetriNetUnfolder]: For 3107327/3107327 co-relation queries the response was YES.
[2023-11-03 12:53:44,820 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1104661 conditions, 101568 events. 62112/101568 cut-off events. For 3107327/3107327 co-relation queries the response was YES. Maximal size of possible extension queue 2864. Compared 859388 event pairs, 5700 based on Foata normal form. 227/98105 useless extension candidates. Maximal degree in co-relation 1093931. Up to 39400 conditions per place. 
[2023-11-03 12:53:45,597 INFO  L137   encePairwiseOnDemand]: 160/191 looper letters, 7168 selfloop transitions, 1610 changer transitions 3/8783 dead transitions.
[2023-11-03 12:53:45,597 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 8783 transitions, 217999 flow
[2023-11-03 12:53:45,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-11-03 12:53:45,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-11-03 12:53:45,599 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1497 transitions.
[2023-11-03 12:53:45,599 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3918848167539267
[2023-11-03 12:53:45,599 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1497 transitions.
[2023-11-03 12:53:45,599 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1497 transitions.
[2023-11-03 12:53:45,600 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:53:45,600 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1497 transitions.
[2023-11-03 12:53:45,602 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 74.85) internal successors, (1497), 20 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:53:45,604 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 191.0) internal successors, (4011), 21 states have internal predecessors, (4011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:53:45,604 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 191.0) internal successors, (4011), 21 states have internal predecessors, (4011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:53:45,604 INFO  L175             Difference]: Start difference. First operand has 390 places, 6615 transitions, 157879 flow. Second operand 20 states and 1497 transitions.
[2023-11-03 12:53:45,604 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 8783 transitions, 217999 flow
Killed by 15
