./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:08:40,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:08:40,114 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 01:08:40,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:08:40,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:08:40,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:08:40,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:08:40,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:08:40,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:08:40,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:08:40,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:08:40,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:08:40,148 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:08:40,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:08:40,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:08:40,150 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:08:40,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:08:40,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:08:40,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:08:40,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:08:40,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:08:40,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:08:40,153 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 01:08:40,154 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:08:40,154 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:08:40,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:08:40,155 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:08:40,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:08:40,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:08:40,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:08:40,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:08:40,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:08:40,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:08:40,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:08:40,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:08:40,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:08:40,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:08:40,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:08:40,160 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:08:40,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:08:40,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:08:40,161 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_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/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_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2023-11-29 01:08:40,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:08:40,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:08:40,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:08:40,447 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:08:40,447 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:08:40,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2023-11-29 01:08:43,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:08:43,784 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:08:43,785 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2023-11-29 01:08:43,794 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/data/8d4b55889/2f4e060c8a624af58eba09b90ff193f6/FLAG833f6df8d [2023-11-29 01:08:43,808 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/data/8d4b55889/2f4e060c8a624af58eba09b90ff193f6 [2023-11-29 01:08:43,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:08:43,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:08:43,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:08:43,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:08:43,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:08:43,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:08:43" (1/1) ... [2023-11-29 01:08:43,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc7fc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:43, skipping insertion in model container [2023-11-29 01:08:43,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:08:43" (1/1) ... [2023-11-29 01:08:43,850 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:08:44,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:08:44,071 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:08:44,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:08:44,139 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:08:44,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44 WrapperNode [2023-11-29 01:08:44,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:08:44,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:08:44,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:08:44,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:08:44,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,220 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 521 [2023-11-29 01:08:44,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:08:44,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:08:44,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:08:44,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:08:44,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:08:44,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:08:44,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:08:44,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:08:44,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (1/1) ... [2023-11-29 01:08:44,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:08:44,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:08:44,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:08:44,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:08:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:08:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:08:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 01:08:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 01:08:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 01:08:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 01:08:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 01:08:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 01:08:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 01:08:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 01:08:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 01:08:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:08:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:08:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:08:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:08:44,384 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 01:08:44,538 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:08:44,540 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:08:45,464 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:08:45,488 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:08:45,488 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-29 01:08:45,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:08:45 BoogieIcfgContainer [2023-11-29 01:08:45,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:08:45,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:08:45,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:08:45,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:08:45,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:08:43" (1/3) ... [2023-11-29 01:08:45,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495af75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:08:45, skipping insertion in model container [2023-11-29 01:08:45,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:44" (2/3) ... [2023-11-29 01:08:45,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495af75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:08:45, skipping insertion in model container [2023-11-29 01:08:45,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:08:45" (3/3) ... [2023-11-29 01:08:45,502 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2023-11-29 01:08:45,513 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 01:08:45,527 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:08:45,527 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-11-29 01:08:45,527 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:08:45,734 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 01:08:45,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 638 places, 661 transitions, 1343 flow [2023-11-29 01:08:46,123 INFO L124 PetriNetUnfolderBase]: 33/658 cut-off events. [2023-11-29 01:08:46,123 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:08:46,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 658 events. 33/658 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1532 event pairs, 0 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 467. Up to 3 conditions per place. [2023-11-29 01:08:46,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 638 places, 661 transitions, 1343 flow [2023-11-29 01:08:46,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 611 places, 632 transitions, 1282 flow [2023-11-29 01:08:46,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:08:46,186 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=LoopHeads, 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;@45176865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:08:46,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 107 error locations. [2023-11-29 01:08:46,192 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:08:46,192 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-29 01:08:46,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:08:46,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:08:46,193 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, 1, 1] [2023-11-29 01:08:46,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:08:46,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:08:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash 626579345, now seen corresponding path program 1 times [2023-11-29 01:08:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:08:46,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454582166] [2023-11-29 01:08:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:08:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:08:46,441 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-29 01:08:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:08:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454582166] [2023-11-29 01:08:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454582166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:08:46,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:08:46,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:08:46,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017712294] [2023-11-29 01:08:46,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:08:46,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:08:46,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:08:46,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:08:46,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:08:46,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 661 [2023-11-29 01:08:46,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 632 transitions, 1282 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 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-29 01:08:46,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:08:46,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 661 [2023-11-29 01:08:46,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:08:47,238 INFO L124 PetriNetUnfolderBase]: 56/1512 cut-off events. [2023-11-29 01:08:47,238 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 01:08:47,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1600 conditions, 1512 events. 56/1512 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8425 event pairs, 20 based on Foata normal form. 42/1311 useless extension candidates. Maximal degree in co-relation 1207. Up to 51 conditions per place. [2023-11-29 01:08:47,284 INFO L140 encePairwiseOnDemand]: 639/661 looper letters, 14 selfloop transitions, 2 changer transitions 7/612 dead transitions. [2023-11-29 01:08:47,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 612 transitions, 1274 flow [2023-11-29 01:08:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:08:47,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:08:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1902 transitions. [2023-11-29 01:08:47,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9591527987897126 [2023-11-29 01:08:47,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1902 transitions. [2023-11-29 01:08:47,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1902 transitions. [2023-11-29 01:08:47,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:08:47,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1902 transitions. [2023-11-29 01:08:47,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 634.0) internal successors, (1902), 3 states have internal predecessors, (1902), 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-29 01:08:47,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:08:47,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:08:47,340 INFO L175 Difference]: Start difference. First operand has 611 places, 632 transitions, 1282 flow. Second operand 3 states and 1902 transitions. [2023-11-29 01:08:47,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 612 transitions, 1274 flow [2023-11-29 01:08:47,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 612 transitions, 1262 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 01:08:47,364 INFO L231 Difference]: Finished difference. Result has 606 places, 605 transitions, 1220 flow [2023-11-29 01:08:47,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1220, PETRI_PLACES=606, PETRI_TRANSITIONS=605} [2023-11-29 01:08:47,371 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -5 predicate places. [2023-11-29 01:08:47,372 INFO L495 AbstractCegarLoop]: Abstraction has has 606 places, 605 transitions, 1220 flow [2023-11-29 01:08:47,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 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-29 01:08:47,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:08:47,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:08:47,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:08:47,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:08:47,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:08:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 992899961, now seen corresponding path program 1 times [2023-11-29 01:08:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:08:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519885916] [2023-11-29 01:08:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:08:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:08:47,449 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-29 01:08:47,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:08:47,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519885916] [2023-11-29 01:08:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519885916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:08:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:08:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:08:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470622848] [2023-11-29 01:08:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:08:47,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:08:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:08:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:08:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:08:47,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 661 [2023-11-29 01:08:47,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 605 transitions, 1220 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 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-29 01:08:47,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:08:47,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 661 [2023-11-29 01:08:47,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:08:47,976 INFO L124 PetriNetUnfolderBase]: 36/1080 cut-off events. [2023-11-29 01:08:47,976 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 01:08:48,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 1080 events. 36/1080 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4933 event pairs, 12 based on Foata normal form. 0/925 useless extension candidates. Maximal degree in co-relation 1098. Up to 39 conditions per place. [2023-11-29 01:08:48,018 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 14 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2023-11-29 01:08:48,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 604 transitions, 1250 flow [2023-11-29 01:08:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:08:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:08:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2023-11-29 01:08:48,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9495713565305093 [2023-11-29 01:08:48,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1883 transitions. [2023-11-29 01:08:48,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1883 transitions. [2023-11-29 01:08:48,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:08:48,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1883 transitions. [2023-11-29 01:08:48,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-29 01:08:48,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:08:48,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:08:48,074 INFO L175 Difference]: Start difference. First operand has 606 places, 605 transitions, 1220 flow. Second operand 3 states and 1883 transitions. [2023-11-29 01:08:48,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 604 transitions, 1250 flow [2023-11-29 01:08:48,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 604 transitions, 1246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:08:48,091 INFO L231 Difference]: Finished difference. Result has 598 places, 604 transitions, 1218 flow [2023-11-29 01:08:48,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1218, PETRI_PLACES=598, PETRI_TRANSITIONS=604} [2023-11-29 01:08:48,093 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -13 predicate places. [2023-11-29 01:08:48,094 INFO L495 AbstractCegarLoop]: Abstraction has has 598 places, 604 transitions, 1218 flow [2023-11-29 01:08:48,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 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-29 01:08:48,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:08:48,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:08:48,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:08:48,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:08:48,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:08:48,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2100432766, now seen corresponding path program 1 times [2023-11-29 01:08:48,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:08:48,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817461702] [2023-11-29 01:08:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:08:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:08:48,164 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-29 01:08:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:08:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817461702] [2023-11-29 01:08:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817461702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:08:48,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:08:48,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:08:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342203642] [2023-11-29 01:08:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:08:48,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:08:48,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:08:48,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:08:48,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:08:48,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 661 [2023-11-29 01:08:48,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 604 transitions, 1218 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 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-29 01:08:48,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:08:48,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 661 [2023-11-29 01:08:48,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:08:48,748 INFO L124 PetriNetUnfolderBase]: 56/1479 cut-off events. [2023-11-29 01:08:48,748 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 01:08:48,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 1479 events. 56/1479 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7893 event pairs, 20 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 1499. Up to 51 conditions per place. [2023-11-29 01:08:48,788 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 14 selfloop transitions, 2 changer transitions 0/603 dead transitions. [2023-11-29 01:08:48,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 603 transitions, 1248 flow [2023-11-29 01:08:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:08:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:08:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2023-11-29 01:08:48,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9495713565305093 [2023-11-29 01:08:48,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1883 transitions. [2023-11-29 01:08:48,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1883 transitions. [2023-11-29 01:08:48,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:08:48,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1883 transitions. [2023-11-29 01:08:48,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-29 01:08:48,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:08:48,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:08:48,815 INFO L175 Difference]: Start difference. First operand has 598 places, 604 transitions, 1218 flow. Second operand 3 states and 1883 transitions. [2023-11-29 01:08:48,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 603 transitions, 1248 flow [2023-11-29 01:08:48,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 603 transitions, 1244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:08:48,830 INFO L231 Difference]: Finished difference. Result has 597 places, 603 transitions, 1216 flow [2023-11-29 01:08:48,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1216, PETRI_PLACES=597, PETRI_TRANSITIONS=603} [2023-11-29 01:08:48,833 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2023-11-29 01:08:48,833 INFO L495 AbstractCegarLoop]: Abstraction has has 597 places, 603 transitions, 1216 flow [2023-11-29 01:08:48,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 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-29 01:08:48,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:08:48,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:08:48,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:08:48,836 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:08:48,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:08:48,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1813607216, now seen corresponding path program 1 times [2023-11-29 01:08:48,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:08:48,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802576603] [2023-11-29 01:08:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:48,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:08:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:08:48,894 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-29 01:08:48,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:08:48,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802576603] [2023-11-29 01:08:48,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802576603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:08:48,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:08:48,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:08:48,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899675693] [2023-11-29 01:08:48,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:08:48,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:08:48,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:08:48,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:08:48,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:08:48,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 661 [2023-11-29 01:08:48,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 603 transitions, 1216 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-29 01:08:48,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:08:48,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 661 [2023-11-29 01:08:48,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:08:49,721 INFO L124 PetriNetUnfolderBase]: 132/2544 cut-off events. [2023-11-29 01:08:49,721 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2023-11-29 01:08:49,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 2544 events. 132/2544 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 18957 event pairs, 64 based on Foata normal form. 0/2166 useless extension candidates. Maximal degree in co-relation 2669. Up to 138 conditions per place. [2023-11-29 01:08:49,790 INFO L140 encePairwiseOnDemand]: 655/661 looper letters, 16 selfloop transitions, 1 changer transitions 0/598 dead transitions. [2023-11-29 01:08:49,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 598 transitions, 1240 flow [2023-11-29 01:08:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:08:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:08:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2023-11-29 01:08:49,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.946041351487645 [2023-11-29 01:08:49,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1876 transitions. [2023-11-29 01:08:49,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1876 transitions. [2023-11-29 01:08:49,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:08:49,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1876 transitions. [2023-11-29 01:08:49,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 625.3333333333334) internal successors, (1876), 3 states have internal predecessors, (1876), 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-29 01:08:49,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:08:49,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:08:49,818 INFO L175 Difference]: Start difference. First operand has 597 places, 603 transitions, 1216 flow. Second operand 3 states and 1876 transitions. [2023-11-29 01:08:49,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 598 transitions, 1240 flow [2023-11-29 01:08:49,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 598 transitions, 1236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:08:49,872 INFO L231 Difference]: Finished difference. Result has 592 places, 598 transitions, 1204 flow [2023-11-29 01:08:49,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1204, PETRI_PLACES=592, PETRI_TRANSITIONS=598} [2023-11-29 01:08:49,874 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -19 predicate places. [2023-11-29 01:08:49,874 INFO L495 AbstractCegarLoop]: Abstraction has has 592 places, 598 transitions, 1204 flow [2023-11-29 01:08:49,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-29 01:08:49,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:08:49,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:08:49,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:08:49,877 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:08:49,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:08:49,878 INFO L85 PathProgramCache]: Analyzing trace with hash -684571514, now seen corresponding path program 1 times [2023-11-29 01:08:49,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:08:49,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413859186] [2023-11-29 01:08:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:49,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:08:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:08:50,756 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-29 01:08:50,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:08:50,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413859186] [2023-11-29 01:08:50,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413859186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:08:50,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:08:50,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:08:50,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437570810] [2023-11-29 01:08:50,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:08:50,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:08:50,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:08:50,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:08:50,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:08:51,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 661 [2023-11-29 01:08:51,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 598 transitions, 1204 flow. Second operand has 6 states, 6 states have (on average 533.5) internal successors, (3201), 6 states have internal predecessors, (3201), 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-29 01:08:51,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:08:51,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 661 [2023-11-29 01:08:51,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:48,920 INFO L124 PetriNetUnfolderBase]: 75196/283950 cut-off events. [2023-11-29 01:09:48,921 INFO L125 PetriNetUnfolderBase]: For 909/1027 co-relation queries the response was YES. [2023-11-29 01:09:50,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383650 conditions, 283950 events. 75196/283950 cut-off events. For 909/1027 co-relation queries the response was YES. Maximal size of possible extension queue 4714. Compared 4709419 event pairs, 67808 based on Foata normal form. 0/250460 useless extension candidates. Maximal degree in co-relation 383601. Up to 99375 conditions per place. [2023-11-29 01:09:52,020 INFO L140 encePairwiseOnDemand]: 643/661 looper letters, 90 selfloop transitions, 15 changer transitions 0/595 dead transitions. [2023-11-29 01:09:52,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 595 transitions, 1408 flow [2023-11-29 01:09:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:09:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:09:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3300 transitions. [2023-11-29 01:09:52,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8320726172465961 [2023-11-29 01:09:52,032 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3300 transitions. [2023-11-29 01:09:52,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3300 transitions. [2023-11-29 01:09:52,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:52,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3300 transitions. [2023-11-29 01:09:52,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 550.0) internal successors, (3300), 6 states have internal predecessors, (3300), 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-29 01:09:52,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:09:52,057 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:09:52,057 INFO L175 Difference]: Start difference. First operand has 592 places, 598 transitions, 1204 flow. Second operand 6 states and 3300 transitions. [2023-11-29 01:09:52,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 595 transitions, 1408 flow [2023-11-29 01:09:52,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 595 transitions, 1407 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:09:52,070 INFO L231 Difference]: Finished difference. Result has 593 places, 595 transitions, 1227 flow [2023-11-29 01:09:52,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1227, PETRI_PLACES=593, PETRI_TRANSITIONS=595} [2023-11-29 01:09:52,072 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -18 predicate places. [2023-11-29 01:09:52,073 INFO L495 AbstractCegarLoop]: Abstraction has has 593 places, 595 transitions, 1227 flow [2023-11-29 01:09:52,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 533.5) internal successors, (3201), 6 states have internal predecessors, (3201), 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-29 01:09:52,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:52,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:52,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:09:52,077 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:52,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash 767317609, now seen corresponding path program 1 times [2023-11-29 01:09:52,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:52,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750092882] [2023-11-29 01:09:52,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:52,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:52,137 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-29 01:09:52,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:52,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750092882] [2023-11-29 01:09:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750092882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:52,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:52,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:09:52,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355862276] [2023-11-29 01:09:52,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:52,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:52,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:52,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 661 [2023-11-29 01:09:52,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 595 transitions, 1227 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-29 01:09:52,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:52,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 661 [2023-11-29 01:09:52,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:52,556 INFO L124 PetriNetUnfolderBase]: 62/1840 cut-off events. [2023-11-29 01:09:52,556 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 01:09:52,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 1840 events. 62/1840 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10778 event pairs, 20 based on Foata normal form. 0/1567 useless extension candidates. Maximal degree in co-relation 1875. Up to 50 conditions per place. [2023-11-29 01:09:52,585 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 13 selfloop transitions, 2 changer transitions 0/594 dead transitions. [2023-11-29 01:09:52,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 594 transitions, 1255 flow [2023-11-29 01:09:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:09:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2023-11-29 01:09:52,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9505799293998991 [2023-11-29 01:09:52,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1885 transitions. [2023-11-29 01:09:52,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1885 transitions. [2023-11-29 01:09:52,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:52,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1885 transitions. [2023-11-29 01:09:52,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-29 01:09:52,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:52,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:52,601 INFO L175 Difference]: Start difference. First operand has 593 places, 595 transitions, 1227 flow. Second operand 3 states and 1885 transitions. [2023-11-29 01:09:52,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 594 transitions, 1255 flow [2023-11-29 01:09:52,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 594 transitions, 1225 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:09:52,612 INFO L231 Difference]: Finished difference. Result has 589 places, 594 transitions, 1199 flow [2023-11-29 01:09:52,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=589, PETRI_TRANSITIONS=594} [2023-11-29 01:09:52,614 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2023-11-29 01:09:52,614 INFO L495 AbstractCegarLoop]: Abstraction has has 589 places, 594 transitions, 1199 flow [2023-11-29 01:09:52,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-29 01:09:52,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:52,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:52,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:09:52,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:52,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:52,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1282120949, now seen corresponding path program 1 times [2023-11-29 01:09:52,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:52,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874249830] [2023-11-29 01:09:52,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:52,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:52,657 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-29 01:09:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:52,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874249830] [2023-11-29 01:09:52,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874249830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:52,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:52,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:09:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256221646] [2023-11-29 01:09:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:52,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:52,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:52,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 661 [2023-11-29 01:09:52,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 594 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-29 01:09:52,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:52,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 661 [2023-11-29 01:09:52,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:53,133 INFO L124 PetriNetUnfolderBase]: 81/1779 cut-off events. [2023-11-29 01:09:53,134 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-29 01:09:53,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 1779 events. 81/1779 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 10816 event pairs, 32 based on Foata normal form. 0/1533 useless extension candidates. Maximal degree in co-relation 1834. Up to 87 conditions per place. [2023-11-29 01:09:53,170 INFO L140 encePairwiseOnDemand]: 655/661 looper letters, 16 selfloop transitions, 1 changer transitions 0/589 dead transitions. [2023-11-29 01:09:53,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 589 transitions, 1223 flow [2023-11-29 01:09:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:09:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2023-11-29 01:09:53,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.946041351487645 [2023-11-29 01:09:53,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1876 transitions. [2023-11-29 01:09:53,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1876 transitions. [2023-11-29 01:09:53,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:53,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1876 transitions. [2023-11-29 01:09:53,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 625.3333333333334) internal successors, (1876), 3 states have internal predecessors, (1876), 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-29 01:09:53,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:53,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:53,191 INFO L175 Difference]: Start difference. First operand has 589 places, 594 transitions, 1199 flow. Second operand 3 states and 1876 transitions. [2023-11-29 01:09:53,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 589 transitions, 1223 flow [2023-11-29 01:09:53,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 589 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:09:53,206 INFO L231 Difference]: Finished difference. Result has 584 places, 589 transitions, 1187 flow [2023-11-29 01:09:53,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1187, PETRI_PLACES=584, PETRI_TRANSITIONS=589} [2023-11-29 01:09:53,209 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2023-11-29 01:09:53,209 INFO L495 AbstractCegarLoop]: Abstraction has has 584 places, 589 transitions, 1187 flow [2023-11-29 01:09:53,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-29 01:09:53,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:53,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:53,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:09:53,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:53,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash -146655856, now seen corresponding path program 1 times [2023-11-29 01:09:53,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:53,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306069794] [2023-11-29 01:09:53,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:53,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:53,275 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-29 01:09:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:53,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306069794] [2023-11-29 01:09:53,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306069794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:53,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:53,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:09:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168858637] [2023-11-29 01:09:53,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:53,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:53,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:53,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:53,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:53,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 661 [2023-11-29 01:09:53,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 589 transitions, 1187 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-29 01:09:53,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:53,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 661 [2023-11-29 01:09:53,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:53,642 INFO L124 PetriNetUnfolderBase]: 36/1108 cut-off events. [2023-11-29 01:09:53,643 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 01:09:53,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 1108 events. 36/1108 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4984 event pairs, 12 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1109. Up to 38 conditions per place. [2023-11-29 01:09:53,672 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 13 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2023-11-29 01:09:53,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 588 transitions, 1215 flow [2023-11-29 01:09:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:09:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2023-11-29 01:09:53,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9505799293998991 [2023-11-29 01:09:53,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1885 transitions. [2023-11-29 01:09:53,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1885 transitions. [2023-11-29 01:09:53,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:53,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1885 transitions. [2023-11-29 01:09:53,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-29 01:09:53,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:53,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:53,691 INFO L175 Difference]: Start difference. First operand has 584 places, 589 transitions, 1187 flow. Second operand 3 states and 1885 transitions. [2023-11-29 01:09:53,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 588 transitions, 1215 flow [2023-11-29 01:09:53,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 588 transitions, 1214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:09:53,706 INFO L231 Difference]: Finished difference. Result has 584 places, 588 transitions, 1188 flow [2023-11-29 01:09:53,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1188, PETRI_PLACES=584, PETRI_TRANSITIONS=588} [2023-11-29 01:09:53,709 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2023-11-29 01:09:53,709 INFO L495 AbstractCegarLoop]: Abstraction has has 584 places, 588 transitions, 1188 flow [2023-11-29 01:09:53,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-29 01:09:53,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:53,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:53,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:09:53,711 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:53,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2075564392, now seen corresponding path program 1 times [2023-11-29 01:09:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:53,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889605868] [2023-11-29 01:09:53,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:53,772 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-29 01:09:53,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:53,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889605868] [2023-11-29 01:09:53,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889605868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:53,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:53,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:09:53,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489541830] [2023-11-29 01:09:53,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:53,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:53,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:53,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:53,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:53,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 661 [2023-11-29 01:09:53,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 588 transitions, 1188 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-29 01:09:53,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:53,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 661 [2023-11-29 01:09:53,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:54,415 INFO L124 PetriNetUnfolderBase]: 136/2466 cut-off events. [2023-11-29 01:09:54,415 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-29 01:09:54,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2622 conditions, 2466 events. 136/2466 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 17912 event pairs, 64 based on Foata normal form. 0/2133 useless extension candidates. Maximal degree in co-relation 2572. Up to 141 conditions per place. [2023-11-29 01:09:54,460 INFO L140 encePairwiseOnDemand]: 655/661 looper letters, 16 selfloop transitions, 1 changer transitions 0/583 dead transitions. [2023-11-29 01:09:54,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 583 transitions, 1212 flow [2023-11-29 01:09:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:09:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2023-11-29 01:09:54,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.946041351487645 [2023-11-29 01:09:54,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1876 transitions. [2023-11-29 01:09:54,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1876 transitions. [2023-11-29 01:09:54,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:54,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1876 transitions. [2023-11-29 01:09:54,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 625.3333333333334) internal successors, (1876), 3 states have internal predecessors, (1876), 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-29 01:09:54,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:54,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:54,482 INFO L175 Difference]: Start difference. First operand has 584 places, 588 transitions, 1188 flow. Second operand 3 states and 1876 transitions. [2023-11-29 01:09:54,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 583 transitions, 1212 flow [2023-11-29 01:09:54,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 583 transitions, 1208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:09:54,498 INFO L231 Difference]: Finished difference. Result has 579 places, 583 transitions, 1176 flow [2023-11-29 01:09:54,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1174, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1176, PETRI_PLACES=579, PETRI_TRANSITIONS=583} [2023-11-29 01:09:54,500 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -32 predicate places. [2023-11-29 01:09:54,501 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 583 transitions, 1176 flow [2023-11-29 01:09:54,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-29 01:09:54,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:54,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:54,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:09:54,502 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:54,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:54,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1890322411, now seen corresponding path program 1 times [2023-11-29 01:09:54,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:54,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062103687] [2023-11-29 01:09:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:54,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:54,569 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-29 01:09:54,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:54,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062103687] [2023-11-29 01:09:54,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062103687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:54,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:54,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:09:54,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036665588] [2023-11-29 01:09:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:54,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:54,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:54,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:54,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 661 [2023-11-29 01:09:54,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 583 transitions, 1176 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-29 01:09:54,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:54,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 661 [2023-11-29 01:09:54,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:54,808 INFO L124 PetriNetUnfolderBase]: 38/928 cut-off events. [2023-11-29 01:09:54,808 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 01:09:54,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 928 events. 38/928 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3825 event pairs, 20 based on Foata normal form. 0/829 useless extension candidates. Maximal degree in co-relation 940. Up to 50 conditions per place. [2023-11-29 01:09:54,824 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 13 selfloop transitions, 2 changer transitions 0/582 dead transitions. [2023-11-29 01:09:54,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 582 transitions, 1204 flow [2023-11-29 01:09:54,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:09:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2023-11-29 01:09:54,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9505799293998991 [2023-11-29 01:09:54,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1885 transitions. [2023-11-29 01:09:54,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1885 transitions. [2023-11-29 01:09:54,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:54,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1885 transitions. [2023-11-29 01:09:54,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-29 01:09:54,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:54,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:54,844 INFO L175 Difference]: Start difference. First operand has 579 places, 583 transitions, 1176 flow. Second operand 3 states and 1885 transitions. [2023-11-29 01:09:54,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 582 transitions, 1204 flow [2023-11-29 01:09:54,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 582 transitions, 1203 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:09:54,860 INFO L231 Difference]: Finished difference. Result has 579 places, 582 transitions, 1177 flow [2023-11-29 01:09:54,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1177, PETRI_PLACES=579, PETRI_TRANSITIONS=582} [2023-11-29 01:09:54,862 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -32 predicate places. [2023-11-29 01:09:54,862 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 582 transitions, 1177 flow [2023-11-29 01:09:54,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-29 01:09:54,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:54,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:54,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:09:54,864 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:54,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash -585712556, now seen corresponding path program 1 times [2023-11-29 01:09:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:54,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627263957] [2023-11-29 01:09:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:54,946 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-29 01:09:54,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:54,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627263957] [2023-11-29 01:09:54,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627263957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:54,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:54,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:09:54,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831430824] [2023-11-29 01:09:54,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:54,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:54,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:54,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:54,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:54,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 661 [2023-11-29 01:09:54,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 582 transitions, 1177 flow. Second operand has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-29 01:09:54,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:54,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 661 [2023-11-29 01:09:54,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:55,280 INFO L124 PetriNetUnfolderBase]: 34/1021 cut-off events. [2023-11-29 01:09:55,280 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:09:55,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 1021 events. 34/1021 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4499 event pairs, 6 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1025. Up to 23 conditions per place. [2023-11-29 01:09:55,307 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 12 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2023-11-29 01:09:55,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 583 transitions, 1209 flow [2023-11-29 01:09:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:09:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2023-11-29 01:09:55,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9561270801815431 [2023-11-29 01:09:55,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1896 transitions. [2023-11-29 01:09:55,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1896 transitions. [2023-11-29 01:09:55,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:55,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1896 transitions. [2023-11-29 01:09:55,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 632.0) internal successors, (1896), 3 states have internal predecessors, (1896), 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-29 01:09:55,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:55,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:55,328 INFO L175 Difference]: Start difference. First operand has 579 places, 582 transitions, 1177 flow. Second operand 3 states and 1896 transitions. [2023-11-29 01:09:55,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 583 transitions, 1209 flow [2023-11-29 01:09:55,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 583 transitions, 1205 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:09:55,346 INFO L231 Difference]: Finished difference. Result has 578 places, 581 transitions, 1175 flow [2023-11-29 01:09:55,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1175, PETRI_PLACES=578, PETRI_TRANSITIONS=581} [2023-11-29 01:09:55,348 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -33 predicate places. [2023-11-29 01:09:55,348 INFO L495 AbstractCegarLoop]: Abstraction has has 578 places, 581 transitions, 1175 flow [2023-11-29 01:09:55,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-29 01:09:55,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:55,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:55,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:09:55,350 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:55,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1630520539, now seen corresponding path program 1 times [2023-11-29 01:09:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:55,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677631766] [2023-11-29 01:09:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:55,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:55,431 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-29 01:09:55,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:55,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677631766] [2023-11-29 01:09:55,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677631766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:55,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:55,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:09:55,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704433579] [2023-11-29 01:09:55,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:55,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:55,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:55,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:55,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 661 [2023-11-29 01:09:55,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 581 transitions, 1175 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-29 01:09:55,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:55,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 661 [2023-11-29 01:09:55,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:55,770 INFO L124 PetriNetUnfolderBase]: 31/915 cut-off events. [2023-11-29 01:09:55,770 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 01:09:55,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 915 events. 31/915 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3638 event pairs, 6 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 915. Up to 24 conditions per place. [2023-11-29 01:09:55,791 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 13 selfloop transitions, 2 changer transitions 0/582 dead transitions. [2023-11-29 01:09:55,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 582 transitions, 1209 flow [2023-11-29 01:09:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:09:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2023-11-29 01:09:55,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9551185073121533 [2023-11-29 01:09:55,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2023-11-29 01:09:55,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2023-11-29 01:09:55,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:55,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2023-11-29 01:09:55,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 631.3333333333334) internal successors, (1894), 3 states have internal predecessors, (1894), 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-29 01:09:55,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:55,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:55,812 INFO L175 Difference]: Start difference. First operand has 578 places, 581 transitions, 1175 flow. Second operand 3 states and 1894 transitions. [2023-11-29 01:09:55,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 582 transitions, 1209 flow [2023-11-29 01:09:55,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 582 transitions, 1205 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:09:55,829 INFO L231 Difference]: Finished difference. Result has 577 places, 580 transitions, 1173 flow [2023-11-29 01:09:55,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1173, PETRI_PLACES=577, PETRI_TRANSITIONS=580} [2023-11-29 01:09:55,832 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -34 predicate places. [2023-11-29 01:09:55,832 INFO L495 AbstractCegarLoop]: Abstraction has has 577 places, 580 transitions, 1173 flow [2023-11-29 01:09:55,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-29 01:09:55,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:55,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:55,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:09:55,834 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:55,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash 668429431, now seen corresponding path program 1 times [2023-11-29 01:09:55,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:55,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264366801] [2023-11-29 01:09:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:55,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:55,917 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-29 01:09:55,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264366801] [2023-11-29 01:09:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264366801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:55,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:55,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:09:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604869756] [2023-11-29 01:09:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:55,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:55,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:55,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:55,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 661 [2023-11-29 01:09:55,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 580 transitions, 1173 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-29 01:09:55,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:55,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 661 [2023-11-29 01:09:55,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:56,197 INFO L124 PetriNetUnfolderBase]: 40/1022 cut-off events. [2023-11-29 01:09:56,197 INFO L125 PetriNetUnfolderBase]: For 3/10 co-relation queries the response was YES. [2023-11-29 01:09:56,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 1022 events. 40/1022 cut-off events. For 3/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4431 event pairs, 12 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 1053. Up to 39 conditions per place. [2023-11-29 01:09:56,214 INFO L140 encePairwiseOnDemand]: 657/661 looper letters, 14 selfloop transitions, 3 changer transitions 0/583 dead transitions. [2023-11-29 01:09:56,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 583 transitions, 1215 flow [2023-11-29 01:09:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:09:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2023-11-29 01:09:56,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9561270801815431 [2023-11-29 01:09:56,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1896 transitions. [2023-11-29 01:09:56,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1896 transitions. [2023-11-29 01:09:56,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:56,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1896 transitions. [2023-11-29 01:09:56,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 632.0) internal successors, (1896), 3 states have internal predecessors, (1896), 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-29 01:09:56,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:56,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:56,228 INFO L175 Difference]: Start difference. First operand has 577 places, 580 transitions, 1173 flow. Second operand 3 states and 1896 transitions. [2023-11-29 01:09:56,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 583 transitions, 1215 flow [2023-11-29 01:09:56,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 583 transitions, 1211 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:09:56,241 INFO L231 Difference]: Finished difference. Result has 579 places, 581 transitions, 1187 flow [2023-11-29 01:09:56,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1187, PETRI_PLACES=579, PETRI_TRANSITIONS=581} [2023-11-29 01:09:56,243 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -32 predicate places. [2023-11-29 01:09:56,243 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 581 transitions, 1187 flow [2023-11-29 01:09:56,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-29 01:09:56,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:56,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:56,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:09:56,244 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:56,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash 748293392, now seen corresponding path program 1 times [2023-11-29 01:09:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:56,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173094520] [2023-11-29 01:09:56,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:56,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:56,828 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-29 01:09:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173094520] [2023-11-29 01:09:56,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173094520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:56,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:56,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:09:56,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758660299] [2023-11-29 01:09:56,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:56,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:09:56,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:56,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:09:56,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:09:57,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 612 out of 661 [2023-11-29 01:09:57,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 581 transitions, 1187 flow. Second operand has 6 states, 6 states have (on average 613.6666666666666) internal successors, (3682), 6 states have internal predecessors, (3682), 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-29 01:09:57,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:57,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 612 of 661 [2023-11-29 01:09:57,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:57,770 INFO L124 PetriNetUnfolderBase]: 12/580 cut-off events. [2023-11-29 01:09:57,770 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 01:09:57,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 580 events. 12/580 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1343 event pairs, 0 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 571. Up to 18 conditions per place. [2023-11-29 01:09:57,779 INFO L140 encePairwiseOnDemand]: 656/661 looper letters, 21 selfloop transitions, 4 changer transitions 0/580 dead transitions. [2023-11-29 01:09:57,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 580 transitions, 1235 flow [2023-11-29 01:09:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:09:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:09:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3698 transitions. [2023-11-29 01:09:57,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9324256177508825 [2023-11-29 01:09:57,788 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3698 transitions. [2023-11-29 01:09:57,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3698 transitions. [2023-11-29 01:09:57,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:57,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3698 transitions. [2023-11-29 01:09:57,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 616.3333333333334) internal successors, (3698), 6 states have internal predecessors, (3698), 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-29 01:09:57,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:09:57,802 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:09:57,802 INFO L175 Difference]: Start difference. First operand has 579 places, 581 transitions, 1187 flow. Second operand 6 states and 3698 transitions. [2023-11-29 01:09:57,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 580 transitions, 1235 flow [2023-11-29 01:09:57,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 580 transitions, 1229 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:09:57,815 INFO L231 Difference]: Finished difference. Result has 581 places, 580 transitions, 1187 flow [2023-11-29 01:09:57,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1187, PETRI_PLACES=581, PETRI_TRANSITIONS=580} [2023-11-29 01:09:57,817 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2023-11-29 01:09:57,817 INFO L495 AbstractCegarLoop]: Abstraction has has 581 places, 580 transitions, 1187 flow [2023-11-29 01:09:57,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 613.6666666666666) internal successors, (3682), 6 states have internal predecessors, (3682), 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-29 01:09:57,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:57,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:57,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:09:57,818 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:57,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash 503200597, now seen corresponding path program 1 times [2023-11-29 01:09:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:57,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229031291] [2023-11-29 01:09:57,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:57,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:57,872 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-29 01:09:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:57,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229031291] [2023-11-29 01:09:57,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229031291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:57,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:57,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:09:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436968968] [2023-11-29 01:09:57,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:57,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:57,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:57,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:57,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 661 [2023-11-29 01:09:57,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 580 transitions, 1187 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-29 01:09:57,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:57,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 661 [2023-11-29 01:09:57,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:58,087 INFO L124 PetriNetUnfolderBase]: 28/789 cut-off events. [2023-11-29 01:09:58,087 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 01:09:58,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 789 events. 28/789 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2787 event pairs, 6 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 791. Up to 24 conditions per place. [2023-11-29 01:09:58,098 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 13 selfloop transitions, 2 changer transitions 0/581 dead transitions. [2023-11-29 01:09:58,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 581 transitions, 1221 flow [2023-11-29 01:09:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:09:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2023-11-29 01:09:58,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9551185073121533 [2023-11-29 01:09:58,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2023-11-29 01:09:58,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2023-11-29 01:09:58,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:58,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2023-11-29 01:09:58,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 631.3333333333334) internal successors, (1894), 3 states have internal predecessors, (1894), 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-29 01:09:58,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:58,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:58,114 INFO L175 Difference]: Start difference. First operand has 581 places, 580 transitions, 1187 flow. Second operand 3 states and 1894 transitions. [2023-11-29 01:09:58,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 581 transitions, 1221 flow [2023-11-29 01:09:58,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 581 transitions, 1214 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:09:58,124 INFO L231 Difference]: Finished difference. Result has 578 places, 579 transitions, 1182 flow [2023-11-29 01:09:58,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1182, PETRI_PLACES=578, PETRI_TRANSITIONS=579} [2023-11-29 01:09:58,126 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -33 predicate places. [2023-11-29 01:09:58,126 INFO L495 AbstractCegarLoop]: Abstraction has has 578 places, 579 transitions, 1182 flow [2023-11-29 01:09:58,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-29 01:09:58,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:58,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:58,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 01:09:58,128 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:58,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1861934750, now seen corresponding path program 1 times [2023-11-29 01:09:58,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:58,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728391631] [2023-11-29 01:09:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:58,177 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-29 01:09:58,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:58,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728391631] [2023-11-29 01:09:58,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728391631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:58,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:58,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:09:58,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804687875] [2023-11-29 01:09:58,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:58,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:09:58,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:58,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:09:58,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:09:58,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 661 [2023-11-29 01:09:58,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 579 transitions, 1182 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-29 01:09:58,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:58,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 661 [2023-11-29 01:09:58,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:09:58,697 INFO L124 PetriNetUnfolderBase]: 131/2185 cut-off events. [2023-11-29 01:09:58,697 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-29 01:09:58,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 2185 events. 131/2185 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 15143 event pairs, 24 based on Foata normal form. 0/1935 useless extension candidates. Maximal degree in co-relation 2367. Up to 154 conditions per place. [2023-11-29 01:09:58,736 INFO L140 encePairwiseOnDemand]: 655/661 looper letters, 20 selfloop transitions, 2 changer transitions 0/582 dead transitions. [2023-11-29 01:09:58,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 582 transitions, 1237 flow [2023-11-29 01:09:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:09:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:09:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2023-11-29 01:09:58,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9525970751386788 [2023-11-29 01:09:58,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1889 transitions. [2023-11-29 01:09:58,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1889 transitions. [2023-11-29 01:09:58,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:09:58,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1889 transitions. [2023-11-29 01:09:58,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 629.6666666666666) internal successors, (1889), 3 states have internal predecessors, (1889), 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-29 01:09:58,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:58,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:09:58,751 INFO L175 Difference]: Start difference. First operand has 578 places, 579 transitions, 1182 flow. Second operand 3 states and 1889 transitions. [2023-11-29 01:09:58,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 582 transitions, 1237 flow [2023-11-29 01:09:58,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 582 transitions, 1233 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:09:58,762 INFO L231 Difference]: Finished difference. Result has 575 places, 577 transitions, 1184 flow [2023-11-29 01:09:58,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=575, PETRI_TRANSITIONS=577} [2023-11-29 01:09:58,763 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -36 predicate places. [2023-11-29 01:09:58,763 INFO L495 AbstractCegarLoop]: Abstraction has has 575 places, 577 transitions, 1184 flow [2023-11-29 01:09:58,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-29 01:09:58,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:09:58,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:09:58,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 01:09:58,764 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:09:58,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1717794662, now seen corresponding path program 1 times [2023-11-29 01:09:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:09:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088985556] [2023-11-29 01:09:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:09:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:59,030 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-29 01:09:59,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:09:59,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088985556] [2023-11-29 01:09:59,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088985556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:59,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:59,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:09:59,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921095067] [2023-11-29 01:09:59,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:59,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:09:59,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:09:59,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:09:59,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:09:59,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 661 [2023-11-29 01:09:59,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 577 transitions, 1184 flow. Second operand has 8 states, 8 states have (on average 599.125) internal successors, (4793), 8 states have internal predecessors, (4793), 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-29 01:09:59,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:09:59,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 661 [2023-11-29 01:09:59,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:00,238 INFO L124 PetriNetUnfolderBase]: 98/1657 cut-off events. [2023-11-29 01:10:00,239 INFO L125 PetriNetUnfolderBase]: For 14/46 co-relation queries the response was YES. [2023-11-29 01:10:00,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 1657 events. 98/1657 cut-off events. For 14/46 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9091 event pairs, 45 based on Foata normal form. 5/1520 useless extension candidates. Maximal degree in co-relation 1971. Up to 158 conditions per place. [2023-11-29 01:10:00,268 INFO L140 encePairwiseOnDemand]: 647/661 looper letters, 69 selfloop transitions, 15 changer transitions 0/615 dead transitions. [2023-11-29 01:10:00,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 615 transitions, 1444 flow [2023-11-29 01:10:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:10:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 01:10:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6629 transitions. [2023-11-29 01:10:00,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9117040297070554 [2023-11-29 01:10:00,283 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6629 transitions. [2023-11-29 01:10:00,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6629 transitions. [2023-11-29 01:10:00,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:00,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6629 transitions. [2023-11-29 01:10:00,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 602.6363636363636) internal successors, (6629), 11 states have internal predecessors, (6629), 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-29 01:10:00,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 661.0) internal successors, (7932), 12 states have internal predecessors, (7932), 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-29 01:10:00,303 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 661.0) internal successors, (7932), 12 states have internal predecessors, (7932), 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-29 01:10:00,303 INFO L175 Difference]: Start difference. First operand has 575 places, 577 transitions, 1184 flow. Second operand 11 states and 6629 transitions. [2023-11-29 01:10:00,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 615 transitions, 1444 flow [2023-11-29 01:10:00,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 615 transitions, 1444 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:10:00,315 INFO L231 Difference]: Finished difference. Result has 590 places, 585 transitions, 1260 flow [2023-11-29 01:10:00,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1260, PETRI_PLACES=590, PETRI_TRANSITIONS=585} [2023-11-29 01:10:00,316 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -21 predicate places. [2023-11-29 01:10:00,316 INFO L495 AbstractCegarLoop]: Abstraction has has 590 places, 585 transitions, 1260 flow [2023-11-29 01:10:00,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 599.125) internal successors, (4793), 8 states have internal predecessors, (4793), 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-29 01:10:00,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:00,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:00,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 01:10:00,318 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:00,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:00,318 INFO L85 PathProgramCache]: Analyzing trace with hash 74140796, now seen corresponding path program 1 times [2023-11-29 01:10:00,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:00,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113913218] [2023-11-29 01:10:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:00,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:00,379 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-29 01:10:00,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:00,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113913218] [2023-11-29 01:10:00,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113913218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:00,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:00,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:10:00,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624226845] [2023-11-29 01:10:00,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:00,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:00,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:00,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:00,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:00,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 661 [2023-11-29 01:10:00,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 585 transitions, 1260 flow. Second operand has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-29 01:10:00,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:00,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 661 [2023-11-29 01:10:00,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:00,907 INFO L124 PetriNetUnfolderBase]: 134/2140 cut-off events. [2023-11-29 01:10:00,907 INFO L125 PetriNetUnfolderBase]: For 99/150 co-relation queries the response was YES. [2023-11-29 01:10:00,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 2140 events. 134/2140 cut-off events. For 99/150 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 13513 event pairs, 48 based on Foata normal form. 6/1878 useless extension candidates. Maximal degree in co-relation 2368. Up to 149 conditions per place. [2023-11-29 01:10:00,942 INFO L140 encePairwiseOnDemand]: 657/661 looper letters, 14 selfloop transitions, 3 changer transitions 0/588 dead transitions. [2023-11-29 01:10:00,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 588 transitions, 1302 flow [2023-11-29 01:10:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:10:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2023-11-29 01:10:00,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9561270801815431 [2023-11-29 01:10:00,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1896 transitions. [2023-11-29 01:10:00,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1896 transitions. [2023-11-29 01:10:00,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:00,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1896 transitions. [2023-11-29 01:10:00,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 632.0) internal successors, (1896), 3 states have internal predecessors, (1896), 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-29 01:10:00,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:00,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:00,955 INFO L175 Difference]: Start difference. First operand has 590 places, 585 transitions, 1260 flow. Second operand 3 states and 1896 transitions. [2023-11-29 01:10:00,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 588 transitions, 1302 flow [2023-11-29 01:10:00,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 588 transitions, 1298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:10:00,967 INFO L231 Difference]: Finished difference. Result has 593 places, 586 transitions, 1274 flow [2023-11-29 01:10:00,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1274, PETRI_PLACES=593, PETRI_TRANSITIONS=586} [2023-11-29 01:10:00,968 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -18 predicate places. [2023-11-29 01:10:00,969 INFO L495 AbstractCegarLoop]: Abstraction has has 593 places, 586 transitions, 1274 flow [2023-11-29 01:10:00,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-29 01:10:00,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:00,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:00,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 01:10:00,970 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:00,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash 722758557, now seen corresponding path program 1 times [2023-11-29 01:10:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:00,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267289232] [2023-11-29 01:10:00,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:00,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:01,025 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-29 01:10:01,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:01,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267289232] [2023-11-29 01:10:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267289232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:01,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:01,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:10:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792847093] [2023-11-29 01:10:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:01,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:01,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:01,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:01,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 661 [2023-11-29 01:10:01,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 586 transitions, 1274 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-29 01:10:01,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:01,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 661 [2023-11-29 01:10:01,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:01,611 INFO L124 PetriNetUnfolderBase]: 137/2093 cut-off events. [2023-11-29 01:10:01,611 INFO L125 PetriNetUnfolderBase]: For 72/122 co-relation queries the response was YES. [2023-11-29 01:10:01,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2478 conditions, 2093 events. 137/2093 cut-off events. For 72/122 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 13935 event pairs, 48 based on Foata normal form. 3/1870 useless extension candidates. Maximal degree in co-relation 2419. Up to 152 conditions per place. [2023-11-29 01:10:01,656 INFO L140 encePairwiseOnDemand]: 657/661 looper letters, 14 selfloop transitions, 3 changer transitions 0/589 dead transitions. [2023-11-29 01:10:01,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 589 transitions, 1316 flow [2023-11-29 01:10:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:10:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2023-11-29 01:10:01,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9561270801815431 [2023-11-29 01:10:01,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1896 transitions. [2023-11-29 01:10:01,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1896 transitions. [2023-11-29 01:10:01,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:01,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1896 transitions. [2023-11-29 01:10:01,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 632.0) internal successors, (1896), 3 states have internal predecessors, (1896), 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-29 01:10:01,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:01,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:01,670 INFO L175 Difference]: Start difference. First operand has 593 places, 586 transitions, 1274 flow. Second operand 3 states and 1896 transitions. [2023-11-29 01:10:01,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 589 transitions, 1316 flow [2023-11-29 01:10:01,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 589 transitions, 1310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:10:01,682 INFO L231 Difference]: Finished difference. Result has 595 places, 587 transitions, 1286 flow [2023-11-29 01:10:01,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1286, PETRI_PLACES=595, PETRI_TRANSITIONS=587} [2023-11-29 01:10:01,683 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -16 predicate places. [2023-11-29 01:10:01,683 INFO L495 AbstractCegarLoop]: Abstraction has has 595 places, 587 transitions, 1286 flow [2023-11-29 01:10:01,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-29 01:10:01,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:01,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:01,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:10:01,684 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:01,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1835729763, now seen corresponding path program 1 times [2023-11-29 01:10:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:01,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462643438] [2023-11-29 01:10:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:01,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:01,736 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-29 01:10:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:01,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462643438] [2023-11-29 01:10:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462643438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:01,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:10:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333361001] [2023-11-29 01:10:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:01,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:01,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:01,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:01,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 661 [2023-11-29 01:10:01,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 587 transitions, 1286 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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-29 01:10:01,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:01,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 661 [2023-11-29 01:10:01,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:02,671 INFO L124 PetriNetUnfolderBase]: 187/3499 cut-off events. [2023-11-29 01:10:02,671 INFO L125 PetriNetUnfolderBase]: For 74/87 co-relation queries the response was YES. [2023-11-29 01:10:02,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4011 conditions, 3499 events. 187/3499 cut-off events. For 74/87 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 27469 event pairs, 33 based on Foata normal form. 2/3151 useless extension candidates. Maximal degree in co-relation 3951. Up to 220 conditions per place. [2023-11-29 01:10:02,740 INFO L140 encePairwiseOnDemand]: 655/661 looper letters, 20 selfloop transitions, 2 changer transitions 0/590 dead transitions. [2023-11-29 01:10:02,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 590 transitions, 1341 flow [2023-11-29 01:10:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:10:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2023-11-29 01:10:02,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9525970751386788 [2023-11-29 01:10:02,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1889 transitions. [2023-11-29 01:10:02,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1889 transitions. [2023-11-29 01:10:02,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:02,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1889 transitions. [2023-11-29 01:10:02,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 629.6666666666666) internal successors, (1889), 3 states have internal predecessors, (1889), 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-29 01:10:02,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:02,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:02,752 INFO L175 Difference]: Start difference. First operand has 595 places, 587 transitions, 1286 flow. Second operand 3 states and 1889 transitions. [2023-11-29 01:10:02,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 590 transitions, 1341 flow [2023-11-29 01:10:02,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 590 transitions, 1335 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:10:02,764 INFO L231 Difference]: Finished difference. Result has 592 places, 585 transitions, 1286 flow [2023-11-29 01:10:02,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1286, PETRI_PLACES=592, PETRI_TRANSITIONS=585} [2023-11-29 01:10:02,765 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -19 predicate places. [2023-11-29 01:10:02,765 INFO L495 AbstractCegarLoop]: Abstraction has has 592 places, 585 transitions, 1286 flow [2023-11-29 01:10:02,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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-29 01:10:02,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:02,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:02,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 01:10:02,766 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:02,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:02,766 INFO L85 PathProgramCache]: Analyzing trace with hash 253781335, now seen corresponding path program 1 times [2023-11-29 01:10:02,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:02,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680639170] [2023-11-29 01:10:02,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:02,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:02,983 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-29 01:10:02,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:02,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680639170] [2023-11-29 01:10:02,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680639170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:02,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:02,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:10:02,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140183215] [2023-11-29 01:10:02,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:02,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:10:02,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:02,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:10:02,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:03,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 661 [2023-11-29 01:10:03,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 585 transitions, 1286 flow. Second operand has 8 states, 8 states have (on average 599.25) internal successors, (4794), 8 states have internal predecessors, (4794), 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-29 01:10:03,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:03,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 661 [2023-11-29 01:10:03,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:04,265 INFO L124 PetriNetUnfolderBase]: 162/2292 cut-off events. [2023-11-29 01:10:04,265 INFO L125 PetriNetUnfolderBase]: For 89/100 co-relation queries the response was YES. [2023-11-29 01:10:04,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2868 conditions, 2292 events. 162/2292 cut-off events. For 89/100 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 15051 event pairs, 61 based on Foata normal form. 3/2071 useless extension candidates. Maximal degree in co-relation 2806. Up to 200 conditions per place. [2023-11-29 01:10:04,316 INFO L140 encePairwiseOnDemand]: 645/661 looper letters, 68 selfloop transitions, 18 changer transitions 0/620 dead transitions. [2023-11-29 01:10:04,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 620 transitions, 1546 flow [2023-11-29 01:10:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:10:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 01:10:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7227 transitions. [2023-11-29 01:10:04,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9111195158850227 [2023-11-29 01:10:04,332 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7227 transitions. [2023-11-29 01:10:04,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7227 transitions. [2023-11-29 01:10:04,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:04,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7227 transitions. [2023-11-29 01:10:04,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 602.25) internal successors, (7227), 12 states have internal predecessors, (7227), 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-29 01:10:04,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 661.0) internal successors, (8593), 13 states have internal predecessors, (8593), 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-29 01:10:04,357 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 661.0) internal successors, (8593), 13 states have internal predecessors, (8593), 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-29 01:10:04,357 INFO L175 Difference]: Start difference. First operand has 592 places, 585 transitions, 1286 flow. Second operand 12 states and 7227 transitions. [2023-11-29 01:10:04,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 620 transitions, 1546 flow [2023-11-29 01:10:04,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 620 transitions, 1546 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:10:04,374 INFO L231 Difference]: Finished difference. Result has 607 places, 589 transitions, 1358 flow [2023-11-29 01:10:04,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1358, PETRI_PLACES=607, PETRI_TRANSITIONS=589} [2023-11-29 01:10:04,376 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -4 predicate places. [2023-11-29 01:10:04,376 INFO L495 AbstractCegarLoop]: Abstraction has has 607 places, 589 transitions, 1358 flow [2023-11-29 01:10:04,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 599.25) internal successors, (4794), 8 states have internal predecessors, (4794), 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-29 01:10:04,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:04,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:04,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 01:10:04,378 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:04,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1379018009, now seen corresponding path program 1 times [2023-11-29 01:10:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626891989] [2023-11-29 01:10:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:04,628 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-29 01:10:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:04,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626891989] [2023-11-29 01:10:04,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626891989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:04,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:04,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:10:04,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223358912] [2023-11-29 01:10:04,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:04,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:10:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:10:04,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:05,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 661 [2023-11-29 01:10:05,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 589 transitions, 1358 flow. Second operand has 8 states, 8 states have (on average 599.375) internal successors, (4795), 8 states have internal predecessors, (4795), 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-29 01:10:05,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:05,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 661 [2023-11-29 01:10:05,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:06,199 INFO L124 PetriNetUnfolderBase]: 246/3298 cut-off events. [2023-11-29 01:10:06,199 INFO L125 PetriNetUnfolderBase]: For 258/293 co-relation queries the response was YES. [2023-11-29 01:10:06,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4195 conditions, 3298 events. 246/3298 cut-off events. For 258/293 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 26414 event pairs, 88 based on Foata normal form. 9/2998 useless extension candidates. Maximal degree in co-relation 4125. Up to 270 conditions per place. [2023-11-29 01:10:06,260 INFO L140 encePairwiseOnDemand]: 645/661 looper letters, 64 selfloop transitions, 18 changer transitions 0/620 dead transitions. [2023-11-29 01:10:06,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 620 transitions, 1602 flow [2023-11-29 01:10:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:10:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 01:10:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7218 transitions. [2023-11-29 01:10:06,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9099848714069592 [2023-11-29 01:10:06,276 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7218 transitions. [2023-11-29 01:10:06,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7218 transitions. [2023-11-29 01:10:06,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:06,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7218 transitions. [2023-11-29 01:10:06,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 601.5) internal successors, (7218), 12 states have internal predecessors, (7218), 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-29 01:10:06,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 661.0) internal successors, (8593), 13 states have internal predecessors, (8593), 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-29 01:10:06,293 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 661.0) internal successors, (8593), 13 states have internal predecessors, (8593), 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-29 01:10:06,293 INFO L175 Difference]: Start difference. First operand has 607 places, 589 transitions, 1358 flow. Second operand 12 states and 7218 transitions. [2023-11-29 01:10:06,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 620 transitions, 1602 flow [2023-11-29 01:10:06,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 620 transitions, 1585 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 01:10:06,306 INFO L231 Difference]: Finished difference. Result has 618 places, 598 transitions, 1434 flow [2023-11-29 01:10:06,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1434, PETRI_PLACES=618, PETRI_TRANSITIONS=598} [2023-11-29 01:10:06,307 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 7 predicate places. [2023-11-29 01:10:06,307 INFO L495 AbstractCegarLoop]: Abstraction has has 618 places, 598 transitions, 1434 flow [2023-11-29 01:10:06,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 599.375) internal successors, (4795), 8 states have internal predecessors, (4795), 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-29 01:10:06,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:06,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:06,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 01:10:06,308 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:06,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash -258595710, now seen corresponding path program 1 times [2023-11-29 01:10:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:06,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640708141] [2023-11-29 01:10:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:10:06,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:06,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640708141] [2023-11-29 01:10:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640708141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:10:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535148285] [2023-11-29 01:10:06,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:06,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:10:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:06,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:10:06,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:06,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 661 [2023-11-29 01:10:06,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 598 transitions, 1434 flow. Second operand has 8 states, 8 states have (on average 599.25) internal successors, (4794), 8 states have internal predecessors, (4794), 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-29 01:10:06,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:06,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 661 [2023-11-29 01:10:06,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:07,856 INFO L124 PetriNetUnfolderBase]: 155/2907 cut-off events. [2023-11-29 01:10:07,856 INFO L125 PetriNetUnfolderBase]: For 212/252 co-relation queries the response was YES. [2023-11-29 01:10:07,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3928 conditions, 2907 events. 155/2907 cut-off events. For 212/252 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 19931 event pairs, 51 based on Foata normal form. 4/2710 useless extension candidates. Maximal degree in co-relation 3848. Up to 183 conditions per place. [2023-11-29 01:10:07,906 INFO L140 encePairwiseOnDemand]: 645/661 looper letters, 69 selfloop transitions, 22 changer transitions 0/630 dead transitions. [2023-11-29 01:10:07,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 630 transitions, 1722 flow [2023-11-29 01:10:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:10:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 01:10:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7220 transitions. [2023-11-29 01:10:07,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9102370146243066 [2023-11-29 01:10:07,919 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7220 transitions. [2023-11-29 01:10:07,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7220 transitions. [2023-11-29 01:10:07,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:07,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7220 transitions. [2023-11-29 01:10:07,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 601.6666666666666) internal successors, (7220), 12 states have internal predecessors, (7220), 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-29 01:10:07,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 661.0) internal successors, (8593), 13 states have internal predecessors, (8593), 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-29 01:10:07,942 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 661.0) internal successors, (8593), 13 states have internal predecessors, (8593), 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-29 01:10:07,942 INFO L175 Difference]: Start difference. First operand has 618 places, 598 transitions, 1434 flow. Second operand 12 states and 7220 transitions. [2023-11-29 01:10:07,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 630 transitions, 1722 flow [2023-11-29 01:10:07,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 630 transitions, 1722 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:10:07,962 INFO L231 Difference]: Finished difference. Result has 633 places, 605 transitions, 1545 flow [2023-11-29 01:10:07,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1545, PETRI_PLACES=633, PETRI_TRANSITIONS=605} [2023-11-29 01:10:07,964 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 22 predicate places. [2023-11-29 01:10:07,964 INFO L495 AbstractCegarLoop]: Abstraction has has 633 places, 605 transitions, 1545 flow [2023-11-29 01:10:07,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 599.25) internal successors, (4794), 8 states have internal predecessors, (4794), 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-29 01:10:07,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:07,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:07,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 01:10:07,965 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:07,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1994051166, now seen corresponding path program 1 times [2023-11-29 01:10:07,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:07,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643884556] [2023-11-29 01:10:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:08,690 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-29 01:10:08,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:08,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643884556] [2023-11-29 01:10:08,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643884556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:08,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:08,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:10:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321348484] [2023-11-29 01:10:08,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:08,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:08,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:08,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:10:09,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 612 out of 661 [2023-11-29 01:10:09,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 605 transitions, 1545 flow. Second operand has 6 states, 6 states have (on average 613.8333333333334) internal successors, (3683), 6 states have internal predecessors, (3683), 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-29 01:10:09,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:09,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 612 of 661 [2023-11-29 01:10:09,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:10,041 INFO L124 PetriNetUnfolderBase]: 51/1973 cut-off events. [2023-11-29 01:10:10,041 INFO L125 PetriNetUnfolderBase]: For 170/187 co-relation queries the response was YES. [2023-11-29 01:10:10,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2534 conditions, 1973 events. 51/1973 cut-off events. For 170/187 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 11077 event pairs, 0 based on Foata normal form. 8/1854 useless extension candidates. Maximal degree in co-relation 2446. Up to 63 conditions per place. [2023-11-29 01:10:10,076 INFO L140 encePairwiseOnDemand]: 656/661 looper letters, 21 selfloop transitions, 4 changer transitions 0/604 dead transitions. [2023-11-29 01:10:10,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 604 transitions, 1593 flow [2023-11-29 01:10:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:10:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:10:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3698 transitions. [2023-11-29 01:10:10,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9324256177508825 [2023-11-29 01:10:10,082 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3698 transitions. [2023-11-29 01:10:10,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3698 transitions. [2023-11-29 01:10:10,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:10,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3698 transitions. [2023-11-29 01:10:10,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 616.3333333333334) internal successors, (3698), 6 states have internal predecessors, (3698), 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-29 01:10:10,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:10,092 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:10,093 INFO L175 Difference]: Start difference. First operand has 633 places, 605 transitions, 1545 flow. Second operand 6 states and 3698 transitions. [2023-11-29 01:10:10,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 604 transitions, 1593 flow [2023-11-29 01:10:10,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 604 transitions, 1576 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 01:10:10,109 INFO L231 Difference]: Finished difference. Result has 631 places, 604 transitions, 1534 flow [2023-11-29 01:10:10,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1526, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1534, PETRI_PLACES=631, PETRI_TRANSITIONS=604} [2023-11-29 01:10:10,110 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 20 predicate places. [2023-11-29 01:10:10,110 INFO L495 AbstractCegarLoop]: Abstraction has has 631 places, 604 transitions, 1534 flow [2023-11-29 01:10:10,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 613.8333333333334) internal successors, (3683), 6 states have internal predecessors, (3683), 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-29 01:10:10,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:10,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:10,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 01:10:10,111 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:10,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash 185322867, now seen corresponding path program 1 times [2023-11-29 01:10:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:10,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580212521] [2023-11-29 01:10:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:10:10,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:10,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580212521] [2023-11-29 01:10:10,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580212521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:10,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:10,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:10:10,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787707738] [2023-11-29 01:10:10,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:10,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:10:10,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:10:10,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:10,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 661 [2023-11-29 01:10:10,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 604 transitions, 1534 flow. Second operand has 8 states, 8 states have (on average 599.375) internal successors, (4795), 8 states have internal predecessors, (4795), 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-29 01:10:10,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:10,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 661 [2023-11-29 01:10:10,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:12,895 INFO L124 PetriNetUnfolderBase]: 338/5339 cut-off events. [2023-11-29 01:10:12,895 INFO L125 PetriNetUnfolderBase]: For 671/771 co-relation queries the response was YES. [2023-11-29 01:10:12,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7399 conditions, 5339 events. 338/5339 cut-off events. For 671/771 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 47921 event pairs, 127 based on Foata normal form. 16/4949 useless extension candidates. Maximal degree in co-relation 7310. Up to 348 conditions per place. [2023-11-29 01:10:13,018 INFO L140 encePairwiseOnDemand]: 645/661 looper letters, 65 selfloop transitions, 24 changer transitions 0/633 dead transitions. [2023-11-29 01:10:13,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 633 transitions, 1823 flow [2023-11-29 01:10:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:10:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 01:10:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7211 transitions. [2023-11-29 01:10:13,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9091023701462431 [2023-11-29 01:10:13,029 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7211 transitions. [2023-11-29 01:10:13,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7211 transitions. [2023-11-29 01:10:13,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:13,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7211 transitions. [2023-11-29 01:10:13,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 600.9166666666666) internal successors, (7211), 12 states have internal predecessors, (7211), 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-29 01:10:13,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 661.0) internal successors, (8593), 13 states have internal predecessors, (8593), 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-29 01:10:13,050 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 661.0) internal successors, (8593), 13 states have internal predecessors, (8593), 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-29 01:10:13,050 INFO L175 Difference]: Start difference. First operand has 631 places, 604 transitions, 1534 flow. Second operand 12 states and 7211 transitions. [2023-11-29 01:10:13,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 633 transitions, 1823 flow [2023-11-29 01:10:13,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 633 transitions, 1816 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:10:13,070 INFO L231 Difference]: Finished difference. Result has 644 places, 617 transitions, 1679 flow [2023-11-29 01:10:13,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1679, PETRI_PLACES=644, PETRI_TRANSITIONS=617} [2023-11-29 01:10:13,072 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 33 predicate places. [2023-11-29 01:10:13,072 INFO L495 AbstractCegarLoop]: Abstraction has has 644 places, 617 transitions, 1679 flow [2023-11-29 01:10:13,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 599.375) internal successors, (4795), 8 states have internal predecessors, (4795), 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-29 01:10:13,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:13,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:13,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 01:10:13,073 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:13,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2035984476, now seen corresponding path program 1 times [2023-11-29 01:10:13,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:13,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835930034] [2023-11-29 01:10:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:13,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:10:13,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:13,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835930034] [2023-11-29 01:10:13,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835930034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:13,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:13,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:10:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980222208] [2023-11-29 01:10:13,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:13,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:10:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:13,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:10:13,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:13,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 661 [2023-11-29 01:10:13,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 617 transitions, 1679 flow. Second operand has 8 states, 8 states have (on average 599.5) internal successors, (4796), 8 states have internal predecessors, (4796), 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-29 01:10:13,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:13,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 661 [2023-11-29 01:10:13,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:15,122 INFO L124 PetriNetUnfolderBase]: 296/3956 cut-off events. [2023-11-29 01:10:15,122 INFO L125 PetriNetUnfolderBase]: For 869/908 co-relation queries the response was YES. [2023-11-29 01:10:15,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5708 conditions, 3956 events. 296/3956 cut-off events. For 869/908 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 33256 event pairs, 153 based on Foata normal form. 12/3673 useless extension candidates. Maximal degree in co-relation 5610. Up to 432 conditions per place. [2023-11-29 01:10:15,197 INFO L140 encePairwiseOnDemand]: 646/661 looper letters, 68 selfloop transitions, 19 changer transitions 0/639 dead transitions. [2023-11-29 01:10:15,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 639 transitions, 1948 flow [2023-11-29 01:10:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:10:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 01:10:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6613 transitions. [2023-11-29 01:10:15,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9095035070829321 [2023-11-29 01:10:15,203 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6613 transitions. [2023-11-29 01:10:15,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6613 transitions. [2023-11-29 01:10:15,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:15,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6613 transitions. [2023-11-29 01:10:15,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 601.1818181818181) internal successors, (6613), 11 states have internal predecessors, (6613), 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-29 01:10:15,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 661.0) internal successors, (7932), 12 states have internal predecessors, (7932), 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-29 01:10:15,214 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 661.0) internal successors, (7932), 12 states have internal predecessors, (7932), 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-29 01:10:15,214 INFO L175 Difference]: Start difference. First operand has 644 places, 617 transitions, 1679 flow. Second operand 11 states and 6613 transitions. [2023-11-29 01:10:15,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 639 transitions, 1948 flow [2023-11-29 01:10:15,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 639 transitions, 1948 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:10:15,232 INFO L231 Difference]: Finished difference. Result has 657 places, 624 transitions, 1790 flow [2023-11-29 01:10:15,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1790, PETRI_PLACES=657, PETRI_TRANSITIONS=624} [2023-11-29 01:10:15,233 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 46 predicate places. [2023-11-29 01:10:15,233 INFO L495 AbstractCegarLoop]: Abstraction has has 657 places, 624 transitions, 1790 flow [2023-11-29 01:10:15,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 599.5) internal successors, (4796), 8 states have internal predecessors, (4796), 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-29 01:10:15,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:15,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:15,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 01:10:15,234 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:15,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash -144941305, now seen corresponding path program 1 times [2023-11-29 01:10:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:15,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646838933] [2023-11-29 01:10:15,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:15,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,977 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-29 01:10:15,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:15,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646838933] [2023-11-29 01:10:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646838933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:15,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:15,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:10:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309563814] [2023-11-29 01:10:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:15,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:15,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:15,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:10:16,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 661 [2023-11-29 01:10:16,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 624 transitions, 1790 flow. Second operand has 6 states, 6 states have (on average 608.8333333333334) internal successors, (3653), 6 states have internal predecessors, (3653), 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-29 01:10:16,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:16,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 661 [2023-11-29 01:10:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:18,088 INFO L124 PetriNetUnfolderBase]: 157/3798 cut-off events. [2023-11-29 01:10:18,088 INFO L125 PetriNetUnfolderBase]: For 840/860 co-relation queries the response was YES. [2023-11-29 01:10:18,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 3798 events. 157/3798 cut-off events. For 840/860 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 28214 event pairs, 22 based on Foata normal form. 4/3573 useless extension candidates. Maximal degree in co-relation 5344. Up to 173 conditions per place. [2023-11-29 01:10:18,159 INFO L140 encePairwiseOnDemand]: 654/661 looper letters, 41 selfloop transitions, 5 changer transitions 0/633 dead transitions. [2023-11-29 01:10:18,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 633 transitions, 1911 flow [2023-11-29 01:10:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:10:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:10:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3681 transitions. [2023-11-29 01:10:18,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9281391830559758 [2023-11-29 01:10:18,165 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3681 transitions. [2023-11-29 01:10:18,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3681 transitions. [2023-11-29 01:10:18,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:18,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3681 transitions. [2023-11-29 01:10:18,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 613.5) internal successors, (3681), 6 states have internal predecessors, (3681), 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-29 01:10:18,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:18,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:18,175 INFO L175 Difference]: Start difference. First operand has 657 places, 624 transitions, 1790 flow. Second operand 6 states and 3681 transitions. [2023-11-29 01:10:18,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 633 transitions, 1911 flow [2023-11-29 01:10:18,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 633 transitions, 1890 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 01:10:18,200 INFO L231 Difference]: Finished difference. Result has 653 places, 622 transitions, 1775 flow [2023-11-29 01:10:18,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1765, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1775, PETRI_PLACES=653, PETRI_TRANSITIONS=622} [2023-11-29 01:10:18,201 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 42 predicate places. [2023-11-29 01:10:18,201 INFO L495 AbstractCegarLoop]: Abstraction has has 653 places, 622 transitions, 1775 flow [2023-11-29 01:10:18,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.8333333333334) internal successors, (3653), 6 states have internal predecessors, (3653), 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-29 01:10:18,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:18,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:18,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 01:10:18,202 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:18,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash -892859064, now seen corresponding path program 1 times [2023-11-29 01:10:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265353377] [2023-11-29 01:10:18,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:18,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:18,809 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-29 01:10:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265353377] [2023-11-29 01:10:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265353377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:18,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:10:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533115161] [2023-11-29 01:10:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:18,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:10:19,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 661 [2023-11-29 01:10:19,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 622 transitions, 1775 flow. Second operand has 6 states, 6 states have (on average 609.0) internal successors, (3654), 6 states have internal predecessors, (3654), 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-29 01:10:19,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:19,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 661 [2023-11-29 01:10:19,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:21,372 INFO L124 PetriNetUnfolderBase]: 186/4191 cut-off events. [2023-11-29 01:10:21,372 INFO L125 PetriNetUnfolderBase]: For 1058/1081 co-relation queries the response was YES. [2023-11-29 01:10:21,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6001 conditions, 4191 events. 186/4191 cut-off events. For 1058/1081 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 33079 event pairs, 30 based on Foata normal form. 0/3918 useless extension candidates. Maximal degree in co-relation 5898. Up to 197 conditions per place. [2023-11-29 01:10:21,430 INFO L140 encePairwiseOnDemand]: 654/661 looper letters, 40 selfloop transitions, 5 changer transitions 0/630 dead transitions. [2023-11-29 01:10:21,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 630 transitions, 1891 flow [2023-11-29 01:10:21,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:10:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:10:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3680 transitions. [2023-11-29 01:10:21,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9278870398386283 [2023-11-29 01:10:21,433 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3680 transitions. [2023-11-29 01:10:21,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3680 transitions. [2023-11-29 01:10:21,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:21,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3680 transitions. [2023-11-29 01:10:21,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 613.3333333333334) internal successors, (3680), 6 states have internal predecessors, (3680), 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-29 01:10:21,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:21,438 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:21,439 INFO L175 Difference]: Start difference. First operand has 653 places, 622 transitions, 1775 flow. Second operand 6 states and 3680 transitions. [2023-11-29 01:10:21,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 630 transitions, 1891 flow [2023-11-29 01:10:21,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 630 transitions, 1881 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:10:21,456 INFO L231 Difference]: Finished difference. Result has 651 places, 620 transitions, 1771 flow [2023-11-29 01:10:21,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1771, PETRI_PLACES=651, PETRI_TRANSITIONS=620} [2023-11-29 01:10:21,458 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 40 predicate places. [2023-11-29 01:10:21,458 INFO L495 AbstractCegarLoop]: Abstraction has has 651 places, 620 transitions, 1771 flow [2023-11-29 01:10:21,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 609.0) internal successors, (3654), 6 states have internal predecessors, (3654), 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-29 01:10:21,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:21,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:21,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 01:10:21,459 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:21,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -440463059, now seen corresponding path program 1 times [2023-11-29 01:10:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:21,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594869203] [2023-11-29 01:10:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,988 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-29 01:10:21,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:21,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594869203] [2023-11-29 01:10:21,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594869203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:21,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:21,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:10:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311018409] [2023-11-29 01:10:21,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:21,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:21,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:21,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:21,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:10:22,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 661 [2023-11-29 01:10:22,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 620 transitions, 1771 flow. Second operand has 6 states, 6 states have (on average 608.8333333333334) internal successors, (3653), 6 states have internal predecessors, (3653), 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-29 01:10:22,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:22,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 661 [2023-11-29 01:10:22,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:23,819 INFO L124 PetriNetUnfolderBase]: 134/3901 cut-off events. [2023-11-29 01:10:23,819 INFO L125 PetriNetUnfolderBase]: For 820/874 co-relation queries the response was YES. [2023-11-29 01:10:23,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5487 conditions, 3901 events. 134/3901 cut-off events. For 820/874 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 28889 event pairs, 22 based on Foata normal form. 7/3680 useless extension candidates. Maximal degree in co-relation 5384. Up to 183 conditions per place. [2023-11-29 01:10:23,875 INFO L140 encePairwiseOnDemand]: 654/661 looper letters, 41 selfloop transitions, 5 changer transitions 0/629 dead transitions. [2023-11-29 01:10:23,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 629 transitions, 1892 flow [2023-11-29 01:10:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:10:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:10:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3681 transitions. [2023-11-29 01:10:23,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9281391830559758 [2023-11-29 01:10:23,880 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3681 transitions. [2023-11-29 01:10:23,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3681 transitions. [2023-11-29 01:10:23,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:23,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3681 transitions. [2023-11-29 01:10:23,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 613.5) internal successors, (3681), 6 states have internal predecessors, (3681), 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-29 01:10:23,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:23,886 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:23,886 INFO L175 Difference]: Start difference. First operand has 651 places, 620 transitions, 1771 flow. Second operand 6 states and 3681 transitions. [2023-11-29 01:10:23,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 629 transitions, 1892 flow [2023-11-29 01:10:23,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 629 transitions, 1882 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:10:23,906 INFO L231 Difference]: Finished difference. Result has 649 places, 618 transitions, 1767 flow [2023-11-29 01:10:23,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1757, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1767, PETRI_PLACES=649, PETRI_TRANSITIONS=618} [2023-11-29 01:10:23,908 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 38 predicate places. [2023-11-29 01:10:23,908 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 618 transitions, 1767 flow [2023-11-29 01:10:23,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.8333333333334) internal successors, (3653), 6 states have internal predecessors, (3653), 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-29 01:10:23,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:23,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:23,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 01:10:23,910 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:23,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash 955951370, now seen corresponding path program 1 times [2023-11-29 01:10:23,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:23,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746568142] [2023-11-29 01:10:23,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:23,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:23,988 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-29 01:10:23,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:23,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746568142] [2023-11-29 01:10:23,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746568142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:23,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:23,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:10:23,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362033814] [2023-11-29 01:10:23,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:23,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:23,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:23,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:24,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 661 [2023-11-29 01:10:24,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 618 transitions, 1767 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-29 01:10:24,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:24,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 661 [2023-11-29 01:10:24,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:25,886 INFO L124 PetriNetUnfolderBase]: 411/6993 cut-off events. [2023-11-29 01:10:25,887 INFO L125 PetriNetUnfolderBase]: For 963/975 co-relation queries the response was YES. [2023-11-29 01:10:25,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9042 conditions, 6993 events. 411/6993 cut-off events. For 963/975 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 64540 event pairs, 63 based on Foata normal form. 0/6467 useless extension candidates. Maximal degree in co-relation 8940. Up to 469 conditions per place. [2023-11-29 01:10:26,007 INFO L140 encePairwiseOnDemand]: 655/661 looper letters, 19 selfloop transitions, 2 changer transitions 0/620 dead transitions. [2023-11-29 01:10:26,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 620 transitions, 1817 flow [2023-11-29 01:10:26,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:10:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1888 transitions. [2023-11-29 01:10:26,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9520927887039838 [2023-11-29 01:10:26,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1888 transitions. [2023-11-29 01:10:26,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1888 transitions. [2023-11-29 01:10:26,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:26,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1888 transitions. [2023-11-29 01:10:26,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 629.3333333333334) internal successors, (1888), 3 states have internal predecessors, (1888), 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-29 01:10:26,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:26,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:26,013 INFO L175 Difference]: Start difference. First operand has 649 places, 618 transitions, 1767 flow. Second operand 3 states and 1888 transitions. [2023-11-29 01:10:26,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 620 transitions, 1817 flow [2023-11-29 01:10:26,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 620 transitions, 1807 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:10:26,032 INFO L231 Difference]: Finished difference. Result has 643 places, 616 transitions, 1763 flow [2023-11-29 01:10:26,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1749, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1763, PETRI_PLACES=643, PETRI_TRANSITIONS=616} [2023-11-29 01:10:26,034 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 32 predicate places. [2023-11-29 01:10:26,034 INFO L495 AbstractCegarLoop]: Abstraction has has 643 places, 616 transitions, 1763 flow [2023-11-29 01:10:26,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-29 01:10:26,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:26,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:26,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 01:10:26,035 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:26,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1017502295, now seen corresponding path program 1 times [2023-11-29 01:10:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790699040] [2023-11-29 01:10:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,532 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-29 01:10:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:26,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790699040] [2023-11-29 01:10:26,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790699040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:26,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:26,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:10:26,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143814908] [2023-11-29 01:10:26,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:26,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:26,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:26,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:26,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:10:27,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 661 [2023-11-29 01:10:27,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 616 transitions, 1763 flow. Second operand has 6 states, 6 states have (on average 609.1666666666666) internal successors, (3655), 6 states have internal predecessors, (3655), 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-29 01:10:27,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:27,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 661 [2023-11-29 01:10:27,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:28,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1812] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][505], [Black: 828#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 814#(<= ~n2~0 0), 678#(= |#race~n3~0| 0), 839#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 709#true, Black: 776#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 762#(<= ~n1~0 0), 754#(= |#race~a2~0| 0), Black: 763#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 913#true, 578#L104-7true, Black: 847#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 846#(<= ~n3~0 0), Black: 719#(<= ~n1~0 0), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 852#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 854#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 725#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 788#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 733#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 860#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 748#(not |thread2Thread1of1ForFork2_#t~short11#1|), 757#true, 809#true, Black: 752#true, 915#(= |#race~a3~0| 0), 670#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short2#1|), 782#true, Black: 887#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 920#(= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), Black: 874#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 873#(<= ~n3~0 0), 711#(= |#race~a1~0| 0), 216#L79-4true, Black: 815#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 703#(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))]) [2023-11-29 01:10:28,694 INFO L294 olderBase$Statistics]: this new event has 348 ancestors and is cut-off event [2023-11-29 01:10:28,694 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is cut-off event [2023-11-29 01:10:28,694 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is cut-off event [2023-11-29 01:10:28,695 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2023-11-29 01:10:28,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1812] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][510], [Black: 828#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 814#(<= ~n2~0 0), 678#(= |#race~n3~0| 0), 839#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 709#true, Black: 776#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 762#(<= ~n1~0 0), 754#(= |#race~a2~0| 0), Black: 763#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 921#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 913#true, 578#L104-7true, Black: 847#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 846#(<= ~n3~0 0), Black: 719#(<= ~n1~0 0), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 852#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 854#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 725#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 788#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 733#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 860#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 748#(not |thread2Thread1of1ForFork2_#t~short11#1|), 757#true, 809#true, Black: 752#true, 915#(= |#race~a3~0| 0), 670#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short2#1|), 782#true, Black: 887#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 874#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 873#(<= ~n3~0 0), 176#L79-5true, 711#(= |#race~a1~0| 0), Black: 815#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 703#(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))]) [2023-11-29 01:10:28,704 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2023-11-29 01:10:28,704 INFO L297 olderBase$Statistics]: existing Event has 318 ancestors and is cut-off event [2023-11-29 01:10:28,704 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2023-11-29 01:10:28,705 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2023-11-29 01:10:28,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1812] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][515], [Black: 828#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 814#(<= ~n2~0 0), 678#(= |#race~n3~0| 0), 839#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 157#L79-6true, Black: 709#true, Black: 776#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 762#(<= ~n1~0 0), 754#(= |#race~a2~0| 0), Black: 763#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 913#true, 578#L104-7true, Black: 847#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 846#(<= ~n3~0 0), Black: 719#(<= ~n1~0 0), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 852#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 854#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 725#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 788#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 733#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 860#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 748#(not |thread2Thread1of1ForFork2_#t~short11#1|), 757#true, 809#true, Black: 752#true, 915#(= |#race~a3~0| 0), 670#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short2#1|), 782#true, Black: 887#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 874#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 873#(<= ~n3~0 0), 922#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), 711#(= |#race~a1~0| 0), Black: 815#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 703#(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))]) [2023-11-29 01:10:28,714 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2023-11-29 01:10:28,715 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2023-11-29 01:10:28,715 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-29 01:10:28,715 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2023-11-29 01:10:28,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1812] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][522], [Black: 828#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 814#(<= ~n2~0 0), 678#(= |#race~n3~0| 0), 839#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 709#true, 133#L79-7true, Black: 776#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 762#(<= ~n1~0 0), 754#(= |#race~a2~0| 0), Black: 763#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 913#true, 578#L104-7true, Black: 847#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 846#(<= ~n3~0 0), Black: 719#(<= ~n1~0 0), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 852#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 854#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 725#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 788#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 733#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 860#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 748#(not |thread2Thread1of1ForFork2_#t~short11#1|), 757#true, 923#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0)), 809#true, Black: 752#true, 915#(= |#race~a3~0| 0), 670#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short2#1|), 782#true, Black: 887#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 874#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 873#(<= ~n3~0 0), 711#(= |#race~a1~0| 0), Black: 815#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 703#(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))]) [2023-11-29 01:10:28,723 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is cut-off event [2023-11-29 01:10:28,723 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2023-11-29 01:10:28,723 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2023-11-29 01:10:28,723 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2023-11-29 01:10:28,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1812] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][522], [Black: 828#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 814#(<= ~n2~0 0), 678#(= |#race~n3~0| 0), 839#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 709#true, Black: 776#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 762#(<= ~n1~0 0), 754#(= |#race~a2~0| 0), Black: 763#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 913#true, 578#L104-7true, 393#L79-8true, Black: 847#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 846#(<= ~n3~0 0), Black: 719#(<= ~n1~0 0), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 852#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 854#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 725#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 788#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 733#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 860#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 748#(not |thread2Thread1of1ForFork2_#t~short11#1|), 757#true, 923#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0)), 809#true, Black: 752#true, 915#(= |#race~a3~0| 0), 670#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short2#1|), 782#true, Black: 887#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 874#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 873#(<= ~n3~0 0), 711#(= |#race~a1~0| 0), Black: 815#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 703#(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))]) [2023-11-29 01:10:28,729 INFO L294 olderBase$Statistics]: this new event has 352 ancestors and is cut-off event [2023-11-29 01:10:28,729 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2023-11-29 01:10:28,729 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2023-11-29 01:10:28,729 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-29 01:10:28,843 INFO L124 PetriNetUnfolderBase]: 261/4477 cut-off events. [2023-11-29 01:10:28,843 INFO L125 PetriNetUnfolderBase]: For 1124/1139 co-relation queries the response was YES. [2023-11-29 01:10:28,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6432 conditions, 4477 events. 261/4477 cut-off events. For 1124/1139 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 37768 event pairs, 32 based on Foata normal form. 4/4251 useless extension candidates. Maximal degree in co-relation 6329. Up to 200 conditions per place. [2023-11-29 01:10:28,911 INFO L140 encePairwiseOnDemand]: 654/661 looper letters, 39 selfloop transitions, 5 changer transitions 0/623 dead transitions. [2023-11-29 01:10:28,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 623 transitions, 1874 flow [2023-11-29 01:10:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:10:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:10:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3679 transitions. [2023-11-29 01:10:28,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9276348966212808 [2023-11-29 01:10:28,915 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3679 transitions. [2023-11-29 01:10:28,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3679 transitions. [2023-11-29 01:10:28,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:28,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3679 transitions. [2023-11-29 01:10:28,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 613.1666666666666) internal successors, (3679), 6 states have internal predecessors, (3679), 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-29 01:10:28,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:28,921 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:28,922 INFO L175 Difference]: Start difference. First operand has 643 places, 616 transitions, 1763 flow. Second operand 6 states and 3679 transitions. [2023-11-29 01:10:28,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 623 transitions, 1874 flow [2023-11-29 01:10:28,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 623 transitions, 1874 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:10:28,936 INFO L231 Difference]: Finished difference. Result has 646 places, 614 transitions, 1769 flow [2023-11-29 01:10:28,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1769, PETRI_PLACES=646, PETRI_TRANSITIONS=614} [2023-11-29 01:10:28,937 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 35 predicate places. [2023-11-29 01:10:28,938 INFO L495 AbstractCegarLoop]: Abstraction has has 646 places, 614 transitions, 1769 flow [2023-11-29 01:10:28,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 609.1666666666666) internal successors, (3655), 6 states have internal predecessors, (3655), 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-29 01:10:28,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:28,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:28,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 01:10:28,939 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:28,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2136512494, now seen corresponding path program 1 times [2023-11-29 01:10:28,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:28,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555266957] [2023-11-29 01:10:28,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:28,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:29,375 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-29 01:10:29,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:29,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555266957] [2023-11-29 01:10:29,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555266957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:29,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:29,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:10:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172344675] [2023-11-29 01:10:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:29,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:10:30,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 661 [2023-11-29 01:10:30,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 614 transitions, 1769 flow. Second operand has 6 states, 6 states have (on average 609.0) internal successors, (3654), 6 states have internal predecessors, (3654), 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-29 01:10:30,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:30,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 661 [2023-11-29 01:10:30,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:31,561 INFO L124 PetriNetUnfolderBase]: 195/4527 cut-off events. [2023-11-29 01:10:31,561 INFO L125 PetriNetUnfolderBase]: For 1048/1104 co-relation queries the response was YES. [2023-11-29 01:10:31,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6455 conditions, 4527 events. 195/4527 cut-off events. For 1048/1104 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 36342 event pairs, 29 based on Foata normal form. 7/4309 useless extension candidates. Maximal degree in co-relation 6351. Up to 196 conditions per place. [2023-11-29 01:10:31,653 INFO L140 encePairwiseOnDemand]: 654/661 looper letters, 40 selfloop transitions, 5 changer transitions 0/622 dead transitions. [2023-11-29 01:10:31,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 622 transitions, 1885 flow [2023-11-29 01:10:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:10:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:10:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3680 transitions. [2023-11-29 01:10:31,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9278870398386283 [2023-11-29 01:10:31,659 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3680 transitions. [2023-11-29 01:10:31,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3680 transitions. [2023-11-29 01:10:31,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:31,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3680 transitions. [2023-11-29 01:10:31,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 613.3333333333334) internal successors, (3680), 6 states have internal predecessors, (3680), 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-29 01:10:31,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:31,669 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:31,669 INFO L175 Difference]: Start difference. First operand has 646 places, 614 transitions, 1769 flow. Second operand 6 states and 3680 transitions. [2023-11-29 01:10:31,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 622 transitions, 1885 flow [2023-11-29 01:10:31,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 622 transitions, 1875 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:10:31,690 INFO L231 Difference]: Finished difference. Result has 644 places, 612 transitions, 1765 flow [2023-11-29 01:10:31,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1765, PETRI_PLACES=644, PETRI_TRANSITIONS=612} [2023-11-29 01:10:31,691 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 33 predicate places. [2023-11-29 01:10:31,691 INFO L495 AbstractCegarLoop]: Abstraction has has 644 places, 612 transitions, 1765 flow [2023-11-29 01:10:31,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 609.0) internal successors, (3654), 6 states have internal predecessors, (3654), 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-29 01:10:31,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:31,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:31,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 01:10:31,692 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:31,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1762994424, now seen corresponding path program 1 times [2023-11-29 01:10:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760773002] [2023-11-29 01:10:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:32,307 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-29 01:10:32,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760773002] [2023-11-29 01:10:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760773002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:32,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:32,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:10:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953648528] [2023-11-29 01:10:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:32,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:32,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:32,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:10:32,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 612 out of 661 [2023-11-29 01:10:32,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 612 transitions, 1765 flow. Second operand has 6 states, 6 states have (on average 614.0) internal successors, (3684), 6 states have internal predecessors, (3684), 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-29 01:10:32,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:32,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 612 of 661 [2023-11-29 01:10:32,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:33,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1813] thread3EXIT-->L105-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][422], [Black: 828#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 814#(<= ~n2~0 0), 678#(= |#race~n3~0| 0), 612#L105-7true, 839#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 709#true, Black: 776#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 762#(<= ~n1~0 0), Black: 763#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 754#(= |#race~a2~0| 0), Black: 913#true, Black: 847#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 719#(<= ~n1~0 0), Black: 846#(<= ~n3~0 0), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 852#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 854#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 725#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 860#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 788#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 733#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 655#(= |#race~n1~0| 0), 841#true, Black: 742#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 748#(not |thread2Thread1of1ForFork2_#t~short11#1|), 937#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 757#true, 809#true, Black: 752#true, 670#(= |#race~n2~0| 0), 925#true, 915#(= |#race~a3~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short2#1|), 782#true, Black: 887#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 874#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 873#(<= ~n3~0 0), 711#(= |#race~a1~0| 0), Black: 815#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 703#(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))]) [2023-11-29 01:10:33,744 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is not cut-off event [2023-11-29 01:10:33,744 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:10:33,745 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:10:33,745 INFO L297 olderBase$Statistics]: existing Event has 382 ancestors and is not cut-off event [2023-11-29 01:10:33,770 INFO L124 PetriNetUnfolderBase]: 73/3123 cut-off events. [2023-11-29 01:10:33,770 INFO L125 PetriNetUnfolderBase]: For 510/524 co-relation queries the response was YES. [2023-11-29 01:10:33,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4271 conditions, 3123 events. 73/3123 cut-off events. For 510/524 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 21215 event pairs, 2 based on Foata normal form. 0/2982 useless extension candidates. Maximal degree in co-relation 4166. Up to 109 conditions per place. [2023-11-29 01:10:33,824 INFO L140 encePairwiseOnDemand]: 656/661 looper letters, 21 selfloop transitions, 4 changer transitions 0/611 dead transitions. [2023-11-29 01:10:33,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 611 transitions, 1813 flow [2023-11-29 01:10:33,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:10:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:10:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3698 transitions. [2023-11-29 01:10:33,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9324256177508825 [2023-11-29 01:10:33,828 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3698 transitions. [2023-11-29 01:10:33,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3698 transitions. [2023-11-29 01:10:33,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:33,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3698 transitions. [2023-11-29 01:10:33,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 616.3333333333334) internal successors, (3698), 6 states have internal predecessors, (3698), 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-29 01:10:33,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:33,834 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:33,834 INFO L175 Difference]: Start difference. First operand has 644 places, 612 transitions, 1765 flow. Second operand 6 states and 3698 transitions. [2023-11-29 01:10:33,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 611 transitions, 1813 flow [2023-11-29 01:10:33,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 611 transitions, 1803 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:10:33,848 INFO L231 Difference]: Finished difference. Result has 643 places, 611 transitions, 1761 flow [2023-11-29 01:10:33,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1761, PETRI_PLACES=643, PETRI_TRANSITIONS=611} [2023-11-29 01:10:33,849 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 32 predicate places. [2023-11-29 01:10:33,849 INFO L495 AbstractCegarLoop]: Abstraction has has 643 places, 611 transitions, 1761 flow [2023-11-29 01:10:33,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 614.0) internal successors, (3684), 6 states have internal predecessors, (3684), 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-29 01:10:33,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:33,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:33,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 01:10:33,850 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:33,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:33,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2037878653, now seen corresponding path program 1 times [2023-11-29 01:10:33,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:33,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920207244] [2023-11-29 01:10:33,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:33,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:34,281 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-29 01:10:34,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:34,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920207244] [2023-11-29 01:10:34,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920207244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:34,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:34,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:10:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614681986] [2023-11-29 01:10:34,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:34,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:34,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:34,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:34,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:10:35,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 661 [2023-11-29 01:10:35,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 611 transitions, 1761 flow. Second operand has 6 states, 6 states have (on average 609.1666666666666) internal successors, (3655), 6 states have internal predecessors, (3655), 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-29 01:10:35,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:35,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 661 [2023-11-29 01:10:35,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:36,337 INFO L124 PetriNetUnfolderBase]: 221/4390 cut-off events. [2023-11-29 01:10:36,337 INFO L125 PetriNetUnfolderBase]: For 1084/1094 co-relation queries the response was YES. [2023-11-29 01:10:36,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6317 conditions, 4390 events. 221/4390 cut-off events. For 1084/1094 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 35969 event pairs, 32 based on Foata normal form. 0/4217 useless extension candidates. Maximal degree in co-relation 6213. Up to 204 conditions per place. [2023-11-29 01:10:36,406 INFO L140 encePairwiseOnDemand]: 654/661 looper letters, 39 selfloop transitions, 5 changer transitions 0/618 dead transitions. [2023-11-29 01:10:36,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 618 transitions, 1872 flow [2023-11-29 01:10:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:10:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:10:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3679 transitions. [2023-11-29 01:10:36,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9276348966212808 [2023-11-29 01:10:36,411 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3679 transitions. [2023-11-29 01:10:36,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3679 transitions. [2023-11-29 01:10:36,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:36,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3679 transitions. [2023-11-29 01:10:36,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 613.1666666666666) internal successors, (3679), 6 states have internal predecessors, (3679), 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-29 01:10:36,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:36,417 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 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-29 01:10:36,417 INFO L175 Difference]: Start difference. First operand has 643 places, 611 transitions, 1761 flow. Second operand 6 states and 3679 transitions. [2023-11-29 01:10:36,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 618 transitions, 1872 flow [2023-11-29 01:10:36,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 618 transitions, 1865 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:10:36,432 INFO L231 Difference]: Finished difference. Result has 642 places, 609 transitions, 1760 flow [2023-11-29 01:10:36,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1760, PETRI_PLACES=642, PETRI_TRANSITIONS=609} [2023-11-29 01:10:36,434 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 31 predicate places. [2023-11-29 01:10:36,434 INFO L495 AbstractCegarLoop]: Abstraction has has 642 places, 609 transitions, 1760 flow [2023-11-29 01:10:36,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 609.1666666666666) internal successors, (3655), 6 states have internal predecessors, (3655), 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-29 01:10:36,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:36,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:36,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 01:10:36,435 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:36,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1886264398, now seen corresponding path program 1 times [2023-11-29 01:10:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:36,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27889933] [2023-11-29 01:10:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:36,495 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-29 01:10:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27889933] [2023-11-29 01:10:36,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27889933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:36,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:36,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:10:36,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915808824] [2023-11-29 01:10:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:36,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:36,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:36,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:36,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:36,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 629 out of 661 [2023-11-29 01:10:36,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 609 transitions, 1760 flow. Second operand has 3 states, 3 states have (on average 632.0) internal successors, (1896), 3 states have internal predecessors, (1896), 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-29 01:10:36,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:36,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 629 of 661 [2023-11-29 01:10:36,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:37,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1813] thread3EXIT-->L105-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][420], [Black: 828#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 814#(<= ~n2~0 0), 678#(= |#race~n3~0| 0), 612#L105-7true, 839#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 709#true, Black: 776#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 762#(<= ~n1~0 0), Black: 763#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 754#(= |#race~a2~0| 0), Black: 913#true, Black: 847#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 846#(<= ~n3~0 0), Black: 719#(<= ~n1~0 0), Black: 852#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 725#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 854#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 860#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 733#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 788#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 939#true, 841#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short20#1|), 946#true, Black: 748#(not |thread2Thread1of1ForFork2_#t~short11#1|), 937#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 757#true, 809#true, Black: 752#true, 915#(= |#race~a3~0| 0), 670#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short2#1|), 782#true, Black: 887#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 874#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 873#(<= ~n3~0 0), 711#(= |#race~a1~0| 0), Black: 815#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 703#(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))]) [2023-11-29 01:10:37,703 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is not cut-off event [2023-11-29 01:10:37,703 INFO L297 olderBase$Statistics]: existing Event has 382 ancestors and is not cut-off event [2023-11-29 01:10:37,703 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:10:37,703 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:10:37,774 INFO L124 PetriNetUnfolderBase]: 126/4477 cut-off events. [2023-11-29 01:10:37,774 INFO L125 PetriNetUnfolderBase]: For 908/926 co-relation queries the response was YES. [2023-11-29 01:10:37,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6187 conditions, 4477 events. 126/4477 cut-off events. For 908/926 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 34413 event pairs, 22 based on Foata normal form. 0/4324 useless extension candidates. Maximal degree in co-relation 6084. Up to 121 conditions per place. [2023-11-29 01:10:37,855 INFO L140 encePairwiseOnDemand]: 659/661 looper letters, 9 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2023-11-29 01:10:37,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 608 transitions, 1778 flow [2023-11-29 01:10:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:10:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1898 transitions. [2023-11-29 01:10:37,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.957135653050933 [2023-11-29 01:10:37,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1898 transitions. [2023-11-29 01:10:37,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1898 transitions. [2023-11-29 01:10:37,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:37,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1898 transitions. [2023-11-29 01:10:37,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 632.6666666666666) internal successors, (1898), 3 states have internal predecessors, (1898), 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-29 01:10:37,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:37,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:37,861 INFO L175 Difference]: Start difference. First operand has 642 places, 609 transitions, 1760 flow. Second operand 3 states and 1898 transitions. [2023-11-29 01:10:37,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 608 transitions, 1778 flow [2023-11-29 01:10:37,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 608 transitions, 1768 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:10:37,876 INFO L231 Difference]: Finished difference. Result has 638 places, 608 transitions, 1750 flow [2023-11-29 01:10:37,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1748, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1750, PETRI_PLACES=638, PETRI_TRANSITIONS=608} [2023-11-29 01:10:37,877 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 27 predicate places. [2023-11-29 01:10:37,878 INFO L495 AbstractCegarLoop]: Abstraction has has 638 places, 608 transitions, 1750 flow [2023-11-29 01:10:37,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 632.0) internal successors, (1896), 3 states have internal predecessors, (1896), 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-29 01:10:37,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:37,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:10:37,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 01:10:37,878 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:37,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:37,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1931203785, now seen corresponding path program 1 times [2023-11-29 01:10:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:37,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58816933] [2023-11-29 01:10:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:37,949 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-29 01:10:37,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:37,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58816933] [2023-11-29 01:10:37,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58816933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:37,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:37,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:10:37,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511347070] [2023-11-29 01:10:37,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:37,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:37,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:37,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:37,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:37,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 661 [2023-11-29 01:10:37,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 608 transitions, 1750 flow. Second operand has 3 states, 3 states have (on average 629.0) internal successors, (1887), 3 states have internal predecessors, (1887), 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-29 01:10:37,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:37,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 661 [2023-11-29 01:10:37,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:39,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1813] thread3EXIT-->L105-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][422], [Black: 828#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 814#(<= ~n2~0 0), 678#(= |#race~n3~0| 0), 612#L105-7true, 839#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 709#true, Black: 776#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 762#(<= ~n1~0 0), Black: 763#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 754#(= |#race~a2~0| 0), Black: 913#true, Black: 847#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 846#(<= ~n3~0 0), Black: 719#(<= ~n1~0 0), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 852#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 725#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 854#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 860#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 733#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 788#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 655#(= |#race~n1~0| 0), 841#true, Black: 742#(not |thread3Thread1of1ForFork0_#t~short20#1|), 946#true, Black: 748#(not |thread2Thread1of1ForFork2_#t~short11#1|), 937#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 757#true, 809#true, Black: 752#true, 915#(= |#race~a3~0| 0), 670#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short2#1|), 782#true, Black: 887#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 950#true, Black: 874#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 873#(<= ~n3~0 0), 711#(= |#race~a1~0| 0), Black: 815#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 703#(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))]) [2023-11-29 01:10:39,094 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is not cut-off event [2023-11-29 01:10:39,094 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:10:39,094 INFO L297 olderBase$Statistics]: existing Event has 382 ancestors and is not cut-off event [2023-11-29 01:10:39,094 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:10:39,155 INFO L124 PetriNetUnfolderBase]: 130/4024 cut-off events. [2023-11-29 01:10:39,155 INFO L125 PetriNetUnfolderBase]: For 725/745 co-relation queries the response was YES. [2023-11-29 01:10:39,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5507 conditions, 4024 events. 130/4024 cut-off events. For 725/745 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 29530 event pairs, 27 based on Foata normal form. 0/3913 useless extension candidates. Maximal degree in co-relation 5404. Up to 128 conditions per place. [2023-11-29 01:10:39,233 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 11 selfloop transitions, 1 changer transitions 0/606 dead transitions. [2023-11-29 01:10:39,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 606 transitions, 1770 flow [2023-11-29 01:10:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:10:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2023-11-29 01:10:39,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9541099344427635 [2023-11-29 01:10:39,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1892 transitions. [2023-11-29 01:10:39,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1892 transitions. [2023-11-29 01:10:39,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:39,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1892 transitions. [2023-11-29 01:10:39,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 630.6666666666666) internal successors, (1892), 3 states have internal predecessors, (1892), 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-29 01:10:39,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:39,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:39,238 INFO L175 Difference]: Start difference. First operand has 638 places, 608 transitions, 1750 flow. Second operand 3 states and 1892 transitions. [2023-11-29 01:10:39,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 606 transitions, 1770 flow [2023-11-29 01:10:39,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 606 transitions, 1769 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:10:39,253 INFO L231 Difference]: Finished difference. Result has 637 places, 606 transitions, 1747 flow [2023-11-29 01:10:39,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1745, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1747, PETRI_PLACES=637, PETRI_TRANSITIONS=606} [2023-11-29 01:10:39,254 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 26 predicate places. [2023-11-29 01:10:39,255 INFO L495 AbstractCegarLoop]: Abstraction has has 637 places, 606 transitions, 1747 flow [2023-11-29 01:10:39,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 629.0) internal successors, (1887), 3 states have internal predecessors, (1887), 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-29 01:10:39,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:39,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:39,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 01:10:39,255 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:39,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1579462060, now seen corresponding path program 1 times [2023-11-29 01:10:39,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:39,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747569036] [2023-11-29 01:10:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:39,344 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-29 01:10:39,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747569036] [2023-11-29 01:10:39,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747569036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:39,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:39,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:10:39,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89643825] [2023-11-29 01:10:39,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:39,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:39,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:39,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:39,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 661 [2023-11-29 01:10:39,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 606 transitions, 1747 flow. Second operand has 3 states, 3 states have (on average 629.0) internal successors, (1887), 3 states have internal predecessors, (1887), 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-29 01:10:39,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:39,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 661 [2023-11-29 01:10:39,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:40,488 INFO L124 PetriNetUnfolderBase]: 144/3966 cut-off events. [2023-11-29 01:10:40,489 INFO L125 PetriNetUnfolderBase]: For 837/847 co-relation queries the response was YES. [2023-11-29 01:10:40,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5576 conditions, 3966 events. 144/3966 cut-off events. For 837/847 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 30344 event pairs, 32 based on Foata normal form. 15/3898 useless extension candidates. Maximal degree in co-relation 5473. Up to 139 conditions per place. [2023-11-29 01:10:40,556 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 7 selfloop transitions, 0 changer transitions 27/604 dead transitions. [2023-11-29 01:10:40,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 604 transitions, 1765 flow [2023-11-29 01:10:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:10:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1891 transitions. [2023-11-29 01:10:40,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9536056480080686 [2023-11-29 01:10:40,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1891 transitions. [2023-11-29 01:10:40,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1891 transitions. [2023-11-29 01:10:40,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:40,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1891 transitions. [2023-11-29 01:10:40,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 630.3333333333334) internal successors, (1891), 3 states have internal predecessors, (1891), 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-29 01:10:40,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:40,563 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:40,564 INFO L175 Difference]: Start difference. First operand has 637 places, 606 transitions, 1747 flow. Second operand 3 states and 1891 transitions. [2023-11-29 01:10:40,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 604 transitions, 1765 flow [2023-11-29 01:10:40,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 604 transitions, 1764 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:10:40,583 INFO L231 Difference]: Finished difference. Result has 636 places, 577 transitions, 1615 flow [2023-11-29 01:10:40,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1615, PETRI_PLACES=636, PETRI_TRANSITIONS=577} [2023-11-29 01:10:40,584 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 25 predicate places. [2023-11-29 01:10:40,584 INFO L495 AbstractCegarLoop]: Abstraction has has 636 places, 577 transitions, 1615 flow [2023-11-29 01:10:40,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 629.0) internal successors, (1887), 3 states have internal predecessors, (1887), 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-29 01:10:40,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:40,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:40,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 01:10:40,585 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:40,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1966661496, now seen corresponding path program 1 times [2023-11-29 01:10:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:40,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589677941] [2023-11-29 01:10:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:40,667 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-29 01:10:40,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:40,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589677941] [2023-11-29 01:10:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589677941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:40,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:40,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:10:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075635151] [2023-11-29 01:10:40,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:40,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:40,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:40,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:40,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 661 [2023-11-29 01:10:40,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 577 transitions, 1615 flow. Second operand has 3 states, 3 states have (on average 628.6666666666666) internal successors, (1886), 3 states have internal predecessors, (1886), 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-29 01:10:40,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:40,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 661 [2023-11-29 01:10:40,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:41,732 INFO L124 PetriNetUnfolderBase]: 140/3784 cut-off events. [2023-11-29 01:10:41,733 INFO L125 PetriNetUnfolderBase]: For 675/683 co-relation queries the response was YES. [2023-11-29 01:10:41,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5209 conditions, 3784 events. 140/3784 cut-off events. For 675/683 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 26111 event pairs, 20 based on Foata normal form. 0/3692 useless extension candidates. Maximal degree in co-relation 5172. Up to 93 conditions per place. [2023-11-29 01:10:41,796 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 10 selfloop transitions, 2 changer transitions 13/578 dead transitions. [2023-11-29 01:10:41,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 578 transitions, 1643 flow [2023-11-29 01:10:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:10:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2023-11-29 01:10:41,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9551185073121533 [2023-11-29 01:10:41,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2023-11-29 01:10:41,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2023-11-29 01:10:41,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:41,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2023-11-29 01:10:41,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 631.3333333333334) internal successors, (1894), 3 states have internal predecessors, (1894), 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-29 01:10:41,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:41,801 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:41,801 INFO L175 Difference]: Start difference. First operand has 636 places, 577 transitions, 1615 flow. Second operand 3 states and 1894 transitions. [2023-11-29 01:10:41,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 578 transitions, 1643 flow [2023-11-29 01:10:41,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 578 transitions, 1637 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-29 01:10:41,815 INFO L231 Difference]: Finished difference. Result has 615 places, 563 transitions, 1508 flow [2023-11-29 01:10:41,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=615, PETRI_TRANSITIONS=563} [2023-11-29 01:10:41,816 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, 4 predicate places. [2023-11-29 01:10:41,816 INFO L495 AbstractCegarLoop]: Abstraction has has 615 places, 563 transitions, 1508 flow [2023-11-29 01:10:41,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.6666666666666) internal successors, (1886), 3 states have internal predecessors, (1886), 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-29 01:10:41,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:41,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:41,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 01:10:41,817 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:41,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash -831008118, now seen corresponding path program 1 times [2023-11-29 01:10:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:41,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396759212] [2023-11-29 01:10:41,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:41,874 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-29 01:10:41,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:41,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396759212] [2023-11-29 01:10:41,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396759212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:41,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:41,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:10:41,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466617796] [2023-11-29 01:10:41,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:41,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:41,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:41,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:41,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:41,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 661 [2023-11-29 01:10:41,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 563 transitions, 1508 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-29 01:10:41,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:41,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 661 [2023-11-29 01:10:41,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:42,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1501] L51-8-->L51-9: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][390], [Black: 828#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 814#(<= ~n2~0 0), 678#(= |#race~n3~0| 0), Black: 709#true, 186#L79-1true, Black: 776#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 762#(<= ~n1~0 0), 754#(= |#race~a2~0| 0), Black: 763#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 962#true, Black: 913#true, 615#L65-1true, Black: 847#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 846#(<= ~n3~0 0), Black: 719#(<= ~n1~0 0), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 852#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 725#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 854#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 788#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 733#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 860#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short20#1|), 320#L51-9true, 52#L102-4true, Black: 748#(not |thread2Thread1of1ForFork2_#t~short11#1|), 958#true, 757#true, 809#true, 954#true, Black: 752#true, 915#(= |#race~a3~0| 0), 670#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short2#1|), 782#true, Black: 887#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 874#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 873#(<= ~n3~0 0), 711#(= |#race~a1~0| 0), Black: 815#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2023-11-29 01:10:42,649 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2023-11-29 01:10:42,649 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2023-11-29 01:10:42,649 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2023-11-29 01:10:42,649 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2023-11-29 01:10:42,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1812] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][424], [Black: 828#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 814#(<= ~n2~0 0), 678#(= |#race~n3~0| 0), 839#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 709#true, 186#L79-1true, Black: 776#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 762#(<= ~n1~0 0), 754#(= |#race~a2~0| 0), Black: 763#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), 962#true, Black: 913#true, 578#L104-7true, Black: 847#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 846#(<= ~n3~0 0), Black: 719#(<= ~n1~0 0), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 852#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 725#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 854#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 788#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 733#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 860#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 841#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 748#(not |thread2Thread1of1ForFork2_#t~short11#1|), 958#true, 757#true, 809#true, Black: 752#true, 954#true, 915#(= |#race~a3~0| 0), 670#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short2#1|), 782#true, Black: 887#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 874#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 873#(<= ~n3~0 0), 711#(= |#race~a1~0| 0), Black: 815#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 703#(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))]) [2023-11-29 01:10:42,728 INFO L294 olderBase$Statistics]: this new event has 382 ancestors and is cut-off event [2023-11-29 01:10:42,728 INFO L297 olderBase$Statistics]: existing Event has 376 ancestors and is cut-off event [2023-11-29 01:10:42,728 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2023-11-29 01:10:42,728 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2023-11-29 01:10:42,733 INFO L124 PetriNetUnfolderBase]: 135/3175 cut-off events. [2023-11-29 01:10:42,733 INFO L125 PetriNetUnfolderBase]: For 382/396 co-relation queries the response was YES. [2023-11-29 01:10:42,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 3175 events. 135/3175 cut-off events. For 382/396 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 21108 event pairs, 27 based on Foata normal form. 0/3086 useless extension candidates. Maximal degree in co-relation 4171. Up to 90 conditions per place. [2023-11-29 01:10:42,789 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 10 selfloop transitions, 2 changer transitions 13/564 dead transitions. [2023-11-29 01:10:42,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 564 transitions, 1536 flow [2023-11-29 01:10:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:10:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1891 transitions. [2023-11-29 01:10:42,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9536056480080686 [2023-11-29 01:10:42,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1891 transitions. [2023-11-29 01:10:42,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1891 transitions. [2023-11-29 01:10:42,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:42,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1891 transitions. [2023-11-29 01:10:42,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 630.3333333333334) internal successors, (1891), 3 states have internal predecessors, (1891), 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-29 01:10:42,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:42,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:42,793 INFO L175 Difference]: Start difference. First operand has 615 places, 563 transitions, 1508 flow. Second operand 3 states and 1891 transitions. [2023-11-29 01:10:42,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 564 transitions, 1536 flow [2023-11-29 01:10:42,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 564 transitions, 1480 flow, removed 11 selfloop flow, removed 15 redundant places. [2023-11-29 01:10:42,803 INFO L231 Difference]: Finished difference. Result has 594 places, 549 transitions, 1370 flow [2023-11-29 01:10:42,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1370, PETRI_PLACES=594, PETRI_TRANSITIONS=549} [2023-11-29 01:10:42,804 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -17 predicate places. [2023-11-29 01:10:42,804 INFO L495 AbstractCegarLoop]: Abstraction has has 594 places, 549 transitions, 1370 flow [2023-11-29 01:10:42,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-29 01:10:42,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:42,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:42,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 01:10:42,805 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 103 more)] === [2023-11-29 01:10:42,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:42,805 INFO L85 PathProgramCache]: Analyzing trace with hash -411350130, now seen corresponding path program 1 times [2023-11-29 01:10:42,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:42,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203452874] [2023-11-29 01:10:42,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:42,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:42,864 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-29 01:10:42,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:42,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203452874] [2023-11-29 01:10:42,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203452874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:42,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:10:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175677851] [2023-11-29 01:10:42,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:42,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:42,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:42,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:42,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 661 [2023-11-29 01:10:42,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 549 transitions, 1370 flow. Second operand has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-29 01:10:42,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:42,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 661 [2023-11-29 01:10:42,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:10:43,445 INFO L124 PetriNetUnfolderBase]: 130/2415 cut-off events. [2023-11-29 01:10:43,445 INFO L125 PetriNetUnfolderBase]: For 222/231 co-relation queries the response was YES. [2023-11-29 01:10:43,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3145 conditions, 2415 events. 130/2415 cut-off events. For 222/231 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 16131 event pairs, 19 based on Foata normal form. 1/2342 useless extension candidates. Maximal degree in co-relation 3114. Up to 68 conditions per place. [2023-11-29 01:10:43,477 INFO L140 encePairwiseOnDemand]: 658/661 looper letters, 0 selfloop transitions, 0 changer transitions 550/550 dead transitions. [2023-11-29 01:10:43,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 550 transitions, 1398 flow [2023-11-29 01:10:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:10:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1891 transitions. [2023-11-29 01:10:43,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9536056480080686 [2023-11-29 01:10:43,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1891 transitions. [2023-11-29 01:10:43,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1891 transitions. [2023-11-29 01:10:43,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:43,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1891 transitions. [2023-11-29 01:10:43,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 630.3333333333334) internal successors, (1891), 3 states have internal predecessors, (1891), 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-29 01:10:43,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:43,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 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-29 01:10:43,482 INFO L175 Difference]: Start difference. First operand has 594 places, 549 transitions, 1370 flow. Second operand 3 states and 1891 transitions. [2023-11-29 01:10:43,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 550 transitions, 1398 flow [2023-11-29 01:10:43,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 550 transitions, 1340 flow, removed 8 selfloop flow, removed 17 redundant places. [2023-11-29 01:10:43,488 INFO L231 Difference]: Finished difference. Result has 571 places, 0 transitions, 0 flow [2023-11-29 01:10:43,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=571, PETRI_TRANSITIONS=0} [2023-11-29 01:10:43,489 INFO L281 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2023-11-29 01:10:43,489 INFO L495 AbstractCegarLoop]: Abstraction has has 571 places, 0 transitions, 0 flow [2023-11-29 01:10:43,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-29 01:10:43,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (106 of 107 remaining) [2023-11-29 01:10:43,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (105 of 107 remaining) [2023-11-29 01:10:43,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (104 of 107 remaining) [2023-11-29 01:10:43,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (103 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (102 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (101 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (100 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (99 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (98 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (97 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (96 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (95 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (94 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (93 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (92 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (91 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (90 of 107 remaining) [2023-11-29 01:10:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (89 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (88 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (87 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (86 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (85 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (84 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (83 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (82 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (81 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (80 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (79 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (78 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (77 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (76 of 107 remaining) [2023-11-29 01:10:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (75 of 107 remaining) [2023-11-29 01:10:43,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (74 of 107 remaining) [2023-11-29 01:10:43,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (73 of 107 remaining) [2023-11-29 01:10:43,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (72 of 107 remaining) [2023-11-29 01:10:43,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (71 of 107 remaining) [2023-11-29 01:10:43,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (70 of 107 remaining) [2023-11-29 01:10:43,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (69 of 107 remaining) [2023-11-29 01:10:43,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (68 of 107 remaining) [2023-11-29 01:10:43,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (67 of 107 remaining) [2023-11-29 01:10:43,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (66 of 107 remaining) [2023-11-29 01:10:43,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (65 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (64 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (63 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (62 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (61 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (60 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (59 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (58 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (57 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (56 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (55 of 107 remaining) [2023-11-29 01:10:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (54 of 107 remaining) [2023-11-29 01:10:43,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (53 of 107 remaining) [2023-11-29 01:10:43,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (52 of 107 remaining) [2023-11-29 01:10:43,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (51 of 107 remaining) [2023-11-29 01:10:43,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (50 of 107 remaining) [2023-11-29 01:10:43,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (49 of 107 remaining) [2023-11-29 01:10:43,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (48 of 107 remaining) [2023-11-29 01:10:43,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (47 of 107 remaining) [2023-11-29 01:10:43,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (46 of 107 remaining) [2023-11-29 01:10:43,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (45 of 107 remaining) [2023-11-29 01:10:43,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 107 remaining) [2023-11-29 01:10:43,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 107 remaining) [2023-11-29 01:10:43,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 107 remaining) [2023-11-29 01:10:43,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 107 remaining) [2023-11-29 01:10:43,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 107 remaining) [2023-11-29 01:10:43,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 107 remaining) [2023-11-29 01:10:43,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 107 remaining) [2023-11-29 01:10:43,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 107 remaining) [2023-11-29 01:10:43,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 107 remaining) [2023-11-29 01:10:43,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 107 remaining) [2023-11-29 01:10:43,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 107 remaining) [2023-11-29 01:10:43,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 107 remaining) [2023-11-29 01:10:43,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 107 remaining) [2023-11-29 01:10:43,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 107 remaining) [2023-11-29 01:10:43,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 107 remaining) [2023-11-29 01:10:43,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 107 remaining) [2023-11-29 01:10:43,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 107 remaining) [2023-11-29 01:10:43,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 107 remaining) [2023-11-29 01:10:43,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 107 remaining) [2023-11-29 01:10:43,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (25 of 107 remaining) [2023-11-29 01:10:43,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 107 remaining) [2023-11-29 01:10:43,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 107 remaining) [2023-11-29 01:10:43,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 107 remaining) [2023-11-29 01:10:43,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 107 remaining) [2023-11-29 01:10:43,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 107 remaining) [2023-11-29 01:10:43,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 107 remaining) [2023-11-29 01:10:43,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 107 remaining) [2023-11-29 01:10:43,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 107 remaining) [2023-11-29 01:10:43,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (16 of 107 remaining) [2023-11-29 01:10:43,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (15 of 107 remaining) [2023-11-29 01:10:43,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (14 of 107 remaining) [2023-11-29 01:10:43,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 107 remaining) [2023-11-29 01:10:43,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 107 remaining) [2023-11-29 01:10:43,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 107 remaining) [2023-11-29 01:10:43,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 107 remaining) [2023-11-29 01:10:43,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 107 remaining) [2023-11-29 01:10:43,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 107 remaining) [2023-11-29 01:10:43,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 107 remaining) [2023-11-29 01:10:43,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 107 remaining) [2023-11-29 01:10:43,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 107 remaining) [2023-11-29 01:10:43,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 107 remaining) [2023-11-29 01:10:43,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (3 of 107 remaining) [2023-11-29 01:10:43,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (2 of 107 remaining) [2023-11-29 01:10:43,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (1 of 107 remaining) [2023-11-29 01:10:43,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (0 of 107 remaining) [2023-11-29 01:10:43,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 01:10:43,502 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:43,507 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 01:10:43,508 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:10:43,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:10:43 BasicIcfg [2023-11-29 01:10:43,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:10:43,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:10:43,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:10:43,513 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:10:43,513 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:08:45" (3/4) ... [2023-11-29 01:10:43,515 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 01:10:43,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-29 01:10:43,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-29 01:10:43,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-29 01:10:43,527 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2023-11-29 01:10:43,528 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 01:10:43,529 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 01:10:43,530 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 01:10:43,617 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:10:43,618 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 01:10:43,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:10:43,619 INFO L158 Benchmark]: Toolchain (without parser) took 119806.74ms. Allocated memory was 130.0MB in the beginning and 11.8GB in the end (delta: 11.7GB). Free memory was 92.3MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 6.9GB. Max. memory is 16.1GB. [2023-11-29 01:10:43,619 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:10:43,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.67ms. Allocated memory is still 130.0MB. Free memory was 91.9MB in the beginning and 78.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:10:43,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.67ms. Allocated memory is still 130.0MB. Free memory was 78.4MB in the beginning and 73.9MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 01:10:43,620 INFO L158 Benchmark]: Boogie Preprocessor took 82.09ms. Allocated memory is still 130.0MB. Free memory was 73.9MB in the beginning and 69.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:10:43,621 INFO L158 Benchmark]: RCFGBuilder took 1186.34ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 69.7MB in the beginning and 114.4MB in the end (delta: -44.7MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2023-11-29 01:10:43,621 INFO L158 Benchmark]: TraceAbstraction took 118017.89ms. Allocated memory was 169.9MB in the beginning and 11.8GB in the end (delta: 11.6GB). Free memory was 114.4MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 6.8GB. Max. memory is 16.1GB. [2023-11-29 01:10:43,622 INFO L158 Benchmark]: Witness Printer took 105.57ms. Allocated memory is still 11.8GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 01:10:43,624 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.67ms. Allocated memory is still 130.0MB. Free memory was 91.9MB in the beginning and 78.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.67ms. Allocated memory is still 130.0MB. Free memory was 78.4MB in the beginning and 73.9MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.09ms. Allocated memory is still 130.0MB. Free memory was 73.9MB in the beginning and 69.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1186.34ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 69.7MB in the beginning and 114.4MB in the end (delta: -44.7MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * TraceAbstraction took 118017.89ms. Allocated memory was 169.9MB in the beginning and 11.8GB in the end (delta: 11.6GB). Free memory was 114.4MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 6.8GB. Max. memory is 16.1GB. * Witness Printer took 105.57ms. Allocated memory is still 11.8GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 962 locations, 107 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 117.7s, OverallIterations: 40, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 107.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8170 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4940 mSDsluCounter, 7551 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6510 mSDsCounter, 2284 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13099 IncrementalHoareTripleChecker+Invalid, 15383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2284 mSolverCounterUnsat, 1041 mSDtfsCounter, 13099 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1790occurred in iteration=26, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 6957 NumberOfCodeBlocks, 6957 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 6917 ConstructedInterpolants, 0 QuantifiedInterpolants, 9476 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 62 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 01:10:43,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_863a6514-2a59-4c99-a03e-d15fee795b00/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE