./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i --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_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/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_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/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_e0b7086b-cb57-4673-92b1-91a6e11daa8b/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 e58f19518df0581d95f13f906b8c44b8c282310d0c51162e45cefa58addde8de --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:28:25,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:28:25,232 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 00:28:25,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:28:25,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:28:25,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:28:25,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:28:25,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:28:25,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:28:25,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:28:25,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:28:25,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:28:25,265 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:28:25,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:28:25,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:28:25,266 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:28:25,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:28:25,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:28:25,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:28:25,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:28:25,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:28:25,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:28:25,270 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 00:28:25,270 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:28:25,271 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:28:25,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:28:25,271 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:28:25,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:28:25,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:28:25,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:28:25,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:28:25,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:28:25,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:28:25,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:28:25,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:28:25,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:28:25,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:28:25,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:28:25,285 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:28:25,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:28:25,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:28:25,286 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_e0b7086b-cb57-4673-92b1-91a6e11daa8b/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_e0b7086b-cb57-4673-92b1-91a6e11daa8b/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 -> e58f19518df0581d95f13f906b8c44b8c282310d0c51162e45cefa58addde8de [2023-11-29 00:28:25,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:28:25,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:28:25,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:28:25,567 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:28:25,568 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:28:25,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i [2023-11-29 00:28:28,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:28:28,565 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:28:28,565 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i [2023-11-29 00:28:28,582 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/data/fad9d9288/4d41d3efdb1a43c18228c138cc0d1b61/FLAG93ce88a00 [2023-11-29 00:28:28,604 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/data/fad9d9288/4d41d3efdb1a43c18228c138cc0d1b61 [2023-11-29 00:28:28,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:28:28,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:28:28,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:28:28,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:28:28,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:28:28,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:28:28" (1/1) ... [2023-11-29 00:28:28,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af00f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:28, skipping insertion in model container [2023-11-29 00:28:28,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:28:28" (1/1) ... [2023-11-29 00:28:28,664 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:28:29,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:28:29,058 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:28:29,098 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:28:29,146 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:28:29,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29 WrapperNode [2023-11-29 00:28:29,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:28:29,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:28:29,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:28:29,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:28:29,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,194 INFO L138 Inliner]: procedures = 267, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86 [2023-11-29 00:28:29,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:28:29,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:28:29,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:28:29,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:28:29,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:28:29,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:28:29,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:28:29,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:28:29,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (1/1) ... [2023-11-29 00:28:29,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:28:29,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:28:29,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:28:29,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:28:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 00:28:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:28:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 00:28:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 00:28:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 00:28:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 00:28:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:28:29,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:28:29,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-29 00:28:29,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 00:28:29,297 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-29 00:28:29,297 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-29 00:28:29,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:28:29,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:28:29,299 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 00:28:29,453 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:28:29,454 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:28:29,660 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:28:29,677 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:28:29,677 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:28:29,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:28:29 BoogieIcfgContainer [2023-11-29 00:28:29,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:28:29,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:28:29,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:28:29,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:28:29,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:28:28" (1/3) ... [2023-11-29 00:28:29,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a47ee13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:28:29, skipping insertion in model container [2023-11-29 00:28:29,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:28:29" (2/3) ... [2023-11-29 00:28:29,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a47ee13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:28:29, skipping insertion in model container [2023-11-29 00:28:29,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:28:29" (3/3) ... [2023-11-29 00:28:29,686 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid-join.i [2023-11-29 00:28:29,692 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:28:29,699 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:28:29,699 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-29 00:28:29,699 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:28:29,745 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 00:28:29,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 112 transitions, 231 flow [2023-11-29 00:28:29,823 INFO L124 PetriNetUnfolderBase]: 6/158 cut-off events. [2023-11-29 00:28:29,824 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 00:28:29,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 246 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. [2023-11-29 00:28:29,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 112 transitions, 231 flow [2023-11-29 00:28:29,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 112 transitions, 231 flow [2023-11-29 00:28:29,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:28:29,851 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;@18824877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:28:29,851 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 00:28:29,863 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:28:29,863 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2023-11-29 00:28:29,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:28:29,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:29,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] [2023-11-29 00:28:29,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:28:29,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:29,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2036400819, now seen corresponding path program 1 times [2023-11-29 00:28:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:29,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4221001] [2023-11-29 00:28:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:30,109 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 00:28:30,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4221001] [2023-11-29 00:28:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4221001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:30,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:30,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:28:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329829220] [2023-11-29 00:28:30,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:30,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:30,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:30,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:30,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 112 [2023-11-29 00:28:30,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states 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 00:28:30,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:30,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 112 [2023-11-29 00:28:30,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:30,241 INFO L124 PetriNetUnfolderBase]: 8/196 cut-off events. [2023-11-29 00:28:30,241 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2023-11-29 00:28:30,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 196 events. 8/196 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 489 event pairs, 1 based on Foata normal form. 9/185 useless extension candidates. Maximal degree in co-relation 133. Up to 16 conditions per place. [2023-11-29 00:28:30,244 INFO L140 encePairwiseOnDemand]: 105/112 looper letters, 8 selfloop transitions, 3 changer transitions 2/113 dead transitions. [2023-11-29 00:28:30,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 257 flow [2023-11-29 00:28:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-11-29 00:28:30,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9494047619047619 [2023-11-29 00:28:30,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-11-29 00:28:30,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-11-29 00:28:30,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:30,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-11-29 00:28:30,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states 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 00:28:30,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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 00:28:30,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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 00:28:30,274 INFO L175 Difference]: Start difference. First operand has 111 places, 112 transitions, 231 flow. Second operand 3 states and 319 transitions. [2023-11-29 00:28:30,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 257 flow [2023-11-29 00:28:30,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:28:30,283 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 245 flow [2023-11-29 00:28:30,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2023-11-29 00:28:30,288 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places. [2023-11-29 00:28:30,289 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 245 flow [2023-11-29 00:28:30,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states 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 00:28:30,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:30,289 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] [2023-11-29 00:28:30,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:28:30,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:28:30,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:30,291 INFO L85 PathProgramCache]: Analyzing trace with hash 572753100, now seen corresponding path program 1 times [2023-11-29 00:28:30,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:30,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126480347] [2023-11-29 00:28:30,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:30,481 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 00:28:30,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:30,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126480347] [2023-11-29 00:28:30,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126480347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:30,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:30,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:30,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463863171] [2023-11-29 00:28:30,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:30,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:28:30,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:30,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:28:30,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:28:30,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 112 [2023-11-29 00:28:30,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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 00:28:30,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:30,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 112 [2023-11-29 00:28:30,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:30,716 INFO L124 PetriNetUnfolderBase]: 17/278 cut-off events. [2023-11-29 00:28:30,716 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 00:28:30,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 278 events. 17/278 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 944 event pairs, 7 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 266. Up to 49 conditions per place. [2023-11-29 00:28:30,719 INFO L140 encePairwiseOnDemand]: 104/112 looper letters, 15 selfloop transitions, 2 changer transitions 5/117 dead transitions. [2023-11-29 00:28:30,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 303 flow [2023-11-29 00:28:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions. [2023-11-29 00:28:30,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8735119047619048 [2023-11-29 00:28:30,723 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 587 transitions. [2023-11-29 00:28:30,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 587 transitions. [2023-11-29 00:28:30,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:30,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 587 transitions. [2023-11-29 00:28:30,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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 00:28:30,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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 00:28:30,731 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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 00:28:30,731 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 245 flow. Second operand 6 states and 587 transitions. [2023-11-29 00:28:30,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 303 flow [2023-11-29 00:28:30,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:28:30,735 INFO L231 Difference]: Finished difference. Result has 121 places, 110 transitions, 257 flow [2023-11-29 00:28:30,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=121, PETRI_TRANSITIONS=110} [2023-11-29 00:28:30,736 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2023-11-29 00:28:30,737 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 110 transitions, 257 flow [2023-11-29 00:28:30,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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 00:28:30,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:30,737 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] [2023-11-29 00:28:30,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:28:30,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:28:30,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash -469521541, now seen corresponding path program 1 times [2023-11-29 00:28:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114628313] [2023-11-29 00:28:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:31,182 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 00:28:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114628313] [2023-11-29 00:28:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114628313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:31,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:31,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207367748] [2023-11-29 00:28:31,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:31,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:28:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:31,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:28:31,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:31,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 112 [2023-11-29 00:28:31,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 110 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states 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 00:28:31,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:31,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 112 [2023-11-29 00:28:31,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:31,495 INFO L124 PetriNetUnfolderBase]: 38/336 cut-off events. [2023-11-29 00:28:31,495 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-29 00:28:31,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 336 events. 38/336 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1449 event pairs, 27 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 411. Up to 93 conditions per place. [2023-11-29 00:28:31,498 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 32 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2023-11-29 00:28:31,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 117 transitions, 345 flow [2023-11-29 00:28:31,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 512 transitions. [2023-11-29 00:28:31,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2023-11-29 00:28:31,501 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 512 transitions. [2023-11-29 00:28:31,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 512 transitions. [2023-11-29 00:28:31,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:31,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 512 transitions. [2023-11-29 00:28:31,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 00:28:31,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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 00:28:31,507 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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 00:28:31,507 INFO L175 Difference]: Start difference. First operand has 121 places, 110 transitions, 257 flow. Second operand 6 states and 512 transitions. [2023-11-29 00:28:31,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 117 transitions, 345 flow [2023-11-29 00:28:31,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 331 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-29 00:28:31,512 INFO L231 Difference]: Finished difference. Result has 117 places, 109 transitions, 251 flow [2023-11-29 00:28:31,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=117, PETRI_TRANSITIONS=109} [2023-11-29 00:28:31,514 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places. [2023-11-29 00:28:31,514 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 251 flow [2023-11-29 00:28:31,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states 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 00:28:31,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:31,515 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] [2023-11-29 00:28:31,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:28:31,515 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:28:31,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:31,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1114355439, now seen corresponding path program 1 times [2023-11-29 00:28:31,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:31,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031900948] [2023-11-29 00:28:31,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:31,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:31,570 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 00:28:31,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:31,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031900948] [2023-11-29 00:28:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031900948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:31,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:31,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:28:31,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003598968] [2023-11-29 00:28:31,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:31,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:31,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:31,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:31,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:31,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 112 [2023-11-29 00:28:31,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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 00:28:31,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:31,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 112 [2023-11-29 00:28:31,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:31,640 INFO L124 PetriNetUnfolderBase]: 5/204 cut-off events. [2023-11-29 00:28:31,640 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2023-11-29 00:28:31,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 204 events. 5/204 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 548 event pairs, 3 based on Foata normal form. 1/191 useless extension candidates. Maximal degree in co-relation 211. Up to 25 conditions per place. [2023-11-29 00:28:31,642 INFO L140 encePairwiseOnDemand]: 107/112 looper letters, 8 selfloop transitions, 4 changer transitions 3/112 dead transitions. [2023-11-29 00:28:31,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 287 flow [2023-11-29 00:28:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-29 00:28:31,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9255952380952381 [2023-11-29 00:28:31,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-29 00:28:31,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-29 00:28:31,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:31,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-29 00:28:31,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 00:28:31,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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 00:28:31,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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 00:28:31,647 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 251 flow. Second operand 3 states and 311 transitions. [2023-11-29 00:28:31,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 287 flow [2023-11-29 00:28:31,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 277 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:28:31,652 INFO L231 Difference]: Finished difference. Result has 116 places, 109 transitions, 263 flow [2023-11-29 00:28:31,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=116, PETRI_TRANSITIONS=109} [2023-11-29 00:28:31,653 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2023-11-29 00:28:31,653 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 263 flow [2023-11-29 00:28:31,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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 00:28:31,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:31,654 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] [2023-11-29 00:28:31,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:28:31,654 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:28:31,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2010647167, now seen corresponding path program 1 times [2023-11-29 00:28:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:31,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270448333] [2023-11-29 00:28:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:32,138 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 00:28:32,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:32,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270448333] [2023-11-29 00:28:32,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270448333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:32,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:32,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:32,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348023071] [2023-11-29 00:28:32,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:32,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:28:32,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:32,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:28:32,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:32,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 112 [2023-11-29 00:28:32,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 109 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:28:32,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:32,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 112 [2023-11-29 00:28:32,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:32,409 INFO L124 PetriNetUnfolderBase]: 25/328 cut-off events. [2023-11-29 00:28:32,410 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2023-11-29 00:28:32,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 328 events. 25/328 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1388 event pairs, 15 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 395. Up to 55 conditions per place. [2023-11-29 00:28:32,412 INFO L140 encePairwiseOnDemand]: 105/112 looper letters, 27 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2023-11-29 00:28:32,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 339 flow [2023-11-29 00:28:32,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2023-11-29 00:28:32,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2023-11-29 00:28:32,415 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 532 transitions. [2023-11-29 00:28:32,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 532 transitions. [2023-11-29 00:28:32,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:32,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 532 transitions. [2023-11-29 00:28:32,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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 00:28:32,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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 00:28:32,421 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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 00:28:32,421 INFO L175 Difference]: Start difference. First operand has 116 places, 109 transitions, 263 flow. Second operand 6 states and 532 transitions. [2023-11-29 00:28:32,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 339 flow [2023-11-29 00:28:32,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 115 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:28:32,425 INFO L231 Difference]: Finished difference. Result has 117 places, 107 transitions, 261 flow [2023-11-29 00:28:32,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=117, PETRI_TRANSITIONS=107} [2023-11-29 00:28:32,426 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places. [2023-11-29 00:28:32,426 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 261 flow [2023-11-29 00:28:32,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:28:32,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:32,427 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:28:32,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:28:32,428 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:28:32,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash -962500121, now seen corresponding path program 1 times [2023-11-29 00:28:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836484002] [2023-11-29 00:28:32,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:32,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:28:32,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:28:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:28:32,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:28:32,505 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:28:32,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2023-11-29 00:28:32,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2023-11-29 00:28:32,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2023-11-29 00:28:32,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2023-11-29 00:28:32,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2023-11-29 00:28:32,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2023-11-29 00:28:32,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2023-11-29 00:28:32,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2023-11-29 00:28:32,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:28:32,509 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-29 00:28:32,511 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:28:32,511 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 00:28:32,533 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 00:28:32,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 130 transitions, 276 flow [2023-11-29 00:28:32,561 INFO L124 PetriNetUnfolderBase]: 11/283 cut-off events. [2023-11-29 00:28:32,561 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 00:28:32,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 283 events. 11/283 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 557 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. [2023-11-29 00:28:32,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 130 transitions, 276 flow [2023-11-29 00:28:32,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 130 transitions, 276 flow [2023-11-29 00:28:32,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:28:32,566 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;@18824877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:28:32,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-29 00:28:32,570 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:28:32,570 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2023-11-29 00:28:32,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:28:32,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:32,570 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 00:28:32,571 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:28:32,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1717595763, now seen corresponding path program 1 times [2023-11-29 00:28:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:32,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621759603] [2023-11-29 00:28:32,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:32,593 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 00:28:32,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:32,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621759603] [2023-11-29 00:28:32,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621759603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:32,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:32,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:28:32,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48603778] [2023-11-29 00:28:32,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:32,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:32,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:32,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:32,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 130 [2023-11-29 00:28:32,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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 00:28:32,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:32,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 130 [2023-11-29 00:28:32,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:32,751 INFO L124 PetriNetUnfolderBase]: 119/853 cut-off events. [2023-11-29 00:28:32,751 INFO L125 PetriNetUnfolderBase]: For 56/99 co-relation queries the response was YES. [2023-11-29 00:28:32,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 853 events. 119/853 cut-off events. For 56/99 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4788 event pairs, 50 based on Foata normal form. 39/792 useless extension candidates. Maximal degree in co-relation 828. Up to 139 conditions per place. [2023-11-29 00:28:32,757 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 16 selfloop transitions, 4 changer transitions 1/134 dead transitions. [2023-11-29 00:28:32,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 134 transitions, 324 flow [2023-11-29 00:28:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-11-29 00:28:32,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2023-11-29 00:28:32,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-11-29 00:28:32,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-11-29 00:28:32,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:32,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-11-29 00:28:32,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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 00:28:32,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 00:28:32,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 00:28:32,763 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 276 flow. Second operand 3 states and 366 transitions. [2023-11-29 00:28:32,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 134 transitions, 324 flow [2023-11-29 00:28:32,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 134 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:28:32,766 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 298 flow [2023-11-29 00:28:32,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2023-11-29 00:28:32,767 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, 4 predicate places. [2023-11-29 00:28:32,768 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 298 flow [2023-11-29 00:28:32,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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 00:28:32,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:32,768 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] [2023-11-29 00:28:32,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:28:32,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:28:32,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2001738060, now seen corresponding path program 1 times [2023-11-29 00:28:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:32,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971317023] [2023-11-29 00:28:32,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:32,839 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 00:28:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:32,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971317023] [2023-11-29 00:28:32,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971317023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:32,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:32,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:32,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762042533] [2023-11-29 00:28:32,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:32,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:28:32,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:32,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:28:32,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:28:32,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 130 [2023-11-29 00:28:32,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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 00:28:32,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:32,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 130 [2023-11-29 00:28:32,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:33,141 INFO L124 PetriNetUnfolderBase]: 189/1333 cut-off events. [2023-11-29 00:28:33,141 INFO L125 PetriNetUnfolderBase]: For 72/73 co-relation queries the response was YES. [2023-11-29 00:28:33,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 1333 events. 189/1333 cut-off events. For 72/73 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9335 event pairs, 131 based on Foata normal form. 1/1218 useless extension candidates. Maximal degree in co-relation 1232. Up to 314 conditions per place. [2023-11-29 00:28:33,179 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 20 selfloop transitions, 2 changer transitions 5/137 dead transitions. [2023-11-29 00:28:33,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 137 transitions, 368 flow [2023-11-29 00:28:33,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 676 transitions. [2023-11-29 00:28:33,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2023-11-29 00:28:33,183 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 676 transitions. [2023-11-29 00:28:33,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 676 transitions. [2023-11-29 00:28:33,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:33,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 676 transitions. [2023-11-29 00:28:33,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states 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 00:28:33,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states 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 00:28:33,188 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states 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 00:28:33,188 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 298 flow. Second operand 6 states and 676 transitions. [2023-11-29 00:28:33,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 137 transitions, 368 flow [2023-11-29 00:28:33,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 137 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:28:33,192 INFO L231 Difference]: Finished difference. Result has 140 places, 130 transitions, 312 flow [2023-11-29 00:28:33,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=140, PETRI_TRANSITIONS=130} [2023-11-29 00:28:33,193 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, 10 predicate places. [2023-11-29 00:28:33,193 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 130 transitions, 312 flow [2023-11-29 00:28:33,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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 00:28:33,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:33,194 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] [2023-11-29 00:28:33,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:28:33,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:28:33,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:33,195 INFO L85 PathProgramCache]: Analyzing trace with hash 879339389, now seen corresponding path program 1 times [2023-11-29 00:28:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013982950] [2023-11-29 00:28:33,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:33,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:33,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 00:28:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:33,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013982950] [2023-11-29 00:28:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013982950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:33,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:33,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774218418] [2023-11-29 00:28:33,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:33,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:28:33,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:33,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:28:33,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:33,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 130 [2023-11-29 00:28:33,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 130 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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 00:28:33,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:33,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 130 [2023-11-29 00:28:33,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:33,884 INFO L124 PetriNetUnfolderBase]: 384/2007 cut-off events. [2023-11-29 00:28:33,884 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-11-29 00:28:33,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2972 conditions, 2007 events. 384/2007 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 16060 event pairs, 278 based on Foata normal form. 0/1782 useless extension candidates. Maximal degree in co-relation 2873. Up to 545 conditions per place. [2023-11-29 00:28:33,895 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 45 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2023-11-29 00:28:33,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 145 transitions, 442 flow [2023-11-29 00:28:33,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 608 transitions. [2023-11-29 00:28:33,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7794871794871795 [2023-11-29 00:28:33,897 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 608 transitions. [2023-11-29 00:28:33,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 608 transitions. [2023-11-29 00:28:33,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:33,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 608 transitions. [2023-11-29 00:28:33,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states 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 00:28:33,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states 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 00:28:33,901 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states 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 00:28:33,901 INFO L175 Difference]: Start difference. First operand has 140 places, 130 transitions, 312 flow. Second operand 6 states and 608 transitions. [2023-11-29 00:28:33,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 145 transitions, 442 flow [2023-11-29 00:28:33,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 145 transitions, 430 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 00:28:33,905 INFO L231 Difference]: Finished difference. Result has 137 places, 129 transitions, 308 flow [2023-11-29 00:28:33,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=137, PETRI_TRANSITIONS=129} [2023-11-29 00:28:33,906 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, 7 predicate places. [2023-11-29 00:28:33,906 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 129 transitions, 308 flow [2023-11-29 00:28:33,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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 00:28:33,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:33,907 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] [2023-11-29 00:28:33,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:28:33,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:28:33,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:33,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1560102111, now seen corresponding path program 1 times [2023-11-29 00:28:33,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:33,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768229856] [2023-11-29 00:28:33,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:33,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:33,945 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 00:28:33,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:33,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768229856] [2023-11-29 00:28:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768229856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:33,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:33,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:28:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247674646] [2023-11-29 00:28:33,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:33,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:33,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:33,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:33,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2023-11-29 00:28:33,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 129 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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 00:28:33,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:33,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2023-11-29 00:28:33,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:34,101 INFO L124 PetriNetUnfolderBase]: 172/1259 cut-off events. [2023-11-29 00:28:34,102 INFO L125 PetriNetUnfolderBase]: For 205/366 co-relation queries the response was YES. [2023-11-29 00:28:34,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1259 events. 172/1259 cut-off events. For 205/366 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8893 event pairs, 75 based on Foata normal form. 4/1103 useless extension candidates. Maximal degree in co-relation 1561. Up to 270 conditions per place. [2023-11-29 00:28:34,108 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 19 selfloop transitions, 7 changer transitions 0/138 dead transitions. [2023-11-29 00:28:34,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 138 transitions, 392 flow [2023-11-29 00:28:34,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-11-29 00:28:34,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2023-11-29 00:28:34,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-11-29 00:28:34,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-11-29 00:28:34,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:34,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-11-29 00:28:34,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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 00:28:34,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 00:28:34,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 00:28:34,112 INFO L175 Difference]: Start difference. First operand has 137 places, 129 transitions, 308 flow. Second operand 3 states and 360 transitions. [2023-11-29 00:28:34,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 138 transitions, 392 flow [2023-11-29 00:28:34,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 138 transitions, 382 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:28:34,128 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 354 flow [2023-11-29 00:28:34,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2023-11-29 00:28:34,129 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2023-11-29 00:28:34,129 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 354 flow [2023-11-29 00:28:34,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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 00:28:34,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:34,130 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] [2023-11-29 00:28:34,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:28:34,130 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:28:34,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1365340941, now seen corresponding path program 1 times [2023-11-29 00:28:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416903825] [2023-11-29 00:28:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:34,387 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 00:28:34,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:34,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416903825] [2023-11-29 00:28:34,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416903825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:34,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:34,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:34,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884435712] [2023-11-29 00:28:34,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:34,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:28:34,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:34,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:28:34,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:34,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2023-11-29 00:28:34,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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 00:28:34,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:34,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2023-11-29 00:28:34,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:34,861 INFO L124 PetriNetUnfolderBase]: 383/2112 cut-off events. [2023-11-29 00:28:34,861 INFO L125 PetriNetUnfolderBase]: For 320/357 co-relation queries the response was YES. [2023-11-29 00:28:34,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 2112 events. 383/2112 cut-off events. For 320/357 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 17530 event pairs, 180 based on Foata normal form. 3/1933 useless extension candidates. Maximal degree in co-relation 2625. Up to 362 conditions per place. [2023-11-29 00:28:34,872 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 39 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2023-11-29 00:28:34,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 148 transitions, 470 flow [2023-11-29 00:28:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2023-11-29 00:28:34,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8051282051282052 [2023-11-29 00:28:34,875 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 628 transitions. [2023-11-29 00:28:34,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 628 transitions. [2023-11-29 00:28:34,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:34,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 628 transitions. [2023-11-29 00:28:34,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states 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 00:28:34,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states 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 00:28:34,879 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states 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 00:28:34,879 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 354 flow. Second operand 6 states and 628 transitions. [2023-11-29 00:28:34,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 148 transitions, 470 flow [2023-11-29 00:28:34,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 148 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:28:34,883 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 346 flow [2023-11-29 00:28:34,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2023-11-29 00:28:34,884 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, 7 predicate places. [2023-11-29 00:28:34,884 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 346 flow [2023-11-29 00:28:34,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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 00:28:34,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:34,885 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] [2023-11-29 00:28:34,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:28:34,885 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:28:34,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:34,886 INFO L85 PathProgramCache]: Analyzing trace with hash -560770901, now seen corresponding path program 1 times [2023-11-29 00:28:34,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:34,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822228436] [2023-11-29 00:28:34,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:34,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:28:34,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822228436] [2023-11-29 00:28:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822228436] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:28:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869189884] [2023-11-29 00:28:34,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:34,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:28:34,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:28:34,982 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:28:34,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:28:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:35,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:28:35,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:28:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:28:35,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:28:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:28:35,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869189884] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:28:35,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:28:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 00:28:35,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57942502] [2023-11-29 00:28:35,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:28:35,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:28:35,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:35,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:28:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:28:35,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 130 [2023-11-29 00:28:35,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 346 flow. Second operand has 9 states, 9 states have (on average 108.22222222222223) internal successors, (974), 9 states have internal predecessors, (974), 0 states have call successors, (0), 0 states 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 00:28:35,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:35,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 130 [2023-11-29 00:28:35,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:35,711 INFO L124 PetriNetUnfolderBase]: 159/1312 cut-off events. [2023-11-29 00:28:35,711 INFO L125 PetriNetUnfolderBase]: For 133/156 co-relation queries the response was YES. [2023-11-29 00:28:35,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 1312 events. 159/1312 cut-off events. For 133/156 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8777 event pairs, 50 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 983. Up to 159 conditions per place. [2023-11-29 00:28:35,718 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 32 selfloop transitions, 10 changer transitions 3/154 dead transitions. [2023-11-29 00:28:35,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 154 transitions, 484 flow [2023-11-29 00:28:35,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:28:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:28:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 894 transitions. [2023-11-29 00:28:35,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8596153846153847 [2023-11-29 00:28:35,721 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 894 transitions. [2023-11-29 00:28:35,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 894 transitions. [2023-11-29 00:28:35,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:35,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 894 transitions. [2023-11-29 00:28:35,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 00:28:35,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 130.0) internal successors, (1170), 9 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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 00:28:35,726 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 130.0) internal successors, (1170), 9 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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 00:28:35,726 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 346 flow. Second operand 8 states and 894 transitions. [2023-11-29 00:28:35,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 154 transitions, 484 flow [2023-11-29 00:28:35,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 154 transitions, 472 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:28:35,730 INFO L231 Difference]: Finished difference. Result has 142 places, 134 transitions, 374 flow [2023-11-29 00:28:35,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=374, PETRI_PLACES=142, PETRI_TRANSITIONS=134} [2023-11-29 00:28:35,731 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places. [2023-11-29 00:28:35,731 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 134 transitions, 374 flow [2023-11-29 00:28:35,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.22222222222223) internal successors, (974), 9 states have internal predecessors, (974), 0 states have call successors, (0), 0 states 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 00:28:35,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:35,732 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] [2023-11-29 00:28:35,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:28:35,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 00:28:35,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:28:35,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:35,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1504167249, now seen corresponding path program 1 times [2023-11-29 00:28:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:35,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903212225] [2023-11-29 00:28:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:36,302 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 00:28:36,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:36,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903212225] [2023-11-29 00:28:36,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903212225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:36,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:36,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696406666] [2023-11-29 00:28:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:36,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:28:36,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:36,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:28:36,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:36,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130 [2023-11-29 00:28:36,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 134 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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 00:28:36,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:36,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130 [2023-11-29 00:28:36,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:36,743 INFO L124 PetriNetUnfolderBase]: 249/1397 cut-off events. [2023-11-29 00:28:36,743 INFO L125 PetriNetUnfolderBase]: For 119/142 co-relation queries the response was YES. [2023-11-29 00:28:36,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 1397 events. 249/1397 cut-off events. For 119/142 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 9914 event pairs, 114 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 1598. Up to 236 conditions per place. [2023-11-29 00:28:36,752 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 32 selfloop transitions, 5 changer transitions 1/149 dead transitions. [2023-11-29 00:28:36,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 149 transitions, 478 flow [2023-11-29 00:28:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2023-11-29 00:28:36,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8564102564102564 [2023-11-29 00:28:36,756 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 668 transitions. [2023-11-29 00:28:36,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions. [2023-11-29 00:28:36,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:36,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions. [2023-11-29 00:28:36,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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 00:28:36,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states 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 00:28:36,761 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states 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 00:28:36,761 INFO L175 Difference]: Start difference. First operand has 142 places, 134 transitions, 374 flow. Second operand 6 states and 668 transitions. [2023-11-29 00:28:36,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 149 transitions, 478 flow [2023-11-29 00:28:36,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 149 transitions, 472 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:28:36,778 INFO L231 Difference]: Finished difference. Result has 143 places, 132 transitions, 371 flow [2023-11-29 00:28:36,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2023-11-29 00:28:36,779 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, 13 predicate places. [2023-11-29 00:28:36,780 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 371 flow [2023-11-29 00:28:36,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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 00:28:36,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:36,781 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:28:36,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:28:36,781 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:28:36,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:36,781 INFO L85 PathProgramCache]: Analyzing trace with hash -200995383, now seen corresponding path program 1 times [2023-11-29 00:28:36,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:36,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196195246] [2023-11-29 00:28:36,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:36,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:28:36,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:36,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196195246] [2023-11-29 00:28:36,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196195246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:36,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:36,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:28:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170318302] [2023-11-29 00:28:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:36,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:36,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:36,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2023-11-29 00:28:36,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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 00:28:36,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:36,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2023-11-29 00:28:36,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:37,031 INFO L124 PetriNetUnfolderBase]: 56/857 cut-off events. [2023-11-29 00:28:37,032 INFO L125 PetriNetUnfolderBase]: For 244/429 co-relation queries the response was YES. [2023-11-29 00:28:37,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 857 events. 56/857 cut-off events. For 244/429 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5302 event pairs, 30 based on Foata normal form. 3/835 useless extension candidates. Maximal degree in co-relation 1184. Up to 119 conditions per place. [2023-11-29 00:28:37,037 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 19 selfloop transitions, 7 changer transitions 1/139 dead transitions. [2023-11-29 00:28:37,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 139 transitions, 448 flow [2023-11-29 00:28:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-11-29 00:28:37,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9205128205128205 [2023-11-29 00:28:37,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-11-29 00:28:37,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-11-29 00:28:37,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:37,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-11-29 00:28:37,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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 00:28:37,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 00:28:37,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 00:28:37,043 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 371 flow. Second operand 3 states and 359 transitions. [2023-11-29 00:28:37,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 139 transitions, 448 flow [2023-11-29 00:28:37,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 139 transitions, 438 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:28:37,048 INFO L231 Difference]: Finished difference. Result has 142 places, 135 transitions, 411 flow [2023-11-29 00:28:37,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=142, PETRI_TRANSITIONS=135} [2023-11-29 00:28:37,048 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places. [2023-11-29 00:28:37,049 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 135 transitions, 411 flow [2023-11-29 00:28:37,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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 00:28:37,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:37,049 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:28:37,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:28:37,050 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:28:37,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1879738797, now seen corresponding path program 1 times [2023-11-29 00:28:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952377760] [2023-11-29 00:28:37,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:28:37,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952377760] [2023-11-29 00:28:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952377760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:37,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:37,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:28:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123677002] [2023-11-29 00:28:37,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:37,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:37,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:37,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:37,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 130 [2023-11-29 00:28:37,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 135 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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 00:28:37,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:37,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 130 [2023-11-29 00:28:37,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:37,258 INFO L124 PetriNetUnfolderBase]: 12/507 cut-off events. [2023-11-29 00:28:37,259 INFO L125 PetriNetUnfolderBase]: For 126/147 co-relation queries the response was YES. [2023-11-29 00:28:37,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 507 events. 12/507 cut-off events. For 126/147 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2214 event pairs, 2 based on Foata normal form. 4/505 useless extension candidates. Maximal degree in co-relation 570. Up to 26 conditions per place. [2023-11-29 00:28:37,261 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 8 selfloop transitions, 4 changer transitions 4/136 dead transitions. [2023-11-29 00:28:37,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 432 flow [2023-11-29 00:28:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-29 00:28:37,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9435897435897436 [2023-11-29 00:28:37,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-29 00:28:37,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-29 00:28:37,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:37,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-29 00:28:37,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states 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 00:28:37,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 00:28:37,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 00:28:37,266 INFO L175 Difference]: Start difference. First operand has 142 places, 135 transitions, 411 flow. Second operand 3 states and 368 transitions. [2023-11-29 00:28:37,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 432 flow [2023-11-29 00:28:37,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 136 transitions, 420 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 00:28:37,271 INFO L231 Difference]: Finished difference. Result has 142 places, 129 transitions, 371 flow [2023-11-29 00:28:37,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=142, PETRI_TRANSITIONS=129} [2023-11-29 00:28:37,272 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, 12 predicate places. [2023-11-29 00:28:37,272 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 129 transitions, 371 flow [2023-11-29 00:28:37,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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 00:28:37,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:37,273 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 00:28:37,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:28:37,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:28:37,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash 711940929, now seen corresponding path program 1 times [2023-11-29 00:28:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588400874] [2023-11-29 00:28:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:28:37,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:28:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:28:37,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:28:37,347 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:28:37,348 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-29 00:28:37,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-11-29 00:28:37,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-11-29 00:28:37,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2023-11-29 00:28:37,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-11-29 00:28:37,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-11-29 00:28:37,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-11-29 00:28:37,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-11-29 00:28:37,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-11-29 00:28:37,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:28:37,349 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:28:37,350 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:28:37,350 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 00:28:37,374 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 00:28:37,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 148 transitions, 323 flow [2023-11-29 00:28:37,443 INFO L124 PetriNetUnfolderBase]: 21/493 cut-off events. [2023-11-29 00:28:37,443 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-29 00:28:37,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 493 events. 21/493 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1300 event pairs, 1 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 291. Up to 16 conditions per place. [2023-11-29 00:28:37,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 148 transitions, 323 flow [2023-11-29 00:28:37,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 148 transitions, 323 flow [2023-11-29 00:28:37,449 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:28:37,449 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;@18824877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:28:37,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-29 00:28:37,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:28:37,453 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2023-11-29 00:28:37,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:28:37,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:37,454 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 00:28:37,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:37,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1354484749, now seen corresponding path program 1 times [2023-11-29 00:28:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:37,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627432977] [2023-11-29 00:28:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:37,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:37,473 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 00:28:37,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627432977] [2023-11-29 00:28:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627432977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:37,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:37,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:28:37,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753664654] [2023-11-29 00:28:37,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:37,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:37,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 148 [2023-11-29 00:28:37,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 00:28:37,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:37,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 148 [2023-11-29 00:28:37,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:38,205 INFO L124 PetriNetUnfolderBase]: 1071/4713 cut-off events. [2023-11-29 00:28:38,205 INFO L125 PetriNetUnfolderBase]: For 439/787 co-relation queries the response was YES. [2023-11-29 00:28:38,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6628 conditions, 4713 events. 1071/4713 cut-off events. For 439/787 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 42438 event pairs, 542 based on Foata normal form. 178/4381 useless extension candidates. Maximal degree in co-relation 5211. Up to 1110 conditions per place. [2023-11-29 00:28:38,244 INFO L140 encePairwiseOnDemand]: 139/148 looper letters, 23 selfloop transitions, 5 changer transitions 1/155 dead transitions. [2023-11-29 00:28:38,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 155 transitions, 393 flow [2023-11-29 00:28:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-11-29 00:28:38,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9301801801801802 [2023-11-29 00:28:38,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-11-29 00:28:38,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-11-29 00:28:38,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:38,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-11-29 00:28:38,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 00:28:38,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:28:38,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:28:38,250 INFO L175 Difference]: Start difference. First operand has 149 places, 148 transitions, 323 flow. Second operand 3 states and 413 transitions. [2023-11-29 00:28:38,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 155 transitions, 393 flow [2023-11-29 00:28:38,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 155 transitions, 393 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:28:38,254 INFO L231 Difference]: Finished difference. Result has 153 places, 148 transitions, 353 flow [2023-11-29 00:28:38,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=153, PETRI_TRANSITIONS=148} [2023-11-29 00:28:38,255 INFO L281 CegarLoopForPetriNet]: 149 programPoint places, 4 predicate places. [2023-11-29 00:28:38,255 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 148 transitions, 353 flow [2023-11-29 00:28:38,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 00:28:38,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:38,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] [2023-11-29 00:28:38,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:28:38,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:38,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash -666384820, now seen corresponding path program 1 times [2023-11-29 00:28:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:38,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813730248] [2023-11-29 00:28:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:38,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:38,311 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 00:28:38,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:38,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813730248] [2023-11-29 00:28:38,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813730248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:38,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:38,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:38,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976571137] [2023-11-29 00:28:38,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:28:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:28:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:28:38,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 148 [2023-11-29 00:28:38,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 148 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 00:28:38,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:38,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 148 [2023-11-29 00:28:38,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:39,208 INFO L124 PetriNetUnfolderBase]: 1326/6647 cut-off events. [2023-11-29 00:28:39,208 INFO L125 PetriNetUnfolderBase]: For 408/416 co-relation queries the response was YES. [2023-11-29 00:28:39,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9469 conditions, 6647 events. 1326/6647 cut-off events. For 408/416 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 65480 event pairs, 760 based on Foata normal form. 1/5867 useless extension candidates. Maximal degree in co-relation 5824. Up to 1720 conditions per place. [2023-11-29 00:28:39,246 INFO L140 encePairwiseOnDemand]: 140/148 looper letters, 24 selfloop transitions, 2 changer transitions 5/156 dead transitions. [2023-11-29 00:28:39,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 431 flow [2023-11-29 00:28:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions. [2023-11-29 00:28:39,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8603603603603603 [2023-11-29 00:28:39,249 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 764 transitions. [2023-11-29 00:28:39,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions. [2023-11-29 00:28:39,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:39,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions. [2023-11-29 00:28:39,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 00:28:39,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states 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 00:28:39,256 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states 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 00:28:39,256 INFO L175 Difference]: Start difference. First operand has 153 places, 148 transitions, 353 flow. Second operand 6 states and 764 transitions. [2023-11-29 00:28:39,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 156 transitions, 431 flow [2023-11-29 00:28:39,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 156 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:28:39,266 INFO L231 Difference]: Finished difference. Result has 159 places, 149 transitions, 365 flow [2023-11-29 00:28:39,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=159, PETRI_TRANSITIONS=149} [2023-11-29 00:28:39,267 INFO L281 CegarLoopForPetriNet]: 149 programPoint places, 10 predicate places. [2023-11-29 00:28:39,267 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 149 transitions, 365 flow [2023-11-29 00:28:39,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 00:28:39,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:39,268 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] [2023-11-29 00:28:39,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:28:39,268 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:39,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:39,269 INFO L85 PathProgramCache]: Analyzing trace with hash -228091119, now seen corresponding path program 1 times [2023-11-29 00:28:39,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:39,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716185158] [2023-11-29 00:28:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:39,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:39,557 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 00:28:39,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716185158] [2023-11-29 00:28:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716185158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671113495] [2023-11-29 00:28:39,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:39,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:28:39,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:39,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:28:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:39,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 148 [2023-11-29 00:28:39,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 149 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:28:39,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:39,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 148 [2023-11-29 00:28:39,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:41,000 INFO L124 PetriNetUnfolderBase]: 2795/10801 cut-off events. [2023-11-29 00:28:41,000 INFO L125 PetriNetUnfolderBase]: For 513/515 co-relation queries the response was YES. [2023-11-29 00:28:41,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16323 conditions, 10801 events. 2795/10801 cut-off events. For 513/515 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 114682 event pairs, 2100 based on Foata normal form. 0/9424 useless extension candidates. Maximal degree in co-relation 16223. Up to 3268 conditions per place. [2023-11-29 00:28:41,045 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 57 selfloop transitions, 5 changer transitions 0/172 dead transitions. [2023-11-29 00:28:41,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 172 transitions, 535 flow [2023-11-29 00:28:41,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2023-11-29 00:28:41,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7927927927927928 [2023-11-29 00:28:41,048 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 704 transitions. [2023-11-29 00:28:41,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions. [2023-11-29 00:28:41,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:41,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions. [2023-11-29 00:28:41,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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 00:28:41,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states 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 00:28:41,054 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states 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 00:28:41,054 INFO L175 Difference]: Start difference. First operand has 159 places, 149 transitions, 365 flow. Second operand 6 states and 704 transitions. [2023-11-29 00:28:41,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 172 transitions, 535 flow [2023-11-29 00:28:41,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 172 transitions, 523 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 00:28:41,064 INFO L231 Difference]: Finished difference. Result has 156 places, 148 transitions, 361 flow [2023-11-29 00:28:41,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=361, PETRI_PLACES=156, PETRI_TRANSITIONS=148} [2023-11-29 00:28:41,064 INFO L281 CegarLoopForPetriNet]: 149 programPoint places, 7 predicate places. [2023-11-29 00:28:41,065 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 361 flow [2023-11-29 00:28:41,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:28:41,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:41,065 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] [2023-11-29 00:28:41,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:28:41,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:41,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash 312295237, now seen corresponding path program 1 times [2023-11-29 00:28:41,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:41,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694041214] [2023-11-29 00:28:41,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:41,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:41,099 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 00:28:41,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:41,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694041214] [2023-11-29 00:28:41,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694041214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:41,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:41,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:28:41,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106264364] [2023-11-29 00:28:41,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:41,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:41,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:41,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:41,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 148 [2023-11-29 00:28:41,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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 00:28:41,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:41,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 148 [2023-11-29 00:28:41,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:42,117 INFO L124 PetriNetUnfolderBase]: 1743/7650 cut-off events. [2023-11-29 00:28:42,117 INFO L125 PetriNetUnfolderBase]: For 1448/2641 co-relation queries the response was YES. [2023-11-29 00:28:42,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11988 conditions, 7650 events. 1743/7650 cut-off events. For 1448/2641 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 79516 event pairs, 967 based on Foata normal form. 10/6738 useless extension candidates. Maximal degree in co-relation 10413. Up to 2242 conditions per place. [2023-11-29 00:28:42,149 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 29 selfloop transitions, 9 changer transitions 0/163 dead transitions. [2023-11-29 00:28:42,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 163 transitions, 495 flow [2023-11-29 00:28:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-11-29 00:28:42,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9211711711711712 [2023-11-29 00:28:42,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-11-29 00:28:42,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-11-29 00:28:42,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:42,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-11-29 00:28:42,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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 00:28:42,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:28:42,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:28:42,154 INFO L175 Difference]: Start difference. First operand has 156 places, 148 transitions, 361 flow. Second operand 3 states and 409 transitions. [2023-11-29 00:28:42,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 163 transitions, 495 flow [2023-11-29 00:28:42,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 163 transitions, 485 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:28:42,157 INFO L231 Difference]: Finished difference. Result has 155 places, 155 transitions, 427 flow [2023-11-29 00:28:42,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=155, PETRI_TRANSITIONS=155} [2023-11-29 00:28:42,157 INFO L281 CegarLoopForPetriNet]: 149 programPoint places, 6 predicate places. [2023-11-29 00:28:42,157 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 155 transitions, 427 flow [2023-11-29 00:28:42,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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 00:28:42,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:42,158 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] [2023-11-29 00:28:42,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:28:42,158 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:42,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:42,158 INFO L85 PathProgramCache]: Analyzing trace with hash 698574199, now seen corresponding path program 1 times [2023-11-29 00:28:42,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:42,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56209013] [2023-11-29 00:28:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:42,357 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 00:28:42,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:42,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56209013] [2023-11-29 00:28:42,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56209013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:42,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:42,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659741693] [2023-11-29 00:28:42,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:42,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:28:42,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:42,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:28:42,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:42,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 148 [2023-11-29 00:28:42,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 155 transitions, 427 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states 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 00:28:42,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:42,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 148 [2023-11-29 00:28:42,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:43,997 INFO L124 PetriNetUnfolderBase]: 3239/12110 cut-off events. [2023-11-29 00:28:43,997 INFO L125 PetriNetUnfolderBase]: For 1844/2395 co-relation queries the response was YES. [2023-11-29 00:28:44,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19965 conditions, 12110 events. 3239/12110 cut-off events. For 1844/2395 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 132654 event pairs, 1413 based on Foata normal form. 17/10821 useless extension candidates. Maximal degree in co-relation 15509. Up to 2157 conditions per place. [2023-11-29 00:28:44,060 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 51 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2023-11-29 00:28:44,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 177 transitions, 583 flow [2023-11-29 00:28:44,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2023-11-29 00:28:44,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8153153153153153 [2023-11-29 00:28:44,063 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2023-11-29 00:28:44,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2023-11-29 00:28:44,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:44,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2023-11-29 00:28:44,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states 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 00:28:44,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states 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 00:28:44,068 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states 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 00:28:44,068 INFO L175 Difference]: Start difference. First operand has 155 places, 155 transitions, 427 flow. Second operand 6 states and 724 transitions. [2023-11-29 00:28:44,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 177 transitions, 583 flow [2023-11-29 00:28:44,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 177 transitions, 565 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:28:44,084 INFO L231 Difference]: Finished difference. Result has 156 places, 153 transitions, 415 flow [2023-11-29 00:28:44,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=156, PETRI_TRANSITIONS=153} [2023-11-29 00:28:44,084 INFO L281 CegarLoopForPetriNet]: 149 programPoint places, 7 predicate places. [2023-11-29 00:28:44,085 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 415 flow [2023-11-29 00:28:44,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states 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 00:28:44,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:44,085 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] [2023-11-29 00:28:44,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 00:28:44,086 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:44,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:44,086 INFO L85 PathProgramCache]: Analyzing trace with hash 334560719, now seen corresponding path program 1 times [2023-11-29 00:28:44,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:44,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485850085] [2023-11-29 00:28:44,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:44,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:28:44,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:44,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485850085] [2023-11-29 00:28:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485850085] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:28:44,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727984865] [2023-11-29 00:28:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:44,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:28:44,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:28:44,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:28:44,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:28:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:44,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:28:44,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:28:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:28:44,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:28:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:28:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727984865] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:28:44,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:28:44,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 00:28:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592374941] [2023-11-29 00:28:44,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:28:44,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:28:44,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:28:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:28:44,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 148 [2023-11-29 00:28:44,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 415 flow. Second operand has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 00:28:44,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:44,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 148 [2023-11-29 00:28:44,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:45,734 INFO L124 PetriNetUnfolderBase]: 1466/8030 cut-off events. [2023-11-29 00:28:45,735 INFO L125 PetriNetUnfolderBase]: For 963/1188 co-relation queries the response was YES. [2023-11-29 00:28:45,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12365 conditions, 8030 events. 1466/8030 cut-off events. For 963/1188 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 83522 event pairs, 536 based on Foata normal form. 1/7296 useless extension candidates. Maximal degree in co-relation 6750. Up to 1078 conditions per place. [2023-11-29 00:28:45,766 INFO L140 encePairwiseOnDemand]: 138/148 looper letters, 48 selfloop transitions, 10 changer transitions 0/185 dead transitions. [2023-11-29 00:28:45,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 185 transitions, 606 flow [2023-11-29 00:28:45,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:28:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:28:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions. [2023-11-29 00:28:45,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8606418918918919 [2023-11-29 00:28:45,770 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions. [2023-11-29 00:28:45,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions. [2023-11-29 00:28:45,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:45,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions. [2023-11-29 00:28:45,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.375) internal successors, (1019), 8 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states 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 00:28:45,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 148.0) internal successors, (1332), 9 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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 00:28:45,776 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 148.0) internal successors, (1332), 9 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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 00:28:45,777 INFO L175 Difference]: Start difference. First operand has 156 places, 153 transitions, 415 flow. Second operand 8 states and 1019 transitions. [2023-11-29 00:28:45,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 185 transitions, 606 flow [2023-11-29 00:28:45,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 185 transitions, 594 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:28:45,785 INFO L231 Difference]: Finished difference. Result has 161 places, 156 transitions, 449 flow [2023-11-29 00:28:45,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=449, PETRI_PLACES=161, PETRI_TRANSITIONS=156} [2023-11-29 00:28:45,785 INFO L281 CegarLoopForPetriNet]: 149 programPoint places, 12 predicate places. [2023-11-29 00:28:45,785 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 449 flow [2023-11-29 00:28:45,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 00:28:45,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:45,786 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] [2023-11-29 00:28:45,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:28:45,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:28:45,992 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:45,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1544157107, now seen corresponding path program 1 times [2023-11-29 00:28:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:45,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873152960] [2023-11-29 00:28:45,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:46,276 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 00:28:46,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:46,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873152960] [2023-11-29 00:28:46,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873152960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:46,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:46,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542091666] [2023-11-29 00:28:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:46,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:28:46,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:46,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:28:46,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:46,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 148 [2023-11-29 00:28:46,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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 00:28:46,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:46,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 148 [2023-11-29 00:28:46,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:47,414 INFO L124 PetriNetUnfolderBase]: 2161/8242 cut-off events. [2023-11-29 00:28:47,415 INFO L125 PetriNetUnfolderBase]: For 834/1139 co-relation queries the response was YES. [2023-11-29 00:28:47,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13644 conditions, 8242 events. 2161/8242 cut-off events. For 834/1139 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 83878 event pairs, 945 based on Foata normal form. 6/7479 useless extension candidates. Maximal degree in co-relation 9840. Up to 1477 conditions per place. [2023-11-29 00:28:47,451 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 44 selfloop transitions, 5 changer transitions 0/179 dead transitions. [2023-11-29 00:28:47,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 179 transitions, 593 flow [2023-11-29 00:28:47,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions. [2023-11-29 00:28:47,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8603603603603603 [2023-11-29 00:28:47,453 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 764 transitions. [2023-11-29 00:28:47,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions. [2023-11-29 00:28:47,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:47,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions. [2023-11-29 00:28:47,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 00:28:47,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states 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 00:28:47,457 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states 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 00:28:47,457 INFO L175 Difference]: Start difference. First operand has 161 places, 156 transitions, 449 flow. Second operand 6 states and 764 transitions. [2023-11-29 00:28:47,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 179 transitions, 593 flow [2023-11-29 00:28:47,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 179 transitions, 587 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:28:47,462 INFO L231 Difference]: Finished difference. Result has 162 places, 155 transitions, 451 flow [2023-11-29 00:28:47,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=162, PETRI_TRANSITIONS=155} [2023-11-29 00:28:47,462 INFO L281 CegarLoopForPetriNet]: 149 programPoint places, 13 predicate places. [2023-11-29 00:28:47,462 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 451 flow [2023-11-29 00:28:47,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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 00:28:47,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:47,463 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:28:47,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 00:28:47,463 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:47,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1014661687, now seen corresponding path program 1 times [2023-11-29 00:28:47,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:47,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422860163] [2023-11-29 00:28:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:47,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:28:47,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:47,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422860163] [2023-11-29 00:28:47,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422860163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:47,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:47,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:28:47,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294278969] [2023-11-29 00:28:47,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:47,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:47,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:47,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:47,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:47,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 148 [2023-11-29 00:28:47,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 155 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 00:28:47,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:47,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 148 [2023-11-29 00:28:47,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:48,418 INFO L124 PetriNetUnfolderBase]: 1085/6141 cut-off events. [2023-11-29 00:28:48,418 INFO L125 PetriNetUnfolderBase]: For 2416/3936 co-relation queries the response was YES. [2023-11-29 00:28:48,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10781 conditions, 6141 events. 1085/6141 cut-off events. For 2416/3936 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 66138 event pairs, 578 based on Foata normal form. 14/5711 useless extension candidates. Maximal degree in co-relation 9687. Up to 1449 conditions per place. [2023-11-29 00:28:48,454 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 31 selfloop transitions, 13 changer transitions 0/171 dead transitions. [2023-11-29 00:28:48,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 171 transitions, 612 flow [2023-11-29 00:28:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-11-29 00:28:48,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2023-11-29 00:28:48,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-11-29 00:28:48,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-11-29 00:28:48,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:48,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-11-29 00:28:48,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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 00:28:48,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:28:48,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:28:48,458 INFO L175 Difference]: Start difference. First operand has 162 places, 155 transitions, 451 flow. Second operand 3 states and 408 transitions. [2023-11-29 00:28:48,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 171 transitions, 612 flow [2023-11-29 00:28:48,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 171 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:28:48,470 INFO L231 Difference]: Finished difference. Result has 161 places, 164 transitions, 559 flow [2023-11-29 00:28:48,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=161, PETRI_TRANSITIONS=164} [2023-11-29 00:28:48,471 INFO L281 CegarLoopForPetriNet]: 149 programPoint places, 12 predicate places. [2023-11-29 00:28:48,471 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 164 transitions, 559 flow [2023-11-29 00:28:48,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 00:28:48,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:48,471 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:28:48,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 00:28:48,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:48,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1107186029, now seen corresponding path program 1 times [2023-11-29 00:28:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:48,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579017720] [2023-11-29 00:28:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:28:48,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:48,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579017720] [2023-11-29 00:28:48,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579017720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:48,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:48,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:28:48,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456731606] [2023-11-29 00:28:48,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:48,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:48,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:48,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:48,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:48,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 148 [2023-11-29 00:28:48,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 164 transitions, 559 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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 00:28:48,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:48,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 148 [2023-11-29 00:28:48,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:48,898 INFO L124 PetriNetUnfolderBase]: 117/1837 cut-off events. [2023-11-29 00:28:48,898 INFO L125 PetriNetUnfolderBase]: For 728/908 co-relation queries the response was YES. [2023-11-29 00:28:48,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1837 events. 117/1837 cut-off events. For 728/908 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14393 event pairs, 43 based on Foata normal form. 24/1785 useless extension candidates. Maximal degree in co-relation 2347. Up to 144 conditions per place. [2023-11-29 00:28:48,904 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 12 selfloop transitions, 6 changer transitions 0/159 dead transitions. [2023-11-29 00:28:48,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 532 flow [2023-11-29 00:28:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-11-29 00:28:48,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9391891891891891 [2023-11-29 00:28:48,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-11-29 00:28:48,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-11-29 00:28:48,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:48,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-11-29 00:28:48,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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 00:28:48,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:28:48,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:28:48,907 INFO L175 Difference]: Start difference. First operand has 161 places, 164 transitions, 559 flow. Second operand 3 states and 417 transitions. [2023-11-29 00:28:48,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 532 flow [2023-11-29 00:28:48,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 518 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-29 00:28:48,913 INFO L231 Difference]: Finished difference. Result has 161 places, 154 transitions, 463 flow [2023-11-29 00:28:48,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=161, PETRI_TRANSITIONS=154} [2023-11-29 00:28:48,914 INFO L281 CegarLoopForPetriNet]: 149 programPoint places, 12 predicate places. [2023-11-29 00:28:48,914 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 463 flow [2023-11-29 00:28:48,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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 00:28:48,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:48,915 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:28:48,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 00:28:48,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:48,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash 690775236, now seen corresponding path program 1 times [2023-11-29 00:28:48,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:48,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207951590] [2023-11-29 00:28:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:48,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-29 00:28:48,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:48,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207951590] [2023-11-29 00:28:48,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207951590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:48,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:48,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:28:48,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807590030] [2023-11-29 00:28:48,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:48,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:48,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:48,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:48,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:48,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 148 [2023-11-29 00:28:48,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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 00:28:48,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:48,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 148 [2023-11-29 00:28:48,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:49,288 INFO L124 PetriNetUnfolderBase]: 203/2114 cut-off events. [2023-11-29 00:28:49,288 INFO L125 PetriNetUnfolderBase]: For 1362/1855 co-relation queries the response was YES. [2023-11-29 00:28:49,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 2114 events. 203/2114 cut-off events. For 1362/1855 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 17936 event pairs, 134 based on Foata normal form. 3/1969 useless extension candidates. Maximal degree in co-relation 3127. Up to 435 conditions per place. [2023-11-29 00:28:49,294 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 25 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2023-11-29 00:28:49,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 545 flow [2023-11-29 00:28:49,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-11-29 00:28:49,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9031531531531531 [2023-11-29 00:28:49,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-11-29 00:28:49,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-11-29 00:28:49,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:49,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-11-29 00:28:49,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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 00:28:49,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:28:49,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:28:49,298 INFO L175 Difference]: Start difference. First operand has 161 places, 154 transitions, 463 flow. Second operand 3 states and 401 transitions. [2023-11-29 00:28:49,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 545 flow [2023-11-29 00:28:49,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 539 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:28:49,304 INFO L231 Difference]: Finished difference. Result has 164 places, 157 transitions, 497 flow [2023-11-29 00:28:49,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=164, PETRI_TRANSITIONS=157} [2023-11-29 00:28:49,304 INFO L281 CegarLoopForPetriNet]: 149 programPoint places, 15 predicate places. [2023-11-29 00:28:49,305 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 497 flow [2023-11-29 00:28:49,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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 00:28:49,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:49,305 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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 00:28:49,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 00:28:49,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:28:49,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash 199131356, now seen corresponding path program 1 times [2023-11-29 00:28:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022756445] [2023-11-29 00:28:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:28:49,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:28:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:28:49,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:28:49,403 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:28:49,403 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-11-29 00:28:49,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-11-29 00:28:49,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-11-29 00:28:49,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-11-29 00:28:49,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-11-29 00:28:49,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-11-29 00:28:49,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-11-29 00:28:49,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-11-29 00:28:49,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-11-29 00:28:49,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-11-29 00:28:49,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 00:28:49,405 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:28:49,405 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:28:49,405 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-29 00:28:49,430 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 00:28:49,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 166 transitions, 372 flow [2023-11-29 00:28:49,563 INFO L124 PetriNetUnfolderBase]: 43/875 cut-off events. [2023-11-29 00:28:49,563 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-29 00:28:49,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 875 events. 43/875 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3130 event pairs, 6 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 513. Up to 32 conditions per place. [2023-11-29 00:28:49,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 166 transitions, 372 flow [2023-11-29 00:28:49,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 166 transitions, 372 flow [2023-11-29 00:28:49,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:28:49,571 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;@18824877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:28:49,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-29 00:28:49,574 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:28:49,574 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2023-11-29 00:28:49,574 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:28:49,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:49,574 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 00:28:49,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:28:49,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1410093875, now seen corresponding path program 1 times [2023-11-29 00:28:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:49,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964726752] [2023-11-29 00:28:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:49,593 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 00:28:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:49,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964726752] [2023-11-29 00:28:49,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964726752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:49,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:49,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:28:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060590691] [2023-11-29 00:28:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:49,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:28:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:49,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:28:49,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:28:49,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 166 [2023-11-29 00:28:49,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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 00:28:49,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:49,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 166 [2023-11-29 00:28:49,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:52,766 INFO L124 PetriNetUnfolderBase]: 7859/26495 cut-off events. [2023-11-29 00:28:52,766 INFO L125 PetriNetUnfolderBase]: For 2999/5222 co-relation queries the response was YES. [2023-11-29 00:28:52,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38845 conditions, 26495 events. 7859/26495 cut-off events. For 2999/5222 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 308090 event pairs, 4292 based on Foata normal form. 814/24648 useless extension candidates. Maximal degree in co-relation 30842. Up to 7653 conditions per place. [2023-11-29 00:28:52,905 INFO L140 encePairwiseOnDemand]: 156/166 looper letters, 30 selfloop transitions, 6 changer transitions 1/176 dead transitions. [2023-11-29 00:28:52,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 176 transitions, 464 flow [2023-11-29 00:28:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:28:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:28:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-11-29 00:28:52,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9236947791164659 [2023-11-29 00:28:52,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-11-29 00:28:52,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-11-29 00:28:52,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:52,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-11-29 00:28:52,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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 00:28:52,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:28:52,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:28:52,909 INFO L175 Difference]: Start difference. First operand has 168 places, 166 transitions, 372 flow. Second operand 3 states and 460 transitions. [2023-11-29 00:28:52,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 176 transitions, 464 flow [2023-11-29 00:28:52,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 176 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:28:52,914 INFO L231 Difference]: Finished difference. Result has 172 places, 167 transitions, 410 flow [2023-11-29 00:28:52,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=172, PETRI_TRANSITIONS=167} [2023-11-29 00:28:52,915 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 4 predicate places. [2023-11-29 00:28:52,915 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 410 flow [2023-11-29 00:28:52,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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 00:28:52,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:52,916 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] [2023-11-29 00:28:52,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 00:28:52,916 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:28:52,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1158319052, now seen corresponding path program 1 times [2023-11-29 00:28:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871379871] [2023-11-29 00:28:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:52,977 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 00:28:52,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871379871] [2023-11-29 00:28:52,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871379871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:52,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:52,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:52,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530180284] [2023-11-29 00:28:52,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:52,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:28:52,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:52,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:28:52,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:28:53,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 166 [2023-11-29 00:28:53,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 167 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states 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 00:28:53,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:53,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 166 [2023-11-29 00:28:53,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:28:58,409 INFO L124 PetriNetUnfolderBase]: 9343/35718 cut-off events. [2023-11-29 00:28:58,409 INFO L125 PetriNetUnfolderBase]: For 2612/2736 co-relation queries the response was YES. [2023-11-29 00:28:58,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52635 conditions, 35718 events. 9343/35718 cut-off events. For 2612/2736 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 446686 event pairs, 7523 based on Foata normal form. 1/31492 useless extension candidates. Maximal degree in co-relation 32417. Up to 10778 conditions per place. [2023-11-29 00:28:58,605 INFO L140 encePairwiseOnDemand]: 158/166 looper letters, 28 selfloop transitions, 2 changer transitions 5/175 dead transitions. [2023-11-29 00:28:58,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 175 transitions, 496 flow [2023-11-29 00:28:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:28:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions. [2023-11-29 00:28:58,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2023-11-29 00:28:58,607 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 852 transitions. [2023-11-29 00:28:58,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 852 transitions. [2023-11-29 00:28:58,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:58,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 852 transitions. [2023-11-29 00:28:58,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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 00:28:58,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states 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 00:28:58,610 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states 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 00:28:58,610 INFO L175 Difference]: Start difference. First operand has 172 places, 167 transitions, 410 flow. Second operand 6 states and 852 transitions. [2023-11-29 00:28:58,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 175 transitions, 496 flow [2023-11-29 00:28:58,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 175 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:28:58,653 INFO L231 Difference]: Finished difference. Result has 178 places, 168 transitions, 420 flow [2023-11-29 00:28:58,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=178, PETRI_TRANSITIONS=168} [2023-11-29 00:28:58,654 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 10 predicate places. [2023-11-29 00:28:58,654 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 168 transitions, 420 flow [2023-11-29 00:28:58,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states 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 00:28:58,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:28:58,654 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] [2023-11-29 00:28:58,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 00:28:58,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:28:58,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash 503154231, now seen corresponding path program 1 times [2023-11-29 00:28:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:58,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141370197] [2023-11-29 00:28:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:58,842 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 00:28:58,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:58,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141370197] [2023-11-29 00:28:58,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141370197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:58,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:58,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:28:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188665202] [2023-11-29 00:28:58,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:58,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:28:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:58,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:28:58,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:59,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2023-11-29 00:28:59,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 168 transitions, 420 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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 00:28:59,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:28:59,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2023-11-29 00:28:59,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:06,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([653] L1043-1-->L1044: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][68], [189#true, threadThread1of4ForFork0InUse, 99#L1026-5true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 95#L1027-3true, Black: 171#true, 177#true, 90#L1044true, 78#L1026-5true, Black: 183#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 181#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 180#(<= |ULTIMATE.start_main_~threads_total~0#1| 0)]) [2023-11-29 00:29:06,293 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2023-11-29 00:29:06,293 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2023-11-29 00:29:06,293 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-29 00:29:06,293 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2023-11-29 00:29:07,466 INFO L124 PetriNetUnfolderBase]: 18626/62194 cut-off events. [2023-11-29 00:29:07,466 INFO L125 PetriNetUnfolderBase]: For 2773/2795 co-relation queries the response was YES. [2023-11-29 00:29:07,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94160 conditions, 62194 events. 18626/62194 cut-off events. For 2773/2795 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 812377 event pairs, 14621 based on Foata normal form. 0/53689 useless extension candidates. Maximal degree in co-relation 94059. Up to 19383 conditions per place. [2023-11-29 00:29:07,860 INFO L140 encePairwiseOnDemand]: 160/166 looper letters, 69 selfloop transitions, 5 changer transitions 0/199 dead transitions. [2023-11-29 00:29:07,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 199 transitions, 630 flow [2023-11-29 00:29:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:29:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:29:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2023-11-29 00:29:07,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8032128514056225 [2023-11-29 00:29:07,861 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2023-11-29 00:29:07,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2023-11-29 00:29:07,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:07,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2023-11-29 00:29:07,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states 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 00:29:07,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states 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 00:29:07,865 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states 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 00:29:07,865 INFO L175 Difference]: Start difference. First operand has 178 places, 168 transitions, 420 flow. Second operand 6 states and 800 transitions. [2023-11-29 00:29:07,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 199 transitions, 630 flow [2023-11-29 00:29:07,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 199 transitions, 618 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 00:29:07,914 INFO L231 Difference]: Finished difference. Result has 175 places, 167 transitions, 416 flow [2023-11-29 00:29:07,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=416, PETRI_PLACES=175, PETRI_TRANSITIONS=167} [2023-11-29 00:29:07,915 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 7 predicate places. [2023-11-29 00:29:07,915 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 167 transitions, 416 flow [2023-11-29 00:29:07,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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 00:29:07,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:07,916 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] [2023-11-29 00:29:07,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 00:29:07,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:29:07,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1334351093, now seen corresponding path program 1 times [2023-11-29 00:29:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:07,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797070610] [2023-11-29 00:29:07,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:07,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:07,941 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 00:29:07,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:07,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797070610] [2023-11-29 00:29:07,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797070610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:07,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:07,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:29:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849003689] [2023-11-29 00:29:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:07,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:07,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:07,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:07,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166 [2023-11-29 00:29:07,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 167 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 00:29:07,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:07,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166 [2023-11-29 00:29:07,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:14,440 INFO L124 PetriNetUnfolderBase]: 13833/49472 cut-off events. [2023-11-29 00:29:14,440 INFO L125 PetriNetUnfolderBase]: For 11409/20168 co-relation queries the response was YES. [2023-11-29 00:29:14,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79192 conditions, 49472 events. 13833/49472 cut-off events. For 11409/20168 co-relation queries the response was YES. Maximal size of possible extension queue 1462. Compared 657232 event pairs, 7275 based on Foata normal form. 42/43145 useless extension candidates. Maximal degree in co-relation 35845. Up to 16026 conditions per place. [2023-11-29 00:29:14,889 INFO L140 encePairwiseOnDemand]: 158/166 looper letters, 39 selfloop transitions, 11 changer transitions 0/188 dead transitions. [2023-11-29 00:29:14,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 188 transitions, 602 flow [2023-11-29 00:29:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:29:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-11-29 00:29:14,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9196787148594378 [2023-11-29 00:29:14,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-11-29 00:29:14,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-11-29 00:29:14,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:14,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-11-29 00:29:14,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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 00:29:14,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:29:14,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:29:14,894 INFO L175 Difference]: Start difference. First operand has 175 places, 167 transitions, 416 flow. Second operand 3 states and 458 transitions. [2023-11-29 00:29:14,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 188 transitions, 602 flow [2023-11-29 00:29:14,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 188 transitions, 592 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:29:14,905 INFO L231 Difference]: Finished difference. Result has 174 places, 176 transitions, 502 flow [2023-11-29 00:29:14,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=174, PETRI_TRANSITIONS=176} [2023-11-29 00:29:14,905 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 6 predicate places. [2023-11-29 00:29:14,906 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 176 transitions, 502 flow [2023-11-29 00:29:14,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 00:29:14,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:14,906 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] [2023-11-29 00:29:14,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 00:29:14,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:29:14,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash -113869043, now seen corresponding path program 1 times [2023-11-29 00:29:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266462040] [2023-11-29 00:29:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:15,226 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 00:29:15,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:15,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266462040] [2023-11-29 00:29:15,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266462040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:15,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:15,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:29:15,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320413139] [2023-11-29 00:29:15,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:15,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:29:15,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:15,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:29:15,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:29:15,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 166 [2023-11-29 00:29:15,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 176 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states 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 00:29:15,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:15,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 166 [2023-11-29 00:29:15,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:22,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1026-4-->L1026-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][169], [26#L1044-1true, threadThread1of4ForFork0InUse, 99#L1026-5true, threadThread2of4ForFork0InUse, 44#L1025-3true, threadThread3of4ForFork0InUse, 88#L1027true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, Black: 173#(= |#race~data~0| 0), Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 196#true, 202#true]) [2023-11-29 00:29:22,837 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2023-11-29 00:29:22,837 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2023-11-29 00:29:22,837 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 00:29:22,837 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 00:29:22,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][204], [26#L1044-1true, threadThread1of4ForFork0InUse, 99#L1026-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0InUse, 62#L1026-5true, Black: 173#(= |#race~data~0| 0), 17#L1026-6true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 196#true, 202#true]) [2023-11-29 00:29:22,993 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2023-11-29 00:29:22,993 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-29 00:29:22,993 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-29 00:29:22,993 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-29 00:29:23,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1026-4-->L1026-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][169], [30#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 26#L1044-1true, threadThread1of4ForFork0InUse, 99#L1026-5true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, 84#L1026-5true, Black: 173#(= |#race~data~0| 0), Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 196#true, 202#true]) [2023-11-29 00:29:23,176 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2023-11-29 00:29:23,176 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-29 00:29:23,176 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 00:29:23,176 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 00:29:23,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][198], [26#L1044-1true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 99#L1026-5true, threadThread3of4ForFork0InUse, 88#L1027true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0InUse, 62#L1026-5true, Black: 173#(= |#race~data~0| 0), Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 196#true, 202#true]) [2023-11-29 00:29:23,774 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2023-11-29 00:29:23,774 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2023-11-29 00:29:23,774 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2023-11-29 00:29:23,774 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2023-11-29 00:29:24,803 INFO L124 PetriNetUnfolderBase]: 23498/69422 cut-off events. [2023-11-29 00:29:24,803 INFO L125 PetriNetUnfolderBase]: For 10434/14148 co-relation queries the response was YES. [2023-11-29 00:29:25,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117984 conditions, 69422 events. 23498/69422 cut-off events. For 10434/14148 co-relation queries the response was YES. Maximal size of possible extension queue 1905. Compared 907285 event pairs, 9806 based on Foata normal form. 80/61261 useless extension candidates. Maximal degree in co-relation 91134. Up to 12712 conditions per place. [2023-11-29 00:29:25,277 INFO L140 encePairwiseOnDemand]: 159/166 looper letters, 63 selfloop transitions, 5 changer transitions 0/206 dead transitions. [2023-11-29 00:29:25,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 206 transitions, 698 flow [2023-11-29 00:29:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:29:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:29:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2023-11-29 00:29:25,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8232931726907631 [2023-11-29 00:29:25,278 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 820 transitions. [2023-11-29 00:29:25,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions. [2023-11-29 00:29:25,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:25,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions. [2023-11-29 00:29:25,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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 00:29:25,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states 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 00:29:25,280 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states 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 00:29:25,280 INFO L175 Difference]: Start difference. First operand has 174 places, 176 transitions, 502 flow. Second operand 6 states and 820 transitions. [2023-11-29 00:29:25,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 206 transitions, 698 flow [2023-11-29 00:29:25,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 206 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:29:25,359 INFO L231 Difference]: Finished difference. Result has 175 places, 174 transitions, 486 flow [2023-11-29 00:29:25,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=175, PETRI_TRANSITIONS=174} [2023-11-29 00:29:25,360 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 7 predicate places. [2023-11-29 00:29:25,360 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 174 transitions, 486 flow [2023-11-29 00:29:25,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states 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 00:29:25,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:25,360 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] [2023-11-29 00:29:25,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 00:29:25,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:29:25,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1999387371, now seen corresponding path program 1 times [2023-11-29 00:29:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645859066] [2023-11-29 00:29:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645859066] [2023-11-29 00:29:25,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645859066] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:29:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172758691] [2023-11-29 00:29:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:25,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:29:25,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:29:25,437 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:29:25,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:29:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:25,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:29:25,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:29:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:25,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:29:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:25,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172758691] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:29:25,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:29:25,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 00:29:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690694981] [2023-11-29 00:29:25,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:29:25,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:29:25,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:25,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:29:25,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:29:25,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 166 [2023-11-29 00:29:25,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 174 transitions, 486 flow. Second operand has 9 states, 9 states have (on average 136.22222222222223) internal successors, (1226), 9 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:25,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:25,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 166 [2023-11-29 00:29:25,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:30,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][212], [26#L1044-1true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 99#L1026-5true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), threadThread4of4ForFork0InUse, 62#L1026-5true, Black: 173#(= |#race~data~0| 0), 17#L1026-6true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 202#true]) [2023-11-29 00:29:30,295 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2023-11-29 00:29:30,295 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-29 00:29:30,295 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-29 00:29:30,295 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-29 00:29:31,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][210], [26#L1044-1true, threadThread1of4ForFork0InUse, 99#L1026-5true, threadThread2of4ForFork0NotInUse, 88#L1027true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), threadThread4of4ForFork0InUse, 62#L1026-5true, Black: 173#(= |#race~data~0| 0), Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 202#true]) [2023-11-29 00:29:31,032 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2023-11-29 00:29:31,032 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2023-11-29 00:29:31,032 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2023-11-29 00:29:31,032 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2023-11-29 00:29:32,122 INFO L124 PetriNetUnfolderBase]: 11250/46416 cut-off events. [2023-11-29 00:29:32,122 INFO L125 PetriNetUnfolderBase]: For 6128/7899 co-relation queries the response was YES. [2023-11-29 00:29:32,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73697 conditions, 46416 events. 11250/46416 cut-off events. For 6128/7899 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 620775 event pairs, 4609 based on Foata normal form. 9/41398 useless extension candidates. Maximal degree in co-relation 41030. Up to 6732 conditions per place. [2023-11-29 00:29:32,396 INFO L140 encePairwiseOnDemand]: 156/166 looper letters, 61 selfloop transitions, 10 changer transitions 0/215 dead transitions. [2023-11-29 00:29:32,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 215 transitions, 724 flow [2023-11-29 00:29:32,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:29:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:29:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1144 transitions. [2023-11-29 00:29:32,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8614457831325302 [2023-11-29 00:29:32,398 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1144 transitions. [2023-11-29 00:29:32,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1144 transitions. [2023-11-29 00:29:32,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:32,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1144 transitions. [2023-11-29 00:29:32,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states 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 00:29:32,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states 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 00:29:32,401 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states 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 00:29:32,401 INFO L175 Difference]: Start difference. First operand has 175 places, 174 transitions, 486 flow. Second operand 8 states and 1144 transitions. [2023-11-29 00:29:32,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 215 transitions, 724 flow [2023-11-29 00:29:32,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 215 transitions, 712 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:29:32,420 INFO L231 Difference]: Finished difference. Result has 180 places, 177 transitions, 520 flow [2023-11-29 00:29:32,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=180, PETRI_TRANSITIONS=177} [2023-11-29 00:29:32,421 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 12 predicate places. [2023-11-29 00:29:32,421 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 177 transitions, 520 flow [2023-11-29 00:29:32,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.22222222222223) internal successors, (1226), 9 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:32,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:32,421 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] [2023-11-29 00:29:32,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:29:32,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0b7086b-cb57-4673-92b1-91a6e11daa8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-29 00:29:32,622 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:29:32,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1866287351, now seen corresponding path program 1 times [2023-11-29 00:29:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:32,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268988611] [2023-11-29 00:29:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:32,881 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 00:29:32,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:32,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268988611] [2023-11-29 00:29:32,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268988611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:32,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:32,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:29:32,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671535626] [2023-11-29 00:29:32,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:32,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:29:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:32,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:29:32,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:29:33,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 166 [2023-11-29 00:29:33,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 177 transitions, 520 flow. Second operand has 6 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 states 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 00:29:33,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:33,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 166 [2023-11-29 00:29:33,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:37,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][207], [26#L1044-1true, threadThread1of4ForFork0InUse, 99#L1026-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), threadThread4of4ForFork0InUse, 62#L1026-5true, Black: 173#(= |#race~data~0| 0), 17#L1026-6true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-11-29 00:29:37,673 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2023-11-29 00:29:37,673 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-29 00:29:37,673 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-29 00:29:37,673 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-29 00:29:37,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][206], [26#L1044-1true, threadThread1of4ForFork0InUse, 99#L1026-5true, threadThread2of4ForFork0NotInUse, 88#L1027true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), threadThread4of4ForFork0InUse, 62#L1026-5true, Black: 173#(= |#race~data~0| 0), Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-11-29 00:29:37,937 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2023-11-29 00:29:37,937 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2023-11-29 00:29:37,937 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2023-11-29 00:29:37,937 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2023-11-29 00:29:39,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1026-4-->L1026-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][203], [26#L1044-1true, threadThread1of4ForFork0InUse, 99#L1026-5true, threadThread2of4ForFork0NotInUse, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 173#(= |#race~data~0| 0), 17#L1026-6true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-11-29 00:29:39,338 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2023-11-29 00:29:39,338 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-29 00:29:39,338 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-29 00:29:39,338 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-11-29 00:29:39,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([705] L1026-4-->L1026-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][202], [26#L1044-1true, threadThread1of4ForFork0InUse, 99#L1026-5true, threadThread2of4ForFork0NotInUse, 88#L1027true, threadThread3of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 173#(= |#race~data~0| 0), Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-11-29 00:29:39,390 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-11-29 00:29:39,390 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-29 00:29:39,390 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-29 00:29:39,390 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-29 00:29:39,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([653] L1043-1-->L1044: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][150], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse, 99#L1026-5true, threadThread3of4ForFork0InUse, 88#L1027true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), threadThread4of4ForFork0NotInUse, 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 171#true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 90#L1044true, 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-11-29 00:29:39,463 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2023-11-29 00:29:39,463 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-11-29 00:29:39,463 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-11-29 00:29:39,463 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-29 00:29:39,607 INFO L124 PetriNetUnfolderBase]: 16070/47844 cut-off events. [2023-11-29 00:29:39,607 INFO L125 PetriNetUnfolderBase]: For 5671/8241 co-relation queries the response was YES. [2023-11-29 00:29:39,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82394 conditions, 47844 events. 16070/47844 cut-off events. For 5671/8241 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 599420 event pairs, 6983 based on Foata normal form. 122/42671 useless extension candidates. Maximal degree in co-relation 59273. Up to 9119 conditions per place. [2023-11-29 00:29:40,166 INFO L140 encePairwiseOnDemand]: 160/166 looper letters, 56 selfloop transitions, 5 changer transitions 0/208 dead transitions. [2023-11-29 00:29:40,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 208 transitions, 704 flow [2023-11-29 00:29:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:29:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:29:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 860 transitions. [2023-11-29 00:29:40,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8634538152610441 [2023-11-29 00:29:40,168 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 860 transitions. [2023-11-29 00:29:40,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 860 transitions. [2023-11-29 00:29:40,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:40,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 860 transitions. [2023-11-29 00:29:40,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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 00:29:40,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states 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 00:29:40,171 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states 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 00:29:40,171 INFO L175 Difference]: Start difference. First operand has 180 places, 177 transitions, 520 flow. Second operand 6 states and 860 transitions. [2023-11-29 00:29:40,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 208 transitions, 704 flow [2023-11-29 00:29:40,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 208 transitions, 698 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:29:40,189 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 522 flow [2023-11-29 00:29:40,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=181, PETRI_TRANSITIONS=176} [2023-11-29 00:29:40,189 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 13 predicate places. [2023-11-29 00:29:40,190 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 522 flow [2023-11-29 00:29:40,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 states 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 00:29:40,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:40,190 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:29:40,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 00:29:40,190 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:29:40,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1647454503, now seen corresponding path program 1 times [2023-11-29 00:29:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647346826] [2023-11-29 00:29:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:29:40,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:40,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647346826] [2023-11-29 00:29:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647346826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:40,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:40,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:29:40,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306026514] [2023-11-29 00:29:40,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:40,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:40,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:40,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:40,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:40,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166 [2023-11-29 00:29:40,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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 00:29:40,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:40,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166 [2023-11-29 00:29:40,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:47,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([653] L1043-1-->L1044: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][183], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 171#true, 17#L1026-6true, 115#L1027true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 90#L1044true, 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 605#true]) [2023-11-29 00:29:47,100 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-11-29 00:29:47,100 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-29 00:29:47,100 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-29 00:29:47,100 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-29 00:29:47,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([653] L1043-1-->L1044: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][183], [threadThread1of4ForFork0InUse, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 213#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 95#L1027-3true, Black: 171#true, 17#L1026-6true, Black: 211#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 214#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 90#L1044true, 598#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0), 605#true]) [2023-11-29 00:29:47,123 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2023-11-29 00:29:47,123 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:29:47,123 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:29:47,124 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2023-11-29 00:29:47,282 INFO L124 PetriNetUnfolderBase]: 11770/46164 cut-off events. [2023-11-29 00:29:47,282 INFO L125 PetriNetUnfolderBase]: For 23542/36203 co-relation queries the response was YES. [2023-11-29 00:29:47,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85233 conditions, 46164 events. 11770/46164 cut-off events. For 23542/36203 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 643596 event pairs, 6450 based on Foata normal form. 50/41999 useless extension candidates. Maximal degree in co-relation 76233. Up to 13606 conditions per place. [2023-11-29 00:29:47,618 INFO L140 encePairwiseOnDemand]: 158/166 looper letters, 43 selfloop transitions, 18 changer transitions 0/201 dead transitions. [2023-11-29 00:29:47,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 201 transitions, 767 flow [2023-11-29 00:29:47,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:29:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-11-29 00:29:47,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9176706827309237 [2023-11-29 00:29:47,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-11-29 00:29:47,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-11-29 00:29:47,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:47,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-11-29 00:29:47,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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 00:29:47,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:29:47,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:29:47,621 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 522 flow. Second operand 3 states and 457 transitions. [2023-11-29 00:29:47,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 201 transitions, 767 flow [2023-11-29 00:29:47,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 201 transitions, 757 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:29:47,663 INFO L231 Difference]: Finished difference. Result has 180 places, 190 transitions, 690 flow [2023-11-29 00:29:47,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=180, PETRI_TRANSITIONS=190} [2023-11-29 00:29:47,664 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 12 predicate places. [2023-11-29 00:29:47,664 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 190 transitions, 690 flow [2023-11-29 00:29:47,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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 00:29:47,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:47,664 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:29:47,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 00:29:47,665 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:29:47,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash -576169341, now seen corresponding path program 1 times [2023-11-29 00:29:47,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:47,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743897988] [2023-11-29 00:29:47,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:29:47,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743897988] [2023-11-29 00:29:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743897988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:47,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072982015] [2023-11-29 00:29:47,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:47,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:47,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:47,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:47,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 166 [2023-11-29 00:29:47,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 190 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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 00:29:47,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:47,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 166 [2023-11-29 00:29:47,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:48,827 INFO L124 PetriNetUnfolderBase]: 660/7154 cut-off events. [2023-11-29 00:29:48,827 INFO L125 PetriNetUnfolderBase]: For 3252/3967 co-relation queries the response was YES. [2023-11-29 00:29:48,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11917 conditions, 7154 events. 660/7154 cut-off events. For 3252/3967 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 79950 event pairs, 237 based on Foata normal form. 185/6908 useless extension candidates. Maximal degree in co-relation 9194. Up to 678 conditions per place. [2023-11-29 00:29:48,853 INFO L140 encePairwiseOnDemand]: 158/166 looper letters, 16 selfloop transitions, 8 changer transitions 0/180 dead transitions. [2023-11-29 00:29:48,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 623 flow [2023-11-29 00:29:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:29:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2023-11-29 00:29:48,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2023-11-29 00:29:48,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2023-11-29 00:29:48,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2023-11-29 00:29:48,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:48,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2023-11-29 00:29:48,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states 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 00:29:48,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:29:48,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:29:48,855 INFO L175 Difference]: Start difference. First operand has 180 places, 190 transitions, 690 flow. Second operand 3 states and 466 transitions. [2023-11-29 00:29:48,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 623 flow [2023-11-29 00:29:48,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 180 transitions, 609 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-29 00:29:48,865 INFO L231 Difference]: Finished difference. Result has 180 places, 173 transitions, 530 flow [2023-11-29 00:29:48,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=180, PETRI_TRANSITIONS=173} [2023-11-29 00:29:48,865 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 12 predicate places. [2023-11-29 00:29:48,865 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 173 transitions, 530 flow [2023-11-29 00:29:48,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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 00:29:48,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:48,865 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:29:48,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 00:29:48,866 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:29:48,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:48,866 INFO L85 PathProgramCache]: Analyzing trace with hash -752662822, now seen corresponding path program 1 times [2023-11-29 00:29:48,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:48,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927716063] [2023-11-29 00:29:48,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-29 00:29:48,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:48,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927716063] [2023-11-29 00:29:48,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927716063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:48,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:48,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:29:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323148693] [2023-11-29 00:29:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:48,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:48,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:48,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:48,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166 [2023-11-29 00:29:48,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 173 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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 00:29:48,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:48,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166 [2023-11-29 00:29:48,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:50,210 INFO L124 PetriNetUnfolderBase]: 1138/9053 cut-off events. [2023-11-29 00:29:50,210 INFO L125 PetriNetUnfolderBase]: For 6974/9003 co-relation queries the response was YES. [2023-11-29 00:29:50,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16816 conditions, 9053 events. 1138/9053 cut-off events. For 6974/9003 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 107253 event pairs, 661 based on Foata normal form. 13/8292 useless extension candidates. Maximal degree in co-relation 13201. Up to 2082 conditions per place. [2023-11-29 00:29:50,239 INFO L140 encePairwiseOnDemand]: 161/166 looper letters, 33 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2023-11-29 00:29:50,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 644 flow [2023-11-29 00:29:50,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:29:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-11-29 00:29:50,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8975903614457831 [2023-11-29 00:29:50,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-11-29 00:29:50,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-11-29 00:29:50,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:50,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-11-29 00:29:50,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states 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 00:29:50,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:29:50,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:29:50,241 INFO L175 Difference]: Start difference. First operand has 180 places, 173 transitions, 530 flow. Second operand 3 states and 447 transitions. [2023-11-29 00:29:50,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 644 flow [2023-11-29 00:29:50,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 180 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:29:50,248 INFO L231 Difference]: Finished difference. Result has 183 places, 176 transitions, 562 flow [2023-11-29 00:29:50,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=183, PETRI_TRANSITIONS=176} [2023-11-29 00:29:50,248 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 15 predicate places. [2023-11-29 00:29:50,248 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 176 transitions, 562 flow [2023-11-29 00:29:50,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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 00:29:50,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:50,249 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:29:50,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 00:29:50,249 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:29:50,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash 342118056, now seen corresponding path program 1 times [2023-11-29 00:29:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276848295] [2023-11-29 00:29:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-29 00:29:50,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:50,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276848295] [2023-11-29 00:29:50,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276848295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:50,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:50,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:29:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503631405] [2023-11-29 00:29:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:50,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:50,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:50,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:50,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 166 [2023-11-29 00:29:50,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 176 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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 00:29:50,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:50,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 166 [2023-11-29 00:29:50,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:51,508 INFO L124 PetriNetUnfolderBase]: 1121/8783 cut-off events. [2023-11-29 00:29:51,509 INFO L125 PetriNetUnfolderBase]: For 9063/11620 co-relation queries the response was YES. [2023-11-29 00:29:51,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17181 conditions, 8783 events. 1121/8783 cut-off events. For 9063/11620 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 103948 event pairs, 707 based on Foata normal form. 13/8087 useless extension candidates. Maximal degree in co-relation 13650. Up to 2095 conditions per place. [2023-11-29 00:29:51,546 INFO L140 encePairwiseOnDemand]: 161/166 looper letters, 33 selfloop transitions, 5 changer transitions 0/182 dead transitions. [2023-11-29 00:29:51,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 182 transitions, 667 flow [2023-11-29 00:29:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:29:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-11-29 00:29:51,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8955823293172691 [2023-11-29 00:29:51,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-11-29 00:29:51,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-11-29 00:29:51,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:51,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-11-29 00:29:51,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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 00:29:51,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:29:51,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 00:29:51,548 INFO L175 Difference]: Start difference. First operand has 183 places, 176 transitions, 562 flow. Second operand 3 states and 446 transitions. [2023-11-29 00:29:51,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 182 transitions, 667 flow [2023-11-29 00:29:51,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 653 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-29 00:29:51,566 INFO L231 Difference]: Finished difference. Result has 185 places, 179 transitions, 590 flow [2023-11-29 00:29:51,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=185, PETRI_TRANSITIONS=179} [2023-11-29 00:29:51,566 INFO L281 CegarLoopForPetriNet]: 168 programPoint places, 17 predicate places. [2023-11-29 00:29:51,566 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 179 transitions, 590 flow [2023-11-29 00:29:51,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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 00:29:51,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:51,567 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 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 00:29:51,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 00:29:51,567 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 00:29:51,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:51,567 INFO L85 PathProgramCache]: Analyzing trace with hash -522108640, now seen corresponding path program 1 times [2023-11-29 00:29:51,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:51,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59427415] [2023-11-29 00:29:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:51,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:29:51,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:29:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:29:51,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:29:51,682 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:29:51,682 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-11-29 00:29:51,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-29 00:29:51,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-29 00:29:51,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2023-11-29 00:29:51,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-29 00:29:51,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-29 00:29:51,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-29 00:29:51,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-29 00:29:51,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-29 00:29:51,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2023-11-29 00:29:51,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-29 00:29:51,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 00:29:51,683 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:51,684 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:29:51,684 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-29 00:29:51,709 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-11-29 00:29:51,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 184 transitions, 423 flow [2023-11-29 00:29:51,914 INFO L124 PetriNetUnfolderBase]: 93/1605 cut-off events. [2023-11-29 00:29:51,914 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-11-29 00:29:51,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 1605 events. 93/1605 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7677 event pairs, 23 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 920. Up to 80 conditions per place. [2023-11-29 00:29:51,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 184 transitions, 423 flow [2023-11-29 00:29:51,921 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 184 transitions, 423 flow [2023-11-29 00:29:51,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:29:51,922 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;@18824877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:29:51,922 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-29 00:29:51,924 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:29:51,924 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2023-11-29 00:29:51,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:29:51,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:51,925 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 00:29:51,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:29:51,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1421397043, now seen corresponding path program 1 times [2023-11-29 00:29:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302611357] [2023-11-29 00:29:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:51,939 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 00:29:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302611357] [2023-11-29 00:29:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302611357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:51,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:51,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:29:51,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299424248] [2023-11-29 00:29:51,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:51,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:51,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:51,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 184 [2023-11-29 00:29:51,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 184 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 00:29:51,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:51,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 184 [2023-11-29 00:29:51,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:12,915 INFO L124 PetriNetUnfolderBase]: 51883/146711 cut-off events. [2023-11-29 00:30:12,915 INFO L125 PetriNetUnfolderBase]: For 14398/27512 co-relation queries the response was YES. [2023-11-29 00:30:13,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222016 conditions, 146711 events. 51883/146711 cut-off events. For 14398/27512 co-relation queries the response was YES. Maximal size of possible extension queue 3112. Compared 2014454 event pairs, 29580 based on Foata normal form. 3730/136571 useless extension candidates. Maximal degree in co-relation 176681. Up to 48608 conditions per place. [2023-11-29 00:30:14,060 INFO L140 encePairwiseOnDemand]: 173/184 looper letters, 37 selfloop transitions, 7 changer transitions 1/197 dead transitions. [2023-11-29 00:30:14,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 197 transitions, 537 flow [2023-11-29 00:30:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:30:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2023-11-29 00:30:14,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9184782608695652 [2023-11-29 00:30:14,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2023-11-29 00:30:14,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2023-11-29 00:30:14,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:14,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2023-11-29 00:30:14,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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 00:30:14,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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 00:30:14,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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 00:30:14,063 INFO L175 Difference]: Start difference. First operand has 187 places, 184 transitions, 423 flow. Second operand 3 states and 507 transitions. [2023-11-29 00:30:14,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 197 transitions, 537 flow [2023-11-29 00:30:14,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 197 transitions, 537 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:30:14,092 INFO L231 Difference]: Finished difference. Result has 191 places, 186 transitions, 469 flow [2023-11-29 00:30:14,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=191, PETRI_TRANSITIONS=186} [2023-11-29 00:30:14,093 INFO L281 CegarLoopForPetriNet]: 187 programPoint places, 4 predicate places. [2023-11-29 00:30:14,093 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 186 transitions, 469 flow [2023-11-29 00:30:14,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 00:30:14,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:14,093 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] [2023-11-29 00:30:14,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 00:30:14,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:30:14,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:14,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1114084916, now seen corresponding path program 1 times [2023-11-29 00:30:14,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:14,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949535877] [2023-11-29 00:30:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:14,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,130 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 00:30:14,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:14,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949535877] [2023-11-29 00:30:14,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949535877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:14,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:14,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:30:14,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769236181] [2023-11-29 00:30:14,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:14,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:30:14,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:14,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:30:14,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:14,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 184 [2023-11-29 00:30:14,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 186 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states 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 00:30:14,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:14,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 184 [2023-11-29 00:30:14,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:41,996 INFO L124 PetriNetUnfolderBase]: 56512/185999 cut-off events. [2023-11-29 00:30:41,996 INFO L125 PetriNetUnfolderBase]: For 14079/14858 co-relation queries the response was YES. [2023-11-29 00:30:43,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281841 conditions, 185999 events. 56512/185999 cut-off events. For 14079/14858 co-relation queries the response was YES. Maximal size of possible extension queue 3453. Compared 2769498 event pairs, 39436 based on Foata normal form. 1/159996 useless extension candidates. Maximal degree in co-relation 152584. Up to 58232 conditions per place. [2023-11-29 00:30:43,760 INFO L140 encePairwiseOnDemand]: 176/184 looper letters, 32 selfloop transitions, 2 changer transitions 5/194 dead transitions. [2023-11-29 00:30:43,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 194 transitions, 563 flow [2023-11-29 00:30:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:30:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:30:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 940 transitions. [2023-11-29 00:30:43,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2023-11-29 00:30:43,762 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 940 transitions. [2023-11-29 00:30:43,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 940 transitions. [2023-11-29 00:30:43,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:43,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 940 transitions. [2023-11-29 00:30:43,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 00:30:43,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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 00:30:43,764 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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 00:30:43,764 INFO L175 Difference]: Start difference. First operand has 191 places, 186 transitions, 469 flow. Second operand 6 states and 940 transitions. [2023-11-29 00:30:43,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 194 transitions, 563 flow [2023-11-29 00:30:45,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 194 transitions, 549 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:30:45,377 INFO L231 Difference]: Finished difference. Result has 197 places, 187 transitions, 477 flow [2023-11-29 00:30:45,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=197, PETRI_TRANSITIONS=187} [2023-11-29 00:30:45,378 INFO L281 CegarLoopForPetriNet]: 187 programPoint places, 10 predicate places. [2023-11-29 00:30:45,378 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 187 transitions, 477 flow [2023-11-29 00:30:45,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states 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 00:30:45,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:45,379 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] [2023-11-29 00:30:45,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 00:30:45,379 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:30:45,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:45,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1221891857, now seen corresponding path program 1 times [2023-11-29 00:30:45,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:45,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666568471] [2023-11-29 00:30:45,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,646 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 00:30:45,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:45,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666568471] [2023-11-29 00:30:45,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666568471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:45,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:45,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:30:45,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23750379] [2023-11-29 00:30:45,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:45,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:30:45,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:45,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:30:45,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:30:45,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 184 [2023-11-29 00:30:45,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 187 transitions, 477 flow. Second operand has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:45,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:45,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 184 [2023-11-29 00:30:45,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:31:12,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L1043-1-->L1044: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][69], [Black: 190#true, 32#L1027-3true, 14#L1026-5true, 86#L1044true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0NotInUse, 22#L1026-5true, threadThread5of5ForFork0NotInUse, 196#true]) [2023-11-29 00:31:12,628 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2023-11-29 00:31:12,628 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-29 00:31:12,628 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2023-11-29 00:31:12,628 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2023-11-29 00:31:14,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([875] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [75#L1026-5true, Black: 190#true, 32#L1027-3true, 14#L1026-5true, 79#ULTIMATE.startFINALtrue, 84#L1027-3true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 22#L1026-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 196#true]) [2023-11-29 00:31:14,026 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2023-11-29 00:31:14,026 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2023-11-29 00:31:14,026 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2023-11-29 00:31:14,026 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2023-11-29 00:31:25,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([875] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [Black: 190#true, 79#ULTIMATE.startFINALtrue, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1025-3true, 22#L1026-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 196#true, 163#L1025-3true, 23#L1027-3true]) [2023-11-29 00:31:25,021 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2023-11-29 00:31:25,021 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:31:25,021 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-29 00:31:25,021 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:31:25,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L1043-1-->L1044: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][69], [Black: 190#true, 32#L1027-3true, 14#L1026-5true, 86#L1044true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, 12#$Ultimate##0true, threadThread3of5ForFork0InUse, 22#L1026-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 196#true]) [2023-11-29 00:31:25,040 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2023-11-29 00:31:25,040 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-29 00:31:25,040 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-29 00:31:25,040 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:31:29,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([875] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [Black: 190#true, 33#$Ultimate##0true, 80#L1027-3true, 79#ULTIMATE.startFINALtrue, 71#L1026-5true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 196#true, 23#L1027-3true]) [2023-11-29 00:31:29,291 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2023-11-29 00:31:29,291 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 00:31:29,291 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 00:31:29,292 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 00:31:30,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([875] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [Black: 190#true, 32#L1027-3true, 79#ULTIMATE.startFINALtrue, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 21#L1025-3true, 22#L1026-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 196#true, 23#L1027-3true]) [2023-11-29 00:31:30,097 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2023-11-29 00:31:30,097 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-11-29 00:31:30,097 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 00:31:30,097 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 00:31:30,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([875] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [Black: 190#true, 80#L1027-3true, 79#ULTIMATE.startFINALtrue, 71#L1026-5true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 136#L1025-3true, 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 196#true, 23#L1027-3true]) [2023-11-29 00:31:30,161 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2023-11-29 00:31:30,161 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 00:31:30,161 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 00:31:30,162 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 00:31:31,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([875] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [Black: 190#true, 32#L1027-3true, 14#L1026-5true, 79#ULTIMATE.startFINALtrue, 80#L1027-3true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, 22#L1026-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 196#true]) [2023-11-29 00:31:31,980 INFO L294 olderBase$Statistics]: this new event has 224 ancestors and is cut-off event [2023-11-29 00:31:31,980 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:31:31,980 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:31:31,980 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:31:32,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([875] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~malloc10#1.offset=|v_ULTIMATE.start_main_#t~malloc10#1.offset_5|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~malloc10#1.base=|v_ULTIMATE.start_main_#t~malloc10#1.base_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_5|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~malloc10#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~malloc10#1.base, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][86], [Black: 190#true, 79#ULTIMATE.startFINALtrue, 80#L1027-3true, 71#L1026-5true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 152#L1027-3true, Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 196#true, 23#L1027-3true]) [2023-11-29 00:31:32,710 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2023-11-29 00:31:32,710 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-29 00:31:32,710 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-29 00:31:32,710 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-29 00:31:35,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L1043-1-->L1044: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][69], [Black: 190#true, 14#L1026-5true, 86#L1044true, 71#L1026-5true, Black: 200#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 199#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 208#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, threadThread3of5ForFork0InUse, threadThread4of5ForFork0NotInUse, 22#L1026-5true, threadThread5of5ForFork0NotInUse, 196#true]) [2023-11-29 00:31:35,226 INFO L294 olderBase$Statistics]: this new event has 246 ancestors and is cut-off event [2023-11-29 00:31:35,226 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 00:31:35,227 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-29 00:31:35,227 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-29 00:31:39,894 INFO L124 PetriNetUnfolderBase]: 118478/344314 cut-off events. [2023-11-29 00:31:39,895 INFO L125 PetriNetUnfolderBase]: For 15389/15543 co-relation queries the response was YES. [2023-11-29 00:31:42,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529896 conditions, 344314 events. 118478/344314 cut-off events. For 15389/15543 co-relation queries the response was YES. Maximal size of possible extension queue 6260. Compared 5278979 event pairs, 95879 based on Foata normal form. 0/294188 useless extension candidates. Maximal degree in co-relation 529794. Up to 115602 conditions per place. [2023-11-29 00:31:43,537 INFO L140 encePairwiseOnDemand]: 178/184 looper letters, 81 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2023-11-29 00:31:43,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 226 transitions, 727 flow [2023-11-29 00:31:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:31:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:31:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions. [2023-11-29 00:31:43,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8115942028985508 [2023-11-29 00:31:43,539 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 896 transitions. [2023-11-29 00:31:43,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 896 transitions. [2023-11-29 00:31:43,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:31:43,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 896 transitions. [2023-11-29 00:31:43,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 149.33333333333334) internal successors, (896), 6 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 00:31:43,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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 00:31:43,541 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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 00:31:43,541 INFO L175 Difference]: Start difference. First operand has 197 places, 187 transitions, 477 flow. Second operand 6 states and 896 transitions. [2023-11-29 00:31:43,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 226 transitions, 727 flow [2023-11-29 00:31:44,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 226 transitions, 715 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 00:31:44,896 INFO L231 Difference]: Finished difference. Result has 194 places, 186 transitions, 473 flow [2023-11-29 00:31:44,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=473, PETRI_PLACES=194, PETRI_TRANSITIONS=186} [2023-11-29 00:31:44,896 INFO L281 CegarLoopForPetriNet]: 187 programPoint places, 7 predicate places. [2023-11-29 00:31:44,897 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 186 transitions, 473 flow [2023-11-29 00:31:44,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:44,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:31:44,897 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] [2023-11-29 00:31:44,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 00:31:44,897 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:31:44,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash 57484963, now seen corresponding path program 1 times [2023-11-29 00:31:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:31:44,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320518145] [2023-11-29 00:31:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:31:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:44,920 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 00:31:44,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:31:44,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320518145] [2023-11-29 00:31:44,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320518145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:44,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:44,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:31:44,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411269071] [2023-11-29 00:31:44,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:44,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:31:44,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:31:44,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:31:44,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:31:44,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 184 [2023-11-29 00:31:44,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 186 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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 00:31:44,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:31:44,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 184 [2023-11-29 00:31:44,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand