./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP --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 eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:06:57,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:06:58,031 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-06 23:06:58,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:06:58,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:06:58,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:06:58,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:06:58,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:06:58,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:06:58,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:06:58,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:06:58,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:06:58,071 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:06:58,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:06:58,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:06:58,073 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:06:58,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:06:58,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:06:58,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:06:58,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:06:58,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:06:58,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:06:58,076 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-06 23:06:58,077 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:06:58,077 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:06:58,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:06:58,079 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:06:58,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:06:58,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:06:58,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:06:58,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:06:58,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:06:58,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:06:58,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:06:58,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:06:58,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:06:58,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:06:58,104 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:06:58,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:06:58,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:06:58,106 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:06:58,106 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP 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 -> eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc [2023-11-06 23:06:58,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:06:58,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:06:58,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:06:58,394 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:06:58,395 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:06:58,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2023-11-06 23:07:01,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:07:01,666 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:07:01,667 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2023-11-06 23:07:01,679 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/data/bd3b27949/eb6b9d9e3f854a479849a23c3223557e/FLAGa8dd0c602 [2023-11-06 23:07:01,696 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/data/bd3b27949/eb6b9d9e3f854a479849a23c3223557e [2023-11-06 23:07:01,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:07:01,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:07:01,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:01,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:07:01,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:07:01,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:01,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a088a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01, skipping insertion in model container [2023-11-06 23:07:01,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:01,746 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:07:01,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:01,940 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:07:01,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:01,982 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:07:01,983 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:07:01,988 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:07:01,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01 WrapperNode [2023-11-06 23:07:01,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:01,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:01,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:07:01,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:07:01,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,044 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 178 [2023-11-06 23:07:02,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:02,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:07:02,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:07:02,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:07:02,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:07:02,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:07:02,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:07:02,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:07:02,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (1/1) ... [2023-11-06 23:07:02,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:02,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:07:02,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:07:02,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:07:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:07:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:07:02,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:07:02,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:07:02,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 23:07:02,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 23:07:02,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 23:07:02,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 23:07:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 23:07:02,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 23:07:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:07:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:07:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:07:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 23:07:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:07:02,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:07:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:07:02,182 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:07:02,292 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:07:02,294 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:07:02,894 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:07:03,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:07:03,037 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 23:07:03,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:03 BoogieIcfgContainer [2023-11-06 23:07:03,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:07:03,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:07:03,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:07:03,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:07:03,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:07:01" (1/3) ... [2023-11-06 23:07:03,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc4e3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:03, skipping insertion in model container [2023-11-06 23:07:03,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:01" (2/3) ... [2023-11-06 23:07:03,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc4e3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:03, skipping insertion in model container [2023-11-06 23:07:03,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:03" (3/3) ... [2023-11-06 23:07:03,058 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2023-11-06 23:07:03,068 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 23:07:03,079 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:07:03,079 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-06 23:07:03,079 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:07:03,279 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-06 23:07:03,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 292 transitions, 605 flow [2023-11-06 23:07:03,509 INFO L124 PetriNetUnfolderBase]: 16/289 cut-off events. [2023-11-06 23:07:03,509 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 23:07:03,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 289 events. 16/289 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 373 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 210. Up to 2 conditions per place. [2023-11-06 23:07:03,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 292 transitions, 605 flow [2023-11-06 23:07:03,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 266 transitions, 550 flow [2023-11-06 23:07:03,538 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:07:03,560 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 266 transitions, 550 flow [2023-11-06 23:07:03,565 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 266 transitions, 550 flow [2023-11-06 23:07:03,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 266 transitions, 550 flow [2023-11-06 23:07:03,645 INFO L124 PetriNetUnfolderBase]: 15/266 cut-off events. [2023-11-06 23:07:03,646 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 23:07:03,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 15/266 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 373 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 210. Up to 2 conditions per place. [2023-11-06 23:07:03,657 INFO L119 LiptonReduction]: Number of co-enabled transitions 7186 [2023-11-06 23:07:13,063 INFO L134 LiptonReduction]: Checked pairs total: 39478 [2023-11-06 23:07:13,064 INFO L136 LiptonReduction]: Total number of compositions: 244 [2023-11-06 23:07:13,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:07:13,088 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;@bda349, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:07:13,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-11-06 23:07:13,090 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:07:13,090 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:07:13,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:13,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:13,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:07:13,092 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:13,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:13,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1098, now seen corresponding path program 1 times [2023-11-06 23:07:13,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:13,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584391218] [2023-11-06 23:07:13,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:13,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:13,201 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-06 23:07:13,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:13,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584391218] [2023-11-06 23:07:13,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584391218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:07:13,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019779474] [2023-11-06 23:07:13,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:13,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:07:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:13,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:07:13,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:07:13,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 536 [2023-11-06 23:07:13,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 261.5) internal successors, (523), 2 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-06 23:07:13,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:13,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 536 [2023-11-06 23:07:13,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:13,599 INFO L124 PetriNetUnfolderBase]: 829/1845 cut-off events. [2023-11-06 23:07:13,599 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-06 23:07:13,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3042 conditions, 1845 events. 829/1845 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12719 event pairs, 462 based on Foata normal form. 327/1708 useless extension candidates. Maximal degree in co-relation 2493. Up to 1115 conditions per place. [2023-11-06 23:07:13,621 INFO L140 encePairwiseOnDemand]: 511/536 looper letters, 27 selfloop transitions, 0 changer transitions 1/63 dead transitions. [2023-11-06 23:07:13,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 200 flow [2023-11-06 23:07:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:07:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:07:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 575 transitions. [2023-11-06 23:07:13,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363805970149254 [2023-11-06 23:07:13,640 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 575 transitions. [2023-11-06 23:07:13,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 575 transitions. [2023-11-06 23:07:13,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:13,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 575 transitions. [2023-11-06 23:07:13,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 287.5) internal successors, (575), 2 states have internal predecessors, (575), 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-06 23:07:13,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 536.0) internal successors, (1608), 3 states have internal predecessors, (1608), 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-06 23:07:13,660 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 536.0) internal successors, (1608), 3 states have internal predecessors, (1608), 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-06 23:07:13,662 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 194 flow. Second operand 2 states and 575 transitions. [2023-11-06 23:07:13,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 200 flow [2023-11-06 23:07:13,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 23:07:13,670 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 129 flow [2023-11-06 23:07:13,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=129, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2023-11-06 23:07:13,677 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -27 predicate places. [2023-11-06 23:07:13,677 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 129 flow [2023-11-06 23:07:13,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 261.5) internal successors, (523), 2 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-06 23:07:13,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:13,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:13,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:07:13,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:13,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1426004936, now seen corresponding path program 1 times [2023-11-06 23:07:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159348457] [2023-11-06 23:07:13,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:13,850 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-06 23:07:13,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:13,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159348457] [2023-11-06 23:07:13,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159348457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:13,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:13,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:07:13,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747016149] [2023-11-06 23:07:13,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:13,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:07:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:07:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:07:13,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 536 [2023-11-06 23:07:13,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 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-06 23:07:13,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:13,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 536 [2023-11-06 23:07:13,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:14,249 INFO L124 PetriNetUnfolderBase]: 1433/2474 cut-off events. [2023-11-06 23:07:14,249 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-06 23:07:14,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4541 conditions, 2474 events. 1433/2474 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13708 event pairs, 1079 based on Foata normal form. 0/1960 useless extension candidates. Maximal degree in co-relation 4538. Up to 2021 conditions per place. [2023-11-06 23:07:14,271 INFO L140 encePairwiseOnDemand]: 532/536 looper letters, 30 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2023-11-06 23:07:14,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 185 flow [2023-11-06 23:07:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:07:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:07:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2023-11-06 23:07:14,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.472636815920398 [2023-11-06 23:07:14,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2023-11-06 23:07:14,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2023-11-06 23:07:14,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:14,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2023-11-06 23:07:14,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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-06 23:07:14,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 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-06 23:07:14,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 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-06 23:07:14,288 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 129 flow. Second operand 3 states and 760 transitions. [2023-11-06 23:07:14,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 185 flow [2023-11-06 23:07:14,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 185 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:07:14,291 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 125 flow [2023-11-06 23:07:14,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2023-11-06 23:07:14,292 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -29 predicate places. [2023-11-06 23:07:14,292 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 125 flow [2023-11-06 23:07:14,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 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-06 23:07:14,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:14,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:14,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:07:14,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:14,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash -295961260, now seen corresponding path program 1 times [2023-11-06 23:07:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:14,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388718886] [2023-11-06 23:07:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:14,374 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-06 23:07:14,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:14,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388718886] [2023-11-06 23:07:14,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388718886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:14,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:07:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487561271] [2023-11-06 23:07:14,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:14,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:07:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:07:14,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:07:14,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 536 [2023-11-06 23:07:14,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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-06 23:07:14,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:14,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 536 [2023-11-06 23:07:14,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:14,827 INFO L124 PetriNetUnfolderBase]: 1230/2387 cut-off events. [2023-11-06 23:07:14,827 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-06 23:07:14,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4101 conditions, 2387 events. 1230/2387 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15170 event pairs, 214 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 4097. Up to 1388 conditions per place. [2023-11-06 23:07:14,849 INFO L140 encePairwiseOnDemand]: 533/536 looper letters, 45 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2023-11-06 23:07:14,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 77 transitions, 259 flow [2023-11-06 23:07:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:07:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:07:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 819 transitions. [2023-11-06 23:07:14,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093283582089553 [2023-11-06 23:07:14,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 819 transitions. [2023-11-06 23:07:14,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 819 transitions. [2023-11-06 23:07:14,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:14,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 819 transitions. [2023-11-06 23:07:14,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-06 23:07:14,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 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-06 23:07:14,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 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-06 23:07:14,864 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 125 flow. Second operand 3 states and 819 transitions. [2023-11-06 23:07:14,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 77 transitions, 259 flow [2023-11-06 23:07:14,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:07:14,867 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 136 flow [2023-11-06 23:07:14,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-11-06 23:07:14,868 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -28 predicate places. [2023-11-06 23:07:14,868 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 136 flow [2023-11-06 23:07:14,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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-06 23:07:14,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:14,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:14,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:07:14,870 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:14,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:14,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2045105975, now seen corresponding path program 1 times [2023-11-06 23:07:14,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:14,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811734837] [2023-11-06 23:07:14,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:14,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:15,479 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-06 23:07:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:15,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811734837] [2023-11-06 23:07:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811734837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:15,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:15,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:07:15,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313930080] [2023-11-06 23:07:15,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:15,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:07:15,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:15,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:07:15,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:07:15,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 536 [2023-11-06 23:07:15,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 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-06 23:07:15,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:15,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 536 [2023-11-06 23:07:15,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:16,945 INFO L124 PetriNetUnfolderBase]: 4972/7095 cut-off events. [2023-11-06 23:07:16,945 INFO L125 PetriNetUnfolderBase]: For 954/968 co-relation queries the response was YES. [2023-11-06 23:07:16,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14732 conditions, 7095 events. 4972/7095 cut-off events. For 954/968 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 40966 event pairs, 1279 based on Foata normal form. 0/5473 useless extension candidates. Maximal degree in co-relation 14728. Up to 3537 conditions per place. [2023-11-06 23:07:17,005 INFO L140 encePairwiseOnDemand]: 529/536 looper letters, 86 selfloop transitions, 13 changer transitions 0/124 dead transitions. [2023-11-06 23:07:17,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 124 transitions, 504 flow [2023-11-06 23:07:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1548 transitions. [2023-11-06 23:07:17,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48134328358208955 [2023-11-06 23:07:17,012 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1548 transitions. [2023-11-06 23:07:17,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1548 transitions. [2023-11-06 23:07:17,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:17,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1548 transitions. [2023-11-06 23:07:17,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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-06 23:07:17,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 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-06 23:07:17,029 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 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-06 23:07:17,029 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 136 flow. Second operand 6 states and 1548 transitions. [2023-11-06 23:07:17,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 124 transitions, 504 flow [2023-11-06 23:07:17,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 124 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:07:17,034 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 246 flow [2023-11-06 23:07:17,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2023-11-06 23:07:17,035 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -18 predicate places. [2023-11-06 23:07:17,036 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 246 flow [2023-11-06 23:07:17,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 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-06 23:07:17,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:17,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:17,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:07:17,038 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:17,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:17,038 INFO L85 PathProgramCache]: Analyzing trace with hash -779785672, now seen corresponding path program 1 times [2023-11-06 23:07:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:17,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494585055] [2023-11-06 23:07:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:17,174 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-06 23:07:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494585055] [2023-11-06 23:07:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494585055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:17,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:07:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098985174] [2023-11-06 23:07:17,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:17,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:17,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:17,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:17,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:17,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 536 [2023-11-06 23:07:17,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 244.4) internal successors, (1222), 5 states have internal predecessors, (1222), 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-06 23:07:17,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:17,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 536 [2023-11-06 23:07:17,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:18,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([824] thread1EXIT-->L98-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem23#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][100], [289#true, 298#(= |#race~A~0| 0), 316#(<= ~N~0 0), Black: 296#true, 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 94#L72-4true, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 301#true, 143#thread2EXITtrue, Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 255#L98-7true, Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0)]) [2023-11-06 23:07:18,313 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 23:07:18,314 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:07:18,314 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:07:18,314 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:07:18,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([824] thread1EXIT-->L98-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem23#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][100], [289#true, 298#(= |#race~A~0| 0), 316#(<= ~N~0 0), Black: 296#true, 105#L77true, 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 301#true, 143#thread2EXITtrue, Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 255#L98-7true, Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0)]) [2023-11-06 23:07:18,314 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 23:07:18,315 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:07:18,315 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:07:18,315 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:07:18,439 INFO L124 PetriNetUnfolderBase]: 3629/6656 cut-off events. [2023-11-06 23:07:18,439 INFO L125 PetriNetUnfolderBase]: For 5384/5628 co-relation queries the response was YES. [2023-11-06 23:07:18,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15335 conditions, 6656 events. 3629/6656 cut-off events. For 5384/5628 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 48735 event pairs, 1454 based on Foata normal form. 4/5299 useless extension candidates. Maximal degree in co-relation 15326. Up to 3197 conditions per place. [2023-11-06 23:07:18,502 INFO L140 encePairwiseOnDemand]: 528/536 looper letters, 85 selfloop transitions, 9 changer transitions 0/128 dead transitions. [2023-11-06 23:07:18,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 675 flow [2023-11-06 23:07:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1526 transitions. [2023-11-06 23:07:18,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47450248756218905 [2023-11-06 23:07:18,509 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1526 transitions. [2023-11-06 23:07:18,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1526 transitions. [2023-11-06 23:07:18,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:18,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1526 transitions. [2023-11-06 23:07:18,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 254.33333333333334) internal successors, (1526), 6 states have internal predecessors, (1526), 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-06 23:07:18,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 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-06 23:07:18,525 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 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-06 23:07:18,525 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 246 flow. Second operand 6 states and 1526 transitions. [2023-11-06 23:07:18,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 675 flow [2023-11-06 23:07:18,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 128 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:07:18,549 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 306 flow [2023-11-06 23:07:18,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2023-11-06 23:07:18,550 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -9 predicate places. [2023-11-06 23:07:18,551 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 306 flow [2023-11-06 23:07:18,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 244.4) internal successors, (1222), 5 states have internal predecessors, (1222), 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-06 23:07:18,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:18,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:18,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:07:18,552 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:18,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:18,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2042808999, now seen corresponding path program 1 times [2023-11-06 23:07:18,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:18,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548064721] [2023-11-06 23:07:18,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:18,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:07:18,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:18,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548064721] [2023-11-06 23:07:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548064721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:18,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:07:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624559762] [2023-11-06 23:07:18,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:18,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:07:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:07:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:07:19,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 536 [2023-11-06 23:07:19,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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-06 23:07:19,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:19,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 536 [2023-11-06 23:07:19,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:21,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 151#L50-7true, 325#true, Black: 296#true, 87#L98-6true, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 123#thread3EXITtrue, 245#L61true, 313#true]) [2023-11-06 23:07:21,655 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 23:07:21,656 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:07:21,656 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:07:21,656 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:07:21,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, 8#L73true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 151#L50-7true, 325#true, Black: 296#true, 87#L98-6true, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 245#L61true, 313#true]) [2023-11-06 23:07:21,665 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 23:07:21,666 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:07:21,666 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:07:21,666 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:07:21,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 325#true, 151#L50-7true, Black: 296#true, 87#L98-6true, 94#L72-4true, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 245#L61true, 313#true]) [2023-11-06 23:07:21,696 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 23:07:21,696 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:07:21,697 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:07:21,697 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:07:21,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 325#true, 151#L50-7true, Black: 296#true, 105#L77true, 87#L98-6true, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 245#L61true, 313#true]) [2023-11-06 23:07:21,700 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 23:07:21,701 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:07:21,701 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:07:21,701 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:07:21,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 325#true, Black: 296#true, 87#L98-6true, 214#thread1EXITtrue, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 123#thread3EXITtrue, 245#L61true, 313#true]) [2023-11-06 23:07:21,709 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 23:07:21,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:07:21,709 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:07:21,710 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:07:21,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, 8#L73true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 325#true, Black: 296#true, 87#L98-6true, 214#thread1EXITtrue, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 245#L61true, 313#true]) [2023-11-06 23:07:21,711 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 23:07:21,712 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:07:21,712 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:07:21,712 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:07:21,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 325#true, Black: 296#true, 87#L98-6true, 4#L51-1true, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 123#thread3EXITtrue, 245#L61true, 313#true]) [2023-11-06 23:07:21,714 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 23:07:21,714 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:07:21,714 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:07:21,714 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:07:21,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, 8#L73true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 325#true, Black: 296#true, 87#L98-6true, 4#L51-1true, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 245#L61true, 313#true]) [2023-11-06 23:07:21,716 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 23:07:21,716 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:07:21,717 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:07:21,717 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:07:21,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 325#true, Black: 296#true, 87#L98-6true, 94#L72-4true, 214#thread1EXITtrue, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 245#L61true, 313#true]) [2023-11-06 23:07:21,735 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 23:07:21,735 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 23:07:21,735 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:07:21,736 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:07:21,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 325#true, Black: 296#true, 105#L77true, 87#L98-6true, 214#thread1EXITtrue, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 245#L61true, 313#true]) [2023-11-06 23:07:21,737 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 23:07:21,737 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:07:21,738 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:07:21,738 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 23:07:21,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 325#true, Black: 296#true, 87#L98-6true, 94#L72-4true, 4#L51-1true, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 245#L61true, 313#true]) [2023-11-06 23:07:21,740 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 23:07:21,740 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:07:21,740 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:07:21,740 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 23:07:21,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L58-2-->L61: Formula: (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) (let ((.cse0 (+ v_~C~0.offset_75 .cse4)) (.cse1 (+ v_~A~0.offset_57 .cse4))) (and (= |v_#race~A~0_42| 0) (= (store |v_#memory_int_104| v_~C~0.base_75 (store (select |v_#memory_int_104| v_~C~0.base_75) .cse0 (+ (select (select |v_#memory_int_104| v_~A~0.base_57) .cse1) 1))) |v_#memory_int_103|) (= |v_#race_261| (let ((.cse2 (store |v_#race_262| v_~A~0.base_57 (store (store (store (store (select |v_#race_262| v_~A~0.base_57) .cse1 0) (+ v_~A~0.offset_57 .cse4 1) 0) (+ 2 v_~A~0.offset_57 .cse4) 0) (+ 3 v_~A~0.offset_57 .cse4) 0)))) (store .cse2 v_~C~0.base_75 (let ((.cse5 (+ 3 v_~C~0.offset_75 .cse4))) (let ((.cse3 (select (select |v_#race_261| v_~C~0.base_75) .cse5))) (store (store (store (store (select .cse2 v_~C~0.base_75) .cse0 .cse3) (+ v_~C~0.offset_75 .cse4 1) .cse3) (+ 2 v_~C~0.offset_75 .cse4) .cse3) .cse5 .cse3)))))) (= |v_#race~C~0_54| 0) (< v_thread2Thread1of1ForFork1_~i~1_37 v_~N~0_34)))) InVars {#race=|v_#race_262|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_104|, ~N~0=v_~N~0_34} OutVars{#race=|v_#race_261|, ~A~0.base=v_~A~0.base_57, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_13|, ~A~0.offset=v_~A~0.offset_57, ~C~0.base=v_~C~0.base_75, ~C~0.offset=v_~C~0.offset_75, #memory_int=|v_#memory_int_103|, thread2Thread1of1ForFork1_#t~nondet6=|v_thread2Thread1of1ForFork1_#t~nondet6_9|, ~N~0=v_~N~0_34, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_42|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork1_#t~mem5, #memory_int, thread2Thread1of1ForFork1_#t~nondet6, #race~C~0, #race~A~0][75], [Black: 319#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0)), 289#true, Black: 317#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 316#(<= ~N~0 0), 298#(= |#race~A~0| 0), Black: 315#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0)), 325#true, Black: 296#true, 105#L77true, 87#L98-6true, 4#L51-1true, Black: 303#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 304#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 305#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 294#(= |#race~N~0| 0), 301#true, Black: 306#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 245#L61true, 313#true]) [2023-11-06 23:07:21,742 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 23:07:21,742 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 23:07:21,742 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:07:21,742 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:07:21,769 INFO L124 PetriNetUnfolderBase]: 6575/10877 cut-off events. [2023-11-06 23:07:21,769 INFO L125 PetriNetUnfolderBase]: For 10122/10998 co-relation queries the response was YES. [2023-11-06 23:07:21,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26300 conditions, 10877 events. 6575/10877 cut-off events. For 10122/10998 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 76836 event pairs, 2284 based on Foata normal form. 6/8754 useless extension candidates. Maximal degree in co-relation 26286. Up to 7138 conditions per place. [2023-11-06 23:07:21,901 INFO L140 encePairwiseOnDemand]: 529/536 looper letters, 97 selfloop transitions, 25 changer transitions 0/151 dead transitions. [2023-11-06 23:07:21,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 151 transitions, 814 flow [2023-11-06 23:07:21,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1542 transitions. [2023-11-06 23:07:21,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47947761194029853 [2023-11-06 23:07:21,909 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1542 transitions. [2023-11-06 23:07:21,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1542 transitions. [2023-11-06 23:07:21,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:21,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1542 transitions. [2023-11-06 23:07:21,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-06 23:07:21,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 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-06 23:07:21,926 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 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-06 23:07:21,926 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 306 flow. Second operand 6 states and 1542 transitions. [2023-11-06 23:07:21,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 151 transitions, 814 flow [2023-11-06 23:07:21,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 151 transitions, 814 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:07:21,952 INFO L231 Difference]: Finished difference. Result has 89 places, 103 transitions, 564 flow [2023-11-06 23:07:21,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=564, PETRI_PLACES=89, PETRI_TRANSITIONS=103} [2023-11-06 23:07:21,956 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 0 predicate places. [2023-11-06 23:07:21,959 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 103 transitions, 564 flow [2023-11-06 23:07:21,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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-06 23:07:21,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:21,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:21,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:07:21,961 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:21,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:21,962 INFO L85 PathProgramCache]: Analyzing trace with hash -835402152, now seen corresponding path program 1 times [2023-11-06 23:07:21,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:21,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327990491] [2023-11-06 23:07:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,145 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-06 23:07:22,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:22,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327990491] [2023-11-06 23:07:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327990491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:22,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:07:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328687653] [2023-11-06 23:07:22,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:22,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:22,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:22,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 536 [2023-11-06 23:07:22,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 103 transitions, 564 flow. Second operand has 5 states, 5 states have (on average 245.2) internal successors, (1226), 5 states have internal predecessors, (1226), 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-06 23:07:22,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:22,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 536 [2023-11-06 23:07:22,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:23,589 INFO L124 PetriNetUnfolderBase]: 3827/7038 cut-off events. [2023-11-06 23:07:23,590 INFO L125 PetriNetUnfolderBase]: For 9913/10584 co-relation queries the response was YES. [2023-11-06 23:07:23,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18057 conditions, 7038 events. 3827/7038 cut-off events. For 9913/10584 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 53261 event pairs, 1741 based on Foata normal form. 126/5564 useless extension candidates. Maximal degree in co-relation 18038. Up to 4740 conditions per place. [2023-11-06 23:07:23,765 INFO L140 encePairwiseOnDemand]: 528/536 looper letters, 84 selfloop transitions, 9 changer transitions 0/131 dead transitions. [2023-11-06 23:07:23,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 131 transitions, 817 flow [2023-11-06 23:07:23,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1521 transitions. [2023-11-06 23:07:23,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47294776119402987 [2023-11-06 23:07:23,782 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1521 transitions. [2023-11-06 23:07:23,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1521 transitions. [2023-11-06 23:07:23,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:23,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1521 transitions. [2023-11-06 23:07:23,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 253.5) internal successors, (1521), 6 states have internal predecessors, (1521), 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-06 23:07:23,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 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-06 23:07:23,808 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 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-06 23:07:23,808 INFO L175 Difference]: Start difference. First operand has 89 places, 103 transitions, 564 flow. Second operand 6 states and 1521 transitions. [2023-11-06 23:07:23,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 131 transitions, 817 flow [2023-11-06 23:07:23,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 131 transitions, 777 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-11-06 23:07:23,844 INFO L231 Difference]: Finished difference. Result has 96 places, 105 transitions, 566 flow [2023-11-06 23:07:23,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=566, PETRI_PLACES=96, PETRI_TRANSITIONS=105} [2023-11-06 23:07:23,845 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 7 predicate places. [2023-11-06 23:07:23,845 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 105 transitions, 566 flow [2023-11-06 23:07:23,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 245.2) internal successors, (1226), 5 states have internal predecessors, (1226), 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-06 23:07:23,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:23,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:23,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:07:23,847 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:23,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1463378611, now seen corresponding path program 1 times [2023-11-06 23:07:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:23,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019176244] [2023-11-06 23:07:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:23,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:07:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:24,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019176244] [2023-11-06 23:07:24,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019176244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:24,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:24,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:07:24,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304161155] [2023-11-06 23:07:24,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:24,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:07:24,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:24,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:07:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:07:25,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 536 [2023-11-06 23:07:25,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 105 transitions, 566 flow. Second operand has 10 states, 10 states have (on average 234.7) internal successors, (2347), 10 states have internal predecessors, (2347), 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-06 23:07:25,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:25,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 536 [2023-11-06 23:07:25,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:27,719 INFO L124 PetriNetUnfolderBase]: 7414/11209 cut-off events. [2023-11-06 23:07:27,720 INFO L125 PetriNetUnfolderBase]: For 11452/14887 co-relation queries the response was YES. [2023-11-06 23:07:27,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31663 conditions, 11209 events. 7414/11209 cut-off events. For 11452/14887 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 72075 event pairs, 759 based on Foata normal form. 1033/10122 useless extension candidates. Maximal degree in co-relation 31641. Up to 3462 conditions per place. [2023-11-06 23:07:27,864 INFO L140 encePairwiseOnDemand]: 529/536 looper letters, 143 selfloop transitions, 11 changer transitions 0/184 dead transitions. [2023-11-06 23:07:27,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 184 transitions, 1230 flow [2023-11-06 23:07:27,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:07:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:07:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1945 transitions. [2023-11-06 23:07:27,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45359141791044777 [2023-11-06 23:07:27,874 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1945 transitions. [2023-11-06 23:07:27,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1945 transitions. [2023-11-06 23:07:27,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:27,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1945 transitions. [2023-11-06 23:07:27,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 243.125) internal successors, (1945), 8 states have internal predecessors, (1945), 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-06 23:07:27,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 536.0) internal successors, (4824), 9 states have internal predecessors, (4824), 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-06 23:07:27,893 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 536.0) internal successors, (4824), 9 states have internal predecessors, (4824), 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-06 23:07:27,893 INFO L175 Difference]: Start difference. First operand has 96 places, 105 transitions, 566 flow. Second operand 8 states and 1945 transitions. [2023-11-06 23:07:27,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 184 transitions, 1230 flow [2023-11-06 23:07:28,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 184 transitions, 1210 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:07:28,056 INFO L231 Difference]: Finished difference. Result has 98 places, 104 transitions, 564 flow [2023-11-06 23:07:28,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=564, PETRI_PLACES=98, PETRI_TRANSITIONS=104} [2023-11-06 23:07:28,061 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 9 predicate places. [2023-11-06 23:07:28,061 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 104 transitions, 564 flow [2023-11-06 23:07:28,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 234.7) internal successors, (2347), 10 states have internal predecessors, (2347), 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-06 23:07:28,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:28,063 INFO L208 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] [2023-11-06 23:07:28,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:07:28,063 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:28,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash -7966272, now seen corresponding path program 1 times [2023-11-06 23:07:28,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:28,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719139568] [2023-11-06 23:07:28,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:28,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:07:28,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:28,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719139568] [2023-11-06 23:07:28,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719139568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:28,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:28,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:07:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224293760] [2023-11-06 23:07:28,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:28,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:07:28,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:28,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:07:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:07:29,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 536 [2023-11-06 23:07:29,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 104 transitions, 564 flow. Second operand has 8 states, 8 states have (on average 233.75) internal successors, (1870), 8 states have internal predecessors, (1870), 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-06 23:07:29,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:29,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 536 [2023-11-06 23:07:29,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:32,666 INFO L124 PetriNetUnfolderBase]: 10708/18811 cut-off events. [2023-11-06 23:07:32,667 INFO L125 PetriNetUnfolderBase]: For 28090/31018 co-relation queries the response was YES. [2023-11-06 23:07:32,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51249 conditions, 18811 events. 10708/18811 cut-off events. For 28090/31018 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 152966 event pairs, 1960 based on Foata normal form. 393/15885 useless extension candidates. Maximal degree in co-relation 51228. Up to 5971 conditions per place. [2023-11-06 23:07:32,911 INFO L140 encePairwiseOnDemand]: 526/536 looper letters, 166 selfloop transitions, 54 changer transitions 0/254 dead transitions. [2023-11-06 23:07:32,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 254 transitions, 1957 flow [2023-11-06 23:07:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:07:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:07:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1949 transitions. [2023-11-06 23:07:32,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4545242537313433 [2023-11-06 23:07:32,926 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1949 transitions. [2023-11-06 23:07:32,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1949 transitions. [2023-11-06 23:07:32,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:32,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1949 transitions. [2023-11-06 23:07:32,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 243.625) internal successors, (1949), 8 states have internal predecessors, (1949), 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-06 23:07:32,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 536.0) internal successors, (4824), 9 states have internal predecessors, (4824), 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-06 23:07:32,959 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 536.0) internal successors, (4824), 9 states have internal predecessors, (4824), 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-06 23:07:32,959 INFO L175 Difference]: Start difference. First operand has 98 places, 104 transitions, 564 flow. Second operand 8 states and 1949 transitions. [2023-11-06 23:07:32,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 254 transitions, 1957 flow [2023-11-06 23:07:33,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 254 transitions, 1937 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 23:07:33,120 INFO L231 Difference]: Finished difference. Result has 103 places, 151 transitions, 1160 flow [2023-11-06 23:07:33,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1160, PETRI_PLACES=103, PETRI_TRANSITIONS=151} [2023-11-06 23:07:33,121 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 14 predicate places. [2023-11-06 23:07:33,122 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 151 transitions, 1160 flow [2023-11-06 23:07:33,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 233.75) internal successors, (1870), 8 states have internal predecessors, (1870), 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-06 23:07:33,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:33,123 INFO L208 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] [2023-11-06 23:07:33,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:07:33,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:33,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1073083876, now seen corresponding path program 2 times [2023-11-06 23:07:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209063385] [2023-11-06 23:07:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:07:33,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209063385] [2023-11-06 23:07:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209063385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:33,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:33,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:07:33,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145445650] [2023-11-06 23:07:33,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:33,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:07:33,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:33,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:07:33,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:07:34,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 536 [2023-11-06 23:07:34,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 151 transitions, 1160 flow. Second operand has 8 states, 8 states have (on average 233.75) internal successors, (1870), 8 states have internal predecessors, (1870), 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-06 23:07:34,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:34,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 536 [2023-11-06 23:07:34,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:38,947 INFO L124 PetriNetUnfolderBase]: 15550/26510 cut-off events. [2023-11-06 23:07:38,947 INFO L125 PetriNetUnfolderBase]: For 72522/80004 co-relation queries the response was YES. [2023-11-06 23:07:39,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83985 conditions, 26510 events. 15550/26510 cut-off events. For 72522/80004 co-relation queries the response was YES. Maximal size of possible extension queue 1394. Compared 226106 event pairs, 3009 based on Foata normal form. 1040/23162 useless extension candidates. Maximal degree in co-relation 83960. Up to 12693 conditions per place. [2023-11-06 23:07:39,252 INFO L140 encePairwiseOnDemand]: 526/536 looper letters, 205 selfloop transitions, 59 changer transitions 0/298 dead transitions. [2023-11-06 23:07:39,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 298 transitions, 2813 flow [2023-11-06 23:07:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:07:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:07:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1950 transitions. [2023-11-06 23:07:39,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45475746268656714 [2023-11-06 23:07:39,264 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1950 transitions. [2023-11-06 23:07:39,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1950 transitions. [2023-11-06 23:07:39,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:39,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1950 transitions. [2023-11-06 23:07:39,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 243.75) internal successors, (1950), 8 states have internal predecessors, (1950), 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-06 23:07:39,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 536.0) internal successors, (4824), 9 states have internal predecessors, (4824), 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-06 23:07:39,281 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 536.0) internal successors, (4824), 9 states have internal predecessors, (4824), 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-06 23:07:39,281 INFO L175 Difference]: Start difference. First operand has 103 places, 151 transitions, 1160 flow. Second operand 8 states and 1950 transitions. [2023-11-06 23:07:39,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 298 transitions, 2813 flow [2023-11-06 23:07:39,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 298 transitions, 2808 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:07:39,716 INFO L231 Difference]: Finished difference. Result has 112 places, 199 transitions, 1898 flow [2023-11-06 23:07:39,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1898, PETRI_PLACES=112, PETRI_TRANSITIONS=199} [2023-11-06 23:07:39,718 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 23 predicate places. [2023-11-06 23:07:39,719 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 199 transitions, 1898 flow [2023-11-06 23:07:39,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 233.75) internal successors, (1870), 8 states have internal predecessors, (1870), 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-06 23:07:39,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:39,720 INFO L208 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-06 23:07:39,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:07:39,720 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:39,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:39,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2028330716, now seen corresponding path program 1 times [2023-11-06 23:07:39,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:39,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784577212] [2023-11-06 23:07:39,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:39,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:40,168 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-06 23:07:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784577212] [2023-11-06 23:07:40,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784577212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:40,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:40,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:07:40,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959277351] [2023-11-06 23:07:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:40,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:07:40,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:40,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:07:40,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:07:40,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 536 [2023-11-06 23:07:40,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 199 transitions, 1898 flow. Second operand has 6 states, 6 states have (on average 245.83333333333334) internal successors, (1475), 6 states have internal predecessors, (1475), 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-06 23:07:40,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:40,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 536 [2023-11-06 23:07:40,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:46,468 INFO L124 PetriNetUnfolderBase]: 16171/27760 cut-off events. [2023-11-06 23:07:46,468 INFO L125 PetriNetUnfolderBase]: For 124702/137842 co-relation queries the response was YES. [2023-11-06 23:07:46,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100893 conditions, 27760 events. 16171/27760 cut-off events. For 124702/137842 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 235916 event pairs, 5700 based on Foata normal form. 652/24521 useless extension candidates. Maximal degree in co-relation 100864. Up to 18446 conditions per place. [2023-11-06 23:07:46,873 INFO L140 encePairwiseOnDemand]: 529/536 looper letters, 203 selfloop transitions, 17 changer transitions 0/257 dead transitions. [2023-11-06 23:07:46,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 257 transitions, 2719 flow [2023-11-06 23:07:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:46,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2023-11-06 23:07:46,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47574626865671643 [2023-11-06 23:07:46,880 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1530 transitions. [2023-11-06 23:07:46,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1530 transitions. [2023-11-06 23:07:46,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:46,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1530 transitions. [2023-11-06 23:07:46,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 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-06 23:07:46,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 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-06 23:07:46,893 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 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-06 23:07:46,893 INFO L175 Difference]: Start difference. First operand has 112 places, 199 transitions, 1898 flow. Second operand 6 states and 1530 transitions. [2023-11-06 23:07:46,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 257 transitions, 2719 flow [2023-11-06 23:07:47,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 257 transitions, 2644 flow, removed 35 selfloop flow, removed 2 redundant places. [2023-11-06 23:07:47,466 INFO L231 Difference]: Finished difference. Result has 120 places, 215 transitions, 2071 flow [2023-11-06 23:07:47,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=1823, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2071, PETRI_PLACES=120, PETRI_TRANSITIONS=215} [2023-11-06 23:07:47,467 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2023-11-06 23:07:47,468 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 215 transitions, 2071 flow [2023-11-06 23:07:47,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.83333333333334) internal successors, (1475), 6 states have internal predecessors, (1475), 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-06 23:07:47,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:47,469 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:47,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:07:47,469 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:47,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2037395275, now seen corresponding path program 1 times [2023-11-06 23:07:47,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:47,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234048519] [2023-11-06 23:07:47,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:47,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:07:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234048519] [2023-11-06 23:07:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234048519] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:07:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953684474] [2023-11-06 23:07:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:47,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:07:47,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:07:47,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:07:47,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:07:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:48,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 23:07:48,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:07:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:07:48,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:07:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:07:48,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953684474] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:07:48,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:07:48,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-06 23:07:48,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346118904] [2023-11-06 23:07:48,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:07:48,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 23:07:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:48,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 23:07:48,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:07:48,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 536 [2023-11-06 23:07:48,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 215 transitions, 2071 flow. Second operand has 14 states, 14 states have (on average 240.07142857142858) internal successors, (3361), 14 states have internal predecessors, (3361), 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-06 23:07:48,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:48,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 536 [2023-11-06 23:07:48,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:57,157 INFO L124 PetriNetUnfolderBase]: 23398/43310 cut-off events. [2023-11-06 23:07:57,158 INFO L125 PetriNetUnfolderBase]: For 241246/259625 co-relation queries the response was YES. [2023-11-06 23:07:57,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150430 conditions, 43310 events. 23398/43310 cut-off events. For 241246/259625 co-relation queries the response was YES. Maximal size of possible extension queue 2154. Compared 424263 event pairs, 7270 based on Foata normal form. 4955/41929 useless extension candidates. Maximal degree in co-relation 150397. Up to 18150 conditions per place. [2023-11-06 23:07:57,807 INFO L140 encePairwiseOnDemand]: 527/536 looper letters, 337 selfloop transitions, 29 changer transitions 0/409 dead transitions. [2023-11-06 23:07:57,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 409 transitions, 4650 flow [2023-11-06 23:07:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:07:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:07:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2235 transitions. [2023-11-06 23:07:57,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4633084577114428 [2023-11-06 23:07:57,817 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2235 transitions. [2023-11-06 23:07:57,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2235 transitions. [2023-11-06 23:07:57,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:57,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2235 transitions. [2023-11-06 23:07:57,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 248.33333333333334) internal successors, (2235), 9 states have internal predecessors, (2235), 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-06 23:07:57,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 536.0) internal successors, (5360), 10 states have internal predecessors, (5360), 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-06 23:07:57,836 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 536.0) internal successors, (5360), 10 states have internal predecessors, (5360), 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-06 23:07:57,837 INFO L175 Difference]: Start difference. First operand has 120 places, 215 transitions, 2071 flow. Second operand 9 states and 2235 transitions. [2023-11-06 23:07:57,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 409 transitions, 4650 flow [2023-11-06 23:07:58,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 409 transitions, 4626 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-11-06 23:07:58,930 INFO L231 Difference]: Finished difference. Result has 132 places, 232 transitions, 2372 flow [2023-11-06 23:07:58,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2372, PETRI_PLACES=132, PETRI_TRANSITIONS=232} [2023-11-06 23:07:58,931 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 43 predicate places. [2023-11-06 23:07:58,932 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 232 transitions, 2372 flow [2023-11-06 23:07:58,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 240.07142857142858) internal successors, (3361), 14 states have internal predecessors, (3361), 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-06 23:07:58,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:58,933 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:58,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:07:59,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 23:07:59,140 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:07:59,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash -280060164, now seen corresponding path program 2 times [2023-11-06 23:07:59,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:59,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771875601] [2023-11-06 23:07:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:59,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:08:00,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:00,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771875601] [2023-11-06 23:08:00,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771875601] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:00,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041405851] [2023-11-06 23:08:00,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:08:00,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:00,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:00,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:00,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:08:00,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:08:00,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:08:00,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 23:08:00,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:00,986 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2023-11-06 23:08:01,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,003 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:08:01,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,011 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:08:01,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:08:01,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:08:01,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,029 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:08:01,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,043 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:08:01,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:08:01,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:08:01,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:08:01,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,071 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:08:01,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:08:01,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:08:01,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,100 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:08:01,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:08:01,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-06 23:08:01,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:08:01,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,148 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:08:01,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:08:01,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,163 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:08:01,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:08:01,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:08:01,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:08:01,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:08:01,227 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:08:01,228 INFO L351 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 11 treesize of output 11 [2023-11-06 23:08:01,454 INFO L351 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-06 23:08:01,504 INFO L351 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 19 treesize of output 18 [2023-11-06 23:08:01,574 INFO L351 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 26 treesize of output 28 [2023-11-06 23:08:01,651 INFO L351 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 33 treesize of output 38 [2023-11-06 23:08:01,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:01,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 91 [2023-11-06 23:08:01,840 INFO L351 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 57 treesize of output 42 [2023-11-06 23:08:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:08:03,956 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041405851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:03,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:08:03,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2023-11-06 23:08:03,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106591523] [2023-11-06 23:08:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:03,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 23:08:03,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:03,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 23:08:03,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=427, Unknown=1, NotChecked=0, Total=552 [2023-11-06 23:08:06,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:08,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:10,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:12,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:14,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:16,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:18,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:20,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:22,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:24,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:26,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:28,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:30,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:33,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:35,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:37,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:39,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:41,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:43,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:45,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:47,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:49,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:51,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:51,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 536 [2023-11-06 23:08:51,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 232 transitions, 2372 flow. Second operand has 13 states, 13 states have (on average 207.6153846153846) internal successors, (2699), 13 states have internal predecessors, (2699), 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-06 23:08:51,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:51,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 536 [2023-11-06 23:08:51,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:55,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:08:58,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:01,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:03,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:05,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:09,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:11,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:13,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:25,875 INFO L124 PetriNetUnfolderBase]: 54603/87068 cut-off events. [2023-11-06 23:09:25,875 INFO L125 PetriNetUnfolderBase]: For 376293/386956 co-relation queries the response was YES. [2023-11-06 23:09:26,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311724 conditions, 87068 events. 54603/87068 cut-off events. For 376293/386956 co-relation queries the response was YES. Maximal size of possible extension queue 3634. Compared 773226 event pairs, 6901 based on Foata normal form. 2859/78506 useless extension candidates. Maximal degree in co-relation 311686. Up to 28045 conditions per place. [2023-11-06 23:09:27,394 INFO L140 encePairwiseOnDemand]: 522/536 looper letters, 392 selfloop transitions, 66 changer transitions 1/482 dead transitions. [2023-11-06 23:09:27,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 482 transitions, 5289 flow [2023-11-06 23:09:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:09:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-06 23:09:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2864 transitions. [2023-11-06 23:09:27,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41102181400688864 [2023-11-06 23:09:27,407 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2864 transitions. [2023-11-06 23:09:27,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2864 transitions. [2023-11-06 23:09:27,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:09:27,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2864 transitions. [2023-11-06 23:09:27,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 220.30769230769232) internal successors, (2864), 13 states have internal predecessors, (2864), 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-06 23:09:27,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 536.0) internal successors, (7504), 14 states have internal predecessors, (7504), 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-06 23:09:27,436 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 536.0) internal successors, (7504), 14 states have internal predecessors, (7504), 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-06 23:09:27,437 INFO L175 Difference]: Start difference. First operand has 132 places, 232 transitions, 2372 flow. Second operand 13 states and 2864 transitions. [2023-11-06 23:09:27,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 482 transitions, 5289 flow [2023-11-06 23:09:48,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 482 transitions, 5229 flow, removed 27 selfloop flow, removed 1 redundant places. [2023-11-06 23:09:48,074 INFO L231 Difference]: Finished difference. Result has 151 places, 266 transitions, 2953 flow [2023-11-06 23:09:48,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2953, PETRI_PLACES=151, PETRI_TRANSITIONS=266} [2023-11-06 23:09:48,075 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 62 predicate places. [2023-11-06 23:09:48,075 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 266 transitions, 2953 flow [2023-11-06 23:09:48,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 207.6153846153846) internal successors, (2699), 13 states have internal predecessors, (2699), 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-06 23:09:48,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:48,077 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:48,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:09:48,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 23:09:48,279 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-06 23:09:48,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:48,280 INFO L85 PathProgramCache]: Analyzing trace with hash -707588554, now seen corresponding path program 3 times [2023-11-06 23:09:48,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:48,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321766418] [2023-11-06 23:09:48,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:48,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:09:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321766418] [2023-11-06 23:09:49,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321766418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:09:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637885737] [2023-11-06 23:09:49,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:09:49,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:09:49,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:09:49,522 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:09:49,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6bc9f99-e559-4634-89d8-2b0f533de4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:09:49,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 23:09:49,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:09:49,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 23:09:49,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:09:49,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2023-11-06 23:09:49,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:49,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:09:49,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:49,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:09:49,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:49,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:09:49,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:49,986 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:09:49,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:49,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:09:50,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:09:50,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:09:50,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:09:50,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:09:50,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:09:50,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,042 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:09:50,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,056 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:09:50,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:09:50,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:09:50,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:09:50,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:09:50,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,122 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-06 23:09:50,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:09:50,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,144 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 23:09:50,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:09:50,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:09:50,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,165 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-11-06 23:09:50,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 [2023-11-06 23:09:50,220 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:09:50,220 INFO L351 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 11 treesize of output 11 [2023-11-06 23:09:50,483 INFO L351 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-06 23:09:50,545 INFO L351 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 19 treesize of output 18 [2023-11-06 23:09:50,642 INFO L351 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 26 treesize of output 28 [2023-11-06 23:09:50,729 INFO L351 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 33 treesize of output 38 [2023-11-06 23:09:50,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:50,995 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 91 [2023-11-06 23:09:51,007 INFO L351 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 57 treesize of output 42 [2023-11-06 23:09:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:09:55,117 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:09:55,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637885737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:55,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:09:55,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2023-11-06 23:09:55,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753070729] [2023-11-06 23:09:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:55,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 23:09:55,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 23:09:55,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=439, Unknown=2, NotChecked=0, Total=552 [2023-11-06 23:09:57,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:09:59,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:01,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:03,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:05,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:07,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:09,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:11,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:13,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:15,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:17,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:19,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:21,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:23,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:25,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:27,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:29,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:31,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:33,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:35,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:37,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:39,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:41,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:44,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:46,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:48,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:50,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:52,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:54,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:56,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:58,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:10:58,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 536 [2023-11-06 23:10:58,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 266 transitions, 2953 flow. Second operand has 13 states, 13 states have (on average 207.6153846153846) internal successors, (2699), 13 states have internal predecessors, (2699), 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-06 23:10:58,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:58,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 536 [2023-11-06 23:10:58,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand