./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB --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 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:18:46,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:18:46,300 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:18:46,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:18:46,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:18:46,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:18:46,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:18:46,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:18:46,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:18:46,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:18:46,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:18:46,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:18:46,354 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:18:46,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:18:46,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:18:46,356 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:18:46,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:18:46,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:18:46,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:18:46,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:18:46,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:18:46,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:18:46,356 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:18:46,357 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:18:46,357 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:18:46,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:18:46,357 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:18:46,357 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:18:46,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:18:46,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:18:46,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:18:46,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:18:46,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:18:46,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:18:46,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:18:46,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:18:46,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:18:46,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:18:46,359 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:18:46,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:18:46,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:18:46,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:18:46,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:18:46,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:18:46,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:18:46,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:18:46,360 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 [2024-11-28 03:18:46,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:18:46,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:18:46,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:18:46,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:18:46,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:18:46,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2024-11-28 03:18:49,573 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/data/9a83726d4/c43653d3d857426a8d20bd2e6905002b/FLAGb783dc711 [2024-11-28 03:18:49,919 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:18:49,920 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2024-11-28 03:18:49,940 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/data/9a83726d4/c43653d3d857426a8d20bd2e6905002b/FLAGb783dc711 [2024-11-28 03:18:49,958 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/data/9a83726d4/c43653d3d857426a8d20bd2e6905002b [2024-11-28 03:18:49,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:18:49,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:18:49,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:18:49,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:18:49,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:18:49,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:18:49" (1/1) ... [2024-11-28 03:18:49,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73006e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:49, skipping insertion in model container [2024-11-28 03:18:49,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:18:49" (1/1) ... [2024-11-28 03:18:50,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:18:50,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:18:50,421 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:18:50,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:18:50,541 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:18:50,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50 WrapperNode [2024-11-28 03:18:50,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:18:50,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:18:50,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:18:50,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:18:50,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,602 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2024-11-28 03:18:50,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:18:50,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:18:50,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:18:50,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:18:50,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:18:50,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:18:50,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:18:50,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:18:50,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (1/1) ... [2024-11-28 03:18:50,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:18:50,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:18:50,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:18:50,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3cd6329-42cd-4890-8318-7f0961259d7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:18:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-28 03:18:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:18:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:18:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-28 03:18:50,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-28 03:18:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-28 03:18:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:18:50,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:18:50,716 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:18:50,872 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:18:50,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:18:51,304 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:18:51,305 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:18:51,365 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:18:51,365 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:18:51,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:51 BoogieIcfgContainer [2024-11-28 03:18:51,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:18:51,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:18:51,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:18:51,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:18:51,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:18:49" (1/3) ... [2024-11-28 03:18:51,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be271ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:18:51, skipping insertion in model container [2024-11-28 03:18:51,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:50" (2/3) ... [2024-11-28 03:18:51,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be271ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:18:51, skipping insertion in model container [2024-11-28 03:18:51,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:51" (3/3) ... [2024-11-28 03:18:51,381 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer.i [2024-11-28 03:18:51,398 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:18:51,400 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer.i that has 2 procedures, 230 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2024-11-28 03:18:51,401 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:18:51,495 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:18:51,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 234 transitions, 472 flow [2024-11-28 03:18:51,749 INFO L124 PetriNetUnfolderBase]: 7/276 cut-off events. [2024-11-28 03:18:51,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:18:51,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 276 events. 7/276 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place. [2024-11-28 03:18:51,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 234 transitions, 472 flow [2024-11-28 03:18:51,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 234 transitions, 472 flow [2024-11-28 03:18:51,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:18:51,807 INFO L333 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, 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;@4adf95f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:18:51,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-28 03:18:51,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:18:51,868 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events. [2024-11-28 03:18:51,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:18:51,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:51,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:51,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:18:51,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1725033164, now seen corresponding path program 1 times [2024-11-28 03:18:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:51,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408527771] [2024-11-28 03:18:51,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:51,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:52,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:52,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408527771] [2024-11-28 03:18:52,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408527771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:52,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:52,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459313015] [2024-11-28 03:18:52,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:52,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:52,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:52,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:52,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 234 [2024-11-28 03:18:52,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 234 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:52,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:52,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 234 [2024-11-28 03:18:52,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:52,874 INFO L124 PetriNetUnfolderBase]: 98/708 cut-off events. [2024-11-28 03:18:52,874 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:18:52,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 708 events. 98/708 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3348 event pairs, 33 based on Foata normal form. 9/659 useless extension candidates. Maximal degree in co-relation 731. Up to 138 conditions per place. [2024-11-28 03:18:52,883 INFO L140 encePairwiseOnDemand]: 220/234 looper letters, 32 selfloop transitions, 8 changer transitions 1/249 dead transitions. [2024-11-28 03:18:52,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 249 transitions, 582 flow [2024-11-28 03:18:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2024-11-28 03:18:52,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9615384615384616 [2024-11-28 03:18:52,907 INFO L175 Difference]: Start difference. First operand has 233 places, 234 transitions, 472 flow. Second operand 3 states and 675 transitions. [2024-11-28 03:18:52,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 249 transitions, 582 flow [2024-11-28 03:18:52,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 249 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:18:52,925 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 534 flow [2024-11-28 03:18:52,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2024-11-28 03:18:52,932 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2024-11-28 03:18:52,933 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 534 flow [2024-11-28 03:18:52,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:52,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:52,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:52,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:18:52,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:18:52,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash -155752517, now seen corresponding path program 1 times [2024-11-28 03:18:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510307441] [2024-11-28 03:18:52,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:52,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:53,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:53,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510307441] [2024-11-28 03:18:53,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510307441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:53,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:53,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743582838] [2024-11-28 03:18:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:53,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:53,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:53,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:53,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:53,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 234 [2024-11-28 03:18:53,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:53,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:53,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 234 [2024-11-28 03:18:53,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:53,546 INFO L124 PetriNetUnfolderBase]: 114/845 cut-off events. [2024-11-28 03:18:53,547 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2024-11-28 03:18:53,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 845 events. 114/845 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4476 event pairs, 72 based on Foata normal form. 4/793 useless extension candidates. Maximal degree in co-relation 1058. Up to 226 conditions per place. [2024-11-28 03:18:53,555 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 29 selfloop transitions, 7 changer transitions 0/247 dead transitions. [2024-11-28 03:18:53,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 634 flow [2024-11-28 03:18:53,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2024-11-28 03:18:53,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9373219373219374 [2024-11-28 03:18:53,560 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 534 flow. Second operand 3 states and 658 transitions. [2024-11-28 03:18:53,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 634 flow [2024-11-28 03:18:53,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:18:53,573 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 574 flow [2024-11-28 03:18:53,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2024-11-28 03:18:53,574 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2024-11-28 03:18:53,574 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 574 flow [2024-11-28 03:18:53,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:53,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:53,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:53,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:18:53,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:18:53,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:53,577 INFO L85 PathProgramCache]: Analyzing trace with hash -719251036, now seen corresponding path program 1 times [2024-11-28 03:18:53,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:53,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171628591] [2024-11-28 03:18:53,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:53,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:53,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171628591] [2024-11-28 03:18:53,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171628591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:53,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:53,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:53,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107895692] [2024-11-28 03:18:53,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:53,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:53,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:53,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:53,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:53,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 234 [2024-11-28 03:18:53,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:53,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:53,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 234 [2024-11-28 03:18:53,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:53,995 INFO L124 PetriNetUnfolderBase]: 83/766 cut-off events. [2024-11-28 03:18:53,996 INFO L125 PetriNetUnfolderBase]: For 65/69 co-relation queries the response was YES. [2024-11-28 03:18:53,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 766 events. 83/766 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3971 event pairs, 45 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 870. Up to 114 conditions per place. [2024-11-28 03:18:54,000 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 17 selfloop transitions, 3 changer transitions 1/249 dead transitions. [2024-11-28 03:18:54,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 249 transitions, 628 flow [2024-11-28 03:18:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2024-11-28 03:18:54,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544159544159544 [2024-11-28 03:18:54,004 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 574 flow. Second operand 3 states and 670 transitions. [2024-11-28 03:18:54,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 249 transitions, 628 flow [2024-11-28 03:18:54,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 249 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:18:54,016 INFO L231 Difference]: Finished difference. Result has 240 places, 245 transitions, 582 flow [2024-11-28 03:18:54,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=240, PETRI_TRANSITIONS=245} [2024-11-28 03:18:54,018 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 7 predicate places. [2024-11-28 03:18:54,018 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 245 transitions, 582 flow [2024-11-28 03:18:54,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:54,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:54,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:54,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:18:54,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:18:54,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:54,020 INFO L85 PathProgramCache]: Analyzing trace with hash -939637137, now seen corresponding path program 1 times [2024-11-28 03:18:54,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383148358] [2024-11-28 03:18:54,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383148358] [2024-11-28 03:18:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383148358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:54,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969822592] [2024-11-28 03:18:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:54,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:54,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:54,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:54,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:54,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 234 [2024-11-28 03:18:54,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 245 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:54,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:54,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 234 [2024-11-28 03:18:54,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:54,530 INFO L124 PetriNetUnfolderBase]: 92/781 cut-off events. [2024-11-28 03:18:54,530 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-11-28 03:18:54,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 781 events. 92/781 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4221 event pairs, 54 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 942. Up to 141 conditions per place. [2024-11-28 03:18:54,534 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 22 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2024-11-28 03:18:54,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 254 transitions, 658 flow [2024-11-28 03:18:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-28 03:18:54,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529914529914529 [2024-11-28 03:18:54,539 INFO L175 Difference]: Start difference. First operand has 240 places, 245 transitions, 582 flow. Second operand 3 states and 669 transitions. [2024-11-28 03:18:54,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 254 transitions, 658 flow [2024-11-28 03:18:54,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 254 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:18:54,548 INFO L231 Difference]: Finished difference. Result has 242 places, 248 transitions, 612 flow [2024-11-28 03:18:54,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=242, PETRI_TRANSITIONS=248} [2024-11-28 03:18:54,550 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 9 predicate places. [2024-11-28 03:18:54,550 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 248 transitions, 612 flow [2024-11-28 03:18:54,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:54,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:54,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:54,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:18:54,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:18:54,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:54,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1360885294, now seen corresponding path program 1 times [2024-11-28 03:18:54,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:54,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571151719] [2024-11-28 03:18:54,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:54,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:54,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:54,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571151719] [2024-11-28 03:18:54,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571151719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:54,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:54,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:54,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986254630] [2024-11-28 03:18:54,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:54,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:54,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:54,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:54,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:54,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 234 [2024-11-28 03:18:54,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 248 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:54,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:54,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 234 [2024-11-28 03:18:54,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:55,026 INFO L124 PetriNetUnfolderBase]: 159/965 cut-off events. [2024-11-28 03:18:55,026 INFO L125 PetriNetUnfolderBase]: For 209/216 co-relation queries the response was YES. [2024-11-28 03:18:55,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 965 events. 159/965 cut-off events. For 209/216 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5512 event pairs, 73 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 1423. Up to 275 conditions per place. [2024-11-28 03:18:55,032 INFO L140 encePairwiseOnDemand]: 227/234 looper letters, 29 selfloop transitions, 11 changer transitions 4/261 dead transitions. [2024-11-28 03:18:55,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 261 transitions, 734 flow [2024-11-28 03:18:55,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2024-11-28 03:18:55,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9472934472934473 [2024-11-28 03:18:55,035 INFO L175 Difference]: Start difference. First operand has 242 places, 248 transitions, 612 flow. Second operand 3 states and 665 transitions. [2024-11-28 03:18:55,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 261 transitions, 734 flow [2024-11-28 03:18:55,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 261 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:18:55,046 INFO L231 Difference]: Finished difference. Result has 244 places, 252 transitions, 678 flow [2024-11-28 03:18:55,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=244, PETRI_TRANSITIONS=252} [2024-11-28 03:18:55,048 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 11 predicate places. [2024-11-28 03:18:55,048 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 252 transitions, 678 flow [2024-11-28 03:18:55,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:55,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:55,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:55,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:18:55,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:18:55,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1912142957, now seen corresponding path program 1 times [2024-11-28 03:18:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:55,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768563987] [2024-11-28 03:18:55,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:55,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768563987] [2024-11-28 03:18:55,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768563987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:55,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:55,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:18:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669410997] [2024-11-28 03:18:55,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:55,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:18:55,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:55,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:18:55,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:18:55,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 234 [2024-11-28 03:18:55,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 252 transitions, 678 flow. Second operand has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:55,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:55,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 234 [2024-11-28 03:18:55,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:55,765 INFO L124 PetriNetUnfolderBase]: 140/883 cut-off events. [2024-11-28 03:18:55,765 INFO L125 PetriNetUnfolderBase]: For 289/296 co-relation queries the response was YES. [2024-11-28 03:18:55,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 883 events. 140/883 cut-off events. For 289/296 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4747 event pairs, 39 based on Foata normal form. 2/836 useless extension candidates. Maximal degree in co-relation 1328. Up to 139 conditions per place. [2024-11-28 03:18:55,771 INFO L140 encePairwiseOnDemand]: 227/234 looper letters, 29 selfloop transitions, 7 changer transitions 3/267 dead transitions. [2024-11-28 03:18:55,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 267 transitions, 774 flow [2024-11-28 03:18:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:18:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:18:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1307 transitions. [2024-11-28 03:18:55,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9309116809116809 [2024-11-28 03:18:55,776 INFO L175 Difference]: Start difference. First operand has 244 places, 252 transitions, 678 flow. Second operand 6 states and 1307 transitions. [2024-11-28 03:18:55,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 267 transitions, 774 flow [2024-11-28 03:18:55,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 267 transitions, 738 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-28 03:18:55,784 INFO L231 Difference]: Finished difference. Result has 244 places, 253 transitions, 664 flow [2024-11-28 03:18:55,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=664, PETRI_PLACES=244, PETRI_TRANSITIONS=253} [2024-11-28 03:18:55,787 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 11 predicate places. [2024-11-28 03:18:55,787 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 253 transitions, 664 flow [2024-11-28 03:18:55,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:55,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:55,789 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:55,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:18:55,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:18:55,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash 305904505, now seen corresponding path program 1 times [2024-11-28 03:18:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:55,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938139977] [2024-11-28 03:18:55,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:18:55,853 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:18:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:18:56,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:18:56,021 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:18:56,022 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-28 03:18:56,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-28 03:18:56,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-28 03:18:56,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-28 03:18:56,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-28 03:18:56,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-28 03:18:56,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-28 03:18:56,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-28 03:18:56,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-28 03:18:56,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-28 03:18:56,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-28 03:18:56,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:18:56,032 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:56,035 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-28 03:18:56,039 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-28 03:18:56,090 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:18:56,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 266 transitions, 542 flow [2024-11-28 03:18:56,155 INFO L124 PetriNetUnfolderBase]: 10/358 cut-off events. [2024-11-28 03:18:56,155 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 03:18:56,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 358 events. 10/358 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 416 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 277. Up to 6 conditions per place. [2024-11-28 03:18:56,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 266 transitions, 542 flow [2024-11-28 03:18:56,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 266 transitions, 542 flow [2024-11-28 03:18:56,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:18:56,160 INFO L333 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, 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;@4adf95f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:18:56,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-28 03:18:56,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:18:56,187 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events. [2024-11-28 03:18:56,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:18:56,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:56,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:56,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:18:56,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash 752323340, now seen corresponding path program 1 times [2024-11-28 03:18:56,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370662211] [2024-11-28 03:18:56,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:56,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:56,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370662211] [2024-11-28 03:18:56,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370662211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:56,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:56,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:56,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420118182] [2024-11-28 03:18:56,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:56,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:56,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:56,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:56,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:56,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 266 [2024-11-28 03:18:56,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 266 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:56,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:56,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 266 [2024-11-28 03:18:56,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:58,063 INFO L124 PetriNetUnfolderBase]: 2216/7107 cut-off events. [2024-11-28 03:18:58,063 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-28 03:18:58,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 7107 events. 2216/7107 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 68774 event pairs, 879 based on Foata normal form. 92/6440 useless extension candidates. Maximal degree in co-relation 9184. Up to 2089 conditions per place. [2024-11-28 03:18:58,115 INFO L140 encePairwiseOnDemand]: 248/266 looper letters, 46 selfloop transitions, 11 changer transitions 1/289 dead transitions. [2024-11-28 03:18:58,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 289 transitions, 707 flow [2024-11-28 03:18:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-11-28 03:18:58,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548872180451128 [2024-11-28 03:18:58,119 INFO L175 Difference]: Start difference. First operand has 267 places, 266 transitions, 542 flow. Second operand 3 states and 762 transitions. [2024-11-28 03:18:58,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 289 transitions, 707 flow [2024-11-28 03:18:58,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 289 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:18:58,126 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 630 flow [2024-11-28 03:18:58,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2024-11-28 03:18:58,128 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 4 predicate places. [2024-11-28 03:18:58,129 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 630 flow [2024-11-28 03:18:58,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:58,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:58,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:58,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:18:58,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:18:58,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1349693947, now seen corresponding path program 1 times [2024-11-28 03:18:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493640894] [2024-11-28 03:18:58,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:58,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:58,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493640894] [2024-11-28 03:18:58,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493640894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:58,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:58,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:58,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479558511] [2024-11-28 03:18:58,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:58,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:58,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:58,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:58,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:58,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 266 [2024-11-28 03:18:58,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:58,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:58,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 266 [2024-11-28 03:18:58,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:00,348 INFO L124 PetriNetUnfolderBase]: 2480/9018 cut-off events. [2024-11-28 03:19:00,348 INFO L125 PetriNetUnfolderBase]: For 2806/2976 co-relation queries the response was YES. [2024-11-28 03:19:00,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 9018 events. 2480/9018 cut-off events. For 2806/2976 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 94545 event pairs, 1597 based on Foata normal form. 62/8284 useless extension candidates. Maximal degree in co-relation 13582. Up to 3442 conditions per place. [2024-11-28 03:19:00,438 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 42 selfloop transitions, 12 changer transitions 0/291 dead transitions. [2024-11-28 03:19:00,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 291 transitions, 798 flow [2024-11-28 03:19:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:19:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-28 03:19:00,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-11-28 03:19:00,442 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 630 flow. Second operand 3 states and 746 transitions. [2024-11-28 03:19:00,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 291 transitions, 798 flow [2024-11-28 03:19:00,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 291 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:19:00,461 INFO L231 Difference]: Finished difference. Result has 272 places, 283 transitions, 714 flow [2024-11-28 03:19:00,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=272, PETRI_TRANSITIONS=283} [2024-11-28 03:19:00,463 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 5 predicate places. [2024-11-28 03:19:00,463 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 283 transitions, 714 flow [2024-11-28 03:19:00,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:00,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:00,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:00,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:19:00,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:00,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash 923270564, now seen corresponding path program 1 times [2024-11-28 03:19:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433746821] [2024-11-28 03:19:00,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:00,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433746821] [2024-11-28 03:19:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433746821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:00,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:00,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014860813] [2024-11-28 03:19:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:00,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:00,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:00,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:00,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 266 [2024-11-28 03:19:00,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 283 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:00,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:00,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 266 [2024-11-28 03:19:00,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:02,686 INFO L124 PetriNetUnfolderBase]: 1878/8140 cut-off events. [2024-11-28 03:19:02,686 INFO L125 PetriNetUnfolderBase]: For 1127/2075 co-relation queries the response was YES. [2024-11-28 03:19:02,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13070 conditions, 8140 events. 1878/8140 cut-off events. For 1127/2075 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 89259 event pairs, 1092 based on Foata normal form. 7/7222 useless extension candidates. Maximal degree in co-relation 11327. Up to 1725 conditions per place. [2024-11-28 03:19:02,754 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 28 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2024-11-28 03:19:02,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 294 transitions, 800 flow [2024-11-28 03:19:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:19:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-11-28 03:19:02,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511278195488722 [2024-11-28 03:19:02,758 INFO L175 Difference]: Start difference. First operand has 272 places, 283 transitions, 714 flow. Second operand 3 states and 759 transitions. [2024-11-28 03:19:02,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 294 transitions, 800 flow [2024-11-28 03:19:02,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 294 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:19:02,779 INFO L231 Difference]: Finished difference. Result has 274 places, 286 transitions, 720 flow [2024-11-28 03:19:02,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=274, PETRI_TRANSITIONS=286} [2024-11-28 03:19:02,783 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 7 predicate places. [2024-11-28 03:19:02,783 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 286 transitions, 720 flow [2024-11-28 03:19:02,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:02,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:02,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:02,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:19:02,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:02,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1717203910, now seen corresponding path program 1 times [2024-11-28 03:19:02,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:02,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859912521] [2024-11-28 03:19:02,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:02,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:02,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:02,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859912521] [2024-11-28 03:19:02,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859912521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:02,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:02,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436337890] [2024-11-28 03:19:02,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:02,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:02,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:02,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:02,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:02,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 266 [2024-11-28 03:19:02,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 286 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:02,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:02,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 266 [2024-11-28 03:19:02,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:05,741 INFO L124 PetriNetUnfolderBase]: 2430/10427 cut-off events. [2024-11-28 03:19:05,741 INFO L125 PetriNetUnfolderBase]: For 1615/2592 co-relation queries the response was YES. [2024-11-28 03:19:05,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17122 conditions, 10427 events. 2430/10427 cut-off events. For 1615/2592 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 122251 event pairs, 1418 based on Foata normal form. 11/9279 useless extension candidates. Maximal degree in co-relation 15284. Up to 2447 conditions per place. [2024-11-28 03:19:05,837 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 34 selfloop transitions, 7 changer transitions 0/302 dead transitions. [2024-11-28 03:19:05,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 302 transitions, 849 flow [2024-11-28 03:19:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:19:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-11-28 03:19:05,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511278195488722 [2024-11-28 03:19:05,840 INFO L175 Difference]: Start difference. First operand has 274 places, 286 transitions, 720 flow. Second operand 3 states and 759 transitions. [2024-11-28 03:19:05,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 302 transitions, 849 flow [2024-11-28 03:19:05,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 302 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:19:05,858 INFO L231 Difference]: Finished difference. Result has 276 places, 291 transitions, 768 flow [2024-11-28 03:19:05,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=276, PETRI_TRANSITIONS=291} [2024-11-28 03:19:05,860 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 9 predicate places. [2024-11-28 03:19:05,861 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 291 transitions, 768 flow [2024-11-28 03:19:05,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:05,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:05,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:05,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:19:05,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:05,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:05,864 INFO L85 PathProgramCache]: Analyzing trace with hash 248913777, now seen corresponding path program 1 times [2024-11-28 03:19:05,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:05,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401624345] [2024-11-28 03:19:05,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:06,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401624345] [2024-11-28 03:19:06,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401624345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:06,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:06,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:06,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202601093] [2024-11-28 03:19:06,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:06,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:06,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:06,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:06,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:06,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 266 [2024-11-28 03:19:06,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 291 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:06,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:06,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 266 [2024-11-28 03:19:06,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:08,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][272], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 210#L695-7true, 290#true, Black: 282#(= |#race~data~0| 0), 266#true, 226#L695-2true, 203#L712-1true, 285#true]) [2024-11-28 03:19:08,014 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-28 03:19:08,015 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-28 03:19:08,015 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-28 03:19:08,015 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-28 03:19:08,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 39#L697true, 290#true, 266#true, Black: 282#(= |#race~data~0| 0), 226#L695-2true, 203#L712-1true, 285#true]) [2024-11-28 03:19:08,283 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-28 03:19:08,283 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-28 03:19:08,283 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-28 03:19:08,283 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-28 03:19:08,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 290#true, 266#true, Black: 282#(= |#race~data~0| 0), 226#L695-2true, 264#L697-3true, 285#true, 203#L712-1true]) [2024-11-28 03:19:08,359 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-28 03:19:08,359 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-28 03:19:08,359 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-28 03:19:08,359 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-28 03:19:08,670 INFO L124 PetriNetUnfolderBase]: 4089/14024 cut-off events. [2024-11-28 03:19:08,670 INFO L125 PetriNetUnfolderBase]: For 5602/6006 co-relation queries the response was YES. [2024-11-28 03:19:08,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26408 conditions, 14024 events. 4089/14024 cut-off events. For 5602/6006 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 158842 event pairs, 2076 based on Foata normal form. 74/12674 useless extension candidates. Maximal degree in co-relation 22270. Up to 5204 conditions per place. [2024-11-28 03:19:08,756 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 49 selfloop transitions, 19 changer transitions 0/317 dead transitions. [2024-11-28 03:19:08,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 317 transitions, 1005 flow [2024-11-28 03:19:08,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:19:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-11-28 03:19:08,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9448621553884712 [2024-11-28 03:19:08,760 INFO L175 Difference]: Start difference. First operand has 276 places, 291 transitions, 768 flow. Second operand 3 states and 754 transitions. [2024-11-28 03:19:08,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 317 transitions, 1005 flow [2024-11-28 03:19:08,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 317 transitions, 991 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:19:08,770 INFO L231 Difference]: Finished difference. Result has 278 places, 306 transitions, 936 flow [2024-11-28 03:19:08,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=278, PETRI_TRANSITIONS=306} [2024-11-28 03:19:08,772 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2024-11-28 03:19:08,772 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 306 transitions, 936 flow [2024-11-28 03:19:08,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:08,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:08,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:08,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:19:08,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1904445474, now seen corresponding path program 1 times [2024-11-28 03:19:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069078684] [2024-11-28 03:19:08,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069078684] [2024-11-28 03:19:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069078684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:09,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:09,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:19:09,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452785936] [2024-11-28 03:19:09,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:09,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:19:09,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:09,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:19:09,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:19:09,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 266 [2024-11-28 03:19:09,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 306 transitions, 936 flow. Second operand has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:09,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:09,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 266 [2024-11-28 03:19:09,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:11,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][277], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 210#L695-7true, Black: 282#(= |#race~data~0| 0), 266#true, 290#true, 226#L695-2true, 295#true, 203#L712-1true]) [2024-11-28 03:19:11,123 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,123 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-28 03:19:11,123 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-28 03:19:11,123 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([568] L705-5-->L705-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][276], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 272#(= |#race~threads_alive~0| 0), 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 275#true, 63#L705-6true, 210#L695-7true, Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 226#L695-2true, 295#true]) [2024-11-28 03:19:11,243 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-28 03:19:11,243 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-28 03:19:11,243 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-28 03:19:11,243 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-28 03:19:11,306 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][277], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 210#L695-7true, Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 226#L695-2true, 203#L712-1true, 295#true]) [2024-11-28 03:19:11,307 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,307 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-28 03:19:11,307 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-28 03:19:11,307 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,307 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,328 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][277], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 210#L695-7true, 266#true, Black: 282#(= |#race~data~0| 0), 290#true, 226#L695-2true, 295#true, 203#L712-1true]) [2024-11-28 03:19:11,328 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,328 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,328 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-28 03:19:11,328 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-28 03:19:11,328 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,329 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][277], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, 200#L695-1true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 210#L695-7true, Black: 282#(= |#race~data~0| 0), 266#true, 290#true, 203#L712-1true, 295#true]) [2024-11-28 03:19:11,486 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-28 03:19:11,486 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-28 03:19:11,486 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-28 03:19:11,486 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-28 03:19:11,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 39#L697true, Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 226#L695-2true, 203#L712-1true, 295#true]) [2024-11-28 03:19:11,591 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-28 03:19:11,592 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-28 03:19:11,592 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-28 03:19:11,592 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-28 03:19:11,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 148#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 266#true, Black: 282#(= |#race~data~0| 0), 290#true, 226#L695-2true, 295#true, 203#L712-1true]) [2024-11-28 03:19:11,709 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,709 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,709 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-28 03:19:11,709 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-28 03:19:11,800 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 39#L697true, 266#true, 290#true, Black: 282#(= |#race~data~0| 0), 226#L695-2true, 295#true, 203#L712-1true]) [2024-11-28 03:19:11,801 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-28 03:19:11,801 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-28 03:19:11,801 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-28 03:19:11,801 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-28 03:19:11,801 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-28 03:19:11,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L695-3-->L695-4: Formula: (= (+ v_~threads_alive~0_7 1) |v_threadThread2of2ForFork0_#t~post5_3|) InVars {threadThread2of2ForFork0_#t~post5=|v_threadThread2of2ForFork0_#t~post5_3|} OutVars{threadThread2of2ForFork0_#t~post5=|v_threadThread2of2ForFork0_#t~post5_3|, ~threads_alive~0=v_~threads_alive~0_7} AuxVars[] AssignedVars[~threads_alive~0][293], [5#L695-4true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 241#L706-3true, Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 159#L695-4true, 295#true]) [2024-11-28 03:19:11,832 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-28 03:19:11,832 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-28 03:19:11,832 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-28 03:19:11,832 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-28 03:19:11,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([781] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 226#L695-2true, 264#L697-3true, 203#L712-1true, 295#true]) [2024-11-28 03:19:11,901 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-28 03:19:11,901 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-28 03:19:11,901 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-28 03:19:11,901 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-28 03:19:11,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L695-5-->L695-6: Formula: (= |v_#race~threads_alive~0_13| |v_threadThread1of2ForFork0_#t~nondet6_3|) InVars {threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_3|} OutVars{threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|} AuxVars[] AssignedVars[#race~threads_alive~0][224], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 272#(= |#race~threads_alive~0| 0), 268#true, 162#L695-6true, 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 290#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 282#(= |#race~data~0| 0), 266#true, 226#L695-2true, 295#true, 237#L706true]) [2024-11-28 03:19:11,917 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is not cut-off event [2024-11-28 03:19:11,917 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-11-28 03:19:11,917 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-11-28 03:19:11,917 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-11-28 03:19:12,463 INFO L124 PetriNetUnfolderBase]: 4694/16323 cut-off events. [2024-11-28 03:19:12,463 INFO L125 PetriNetUnfolderBase]: For 7360/8220 co-relation queries the response was YES. [2024-11-28 03:19:12,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31425 conditions, 16323 events. 4694/16323 cut-off events. For 7360/8220 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 194478 event pairs, 1723 based on Foata normal form. 75/14509 useless extension candidates. Maximal degree in co-relation 16806. Up to 4159 conditions per place. [2024-11-28 03:19:12,565 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 45 selfloop transitions, 9 changer transitions 2/336 dead transitions. [2024-11-28 03:19:12,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 336 transitions, 1108 flow [2024-11-28 03:19:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:19:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:19:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1480 transitions. [2024-11-28 03:19:12,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9273182957393483 [2024-11-28 03:19:12,570 INFO L175 Difference]: Start difference. First operand has 278 places, 306 transitions, 936 flow. Second operand 6 states and 1480 transitions. [2024-11-28 03:19:12,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 336 transitions, 1108 flow [2024-11-28 03:19:12,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 336 transitions, 1070 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:19:12,618 INFO L231 Difference]: Finished difference. Result has 283 places, 313 transitions, 949 flow [2024-11-28 03:19:12,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=283, PETRI_TRANSITIONS=313} [2024-11-28 03:19:12,620 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 16 predicate places. [2024-11-28 03:19:12,621 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 313 transitions, 949 flow [2024-11-28 03:19:12,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:12,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:12,623 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:12,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:19:12,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:12,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:12,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1883094061, now seen corresponding path program 1 times [2024-11-28 03:19:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:12,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586870030] [2024-11-28 03:19:12,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:12,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586870030] [2024-11-28 03:19:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586870030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:13,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:13,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:19:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46534639] [2024-11-28 03:19:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:13,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:19:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:13,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:19:13,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:19:13,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-11-28 03:19:13,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 313 transitions, 949 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:13,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:13,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-11-28 03:19:13,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:14,350 INFO L124 PetriNetUnfolderBase]: 321/2795 cut-off events. [2024-11-28 03:19:14,351 INFO L125 PetriNetUnfolderBase]: For 665/701 co-relation queries the response was YES. [2024-11-28 03:19:14,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4824 conditions, 2795 events. 321/2795 cut-off events. For 665/701 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 24130 event pairs, 119 based on Foata normal form. 86/2730 useless extension candidates. Maximal degree in co-relation 4242. Up to 283 conditions per place. [2024-11-28 03:19:14,364 INFO L140 encePairwiseOnDemand]: 254/266 looper letters, 11 selfloop transitions, 12 changer transitions 0/279 dead transitions. [2024-11-28 03:19:14,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 279 transitions, 770 flow [2024-11-28 03:19:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:19:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:19:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1253 transitions. [2024-11-28 03:19:14,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9421052631578948 [2024-11-28 03:19:14,368 INFO L175 Difference]: Start difference. First operand has 283 places, 313 transitions, 949 flow. Second operand 5 states and 1253 transitions. [2024-11-28 03:19:14,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 279 transitions, 770 flow [2024-11-28 03:19:14,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 279 transitions, 724 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-11-28 03:19:14,379 INFO L231 Difference]: Finished difference. Result has 277 places, 274 transitions, 687 flow [2024-11-28 03:19:14,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=687, PETRI_PLACES=277, PETRI_TRANSITIONS=274} [2024-11-28 03:19:14,382 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 10 predicate places. [2024-11-28 03:19:14,382 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 274 transitions, 687 flow [2024-11-28 03:19:14,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:14,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:14,383 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:14,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:19:14,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:14,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1617883130, now seen corresponding path program 1 times [2024-11-28 03:19:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058313733] [2024-11-28 03:19:14,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:14,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:14,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058313733] [2024-11-28 03:19:14,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058313733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:14,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:14,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264929518] [2024-11-28 03:19:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:14,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:14,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:14,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:14,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 266 [2024-11-28 03:19:14,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 274 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:14,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:14,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 266 [2024-11-28 03:19:14,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:15,336 INFO L124 PetriNetUnfolderBase]: 1083/4735 cut-off events. [2024-11-28 03:19:15,336 INFO L125 PetriNetUnfolderBase]: For 1575/1587 co-relation queries the response was YES. [2024-11-28 03:19:15,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8940 conditions, 4735 events. 1083/4735 cut-off events. For 1575/1587 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 45936 event pairs, 573 based on Foata normal form. 0/4438 useless extension candidates. Maximal degree in co-relation 8355. Up to 1492 conditions per place. [2024-11-28 03:19:15,359 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 34 selfloop transitions, 10 changer transitions 0/290 dead transitions. [2024-11-28 03:19:15,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 290 transitions, 839 flow [2024-11-28 03:19:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:19:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-11-28 03:19:15,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.949874686716792 [2024-11-28 03:19:15,362 INFO L175 Difference]: Start difference. First operand has 277 places, 274 transitions, 687 flow. Second operand 3 states and 758 transitions. [2024-11-28 03:19:15,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 290 transitions, 839 flow [2024-11-28 03:19:15,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 290 transitions, 818 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:19:15,488 INFO L231 Difference]: Finished difference. Result has 278 places, 280 transitions, 756 flow [2024-11-28 03:19:15,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=278, PETRI_TRANSITIONS=280} [2024-11-28 03:19:15,489 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2024-11-28 03:19:15,490 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 280 transitions, 756 flow [2024-11-28 03:19:15,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:15,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:15,491 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:15,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:19:15,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:15,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2073247065, now seen corresponding path program 1 times [2024-11-28 03:19:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:15,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896107864] [2024-11-28 03:19:15,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:15,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896107864] [2024-11-28 03:19:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896107864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:15,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:15,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:19:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777583502] [2024-11-28 03:19:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:15,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:15,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:15,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:15,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:15,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-11-28 03:19:15,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 280 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:15,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:15,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-11-28 03:19:15,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:16,843 INFO L124 PetriNetUnfolderBase]: 646/4760 cut-off events. [2024-11-28 03:19:16,843 INFO L125 PetriNetUnfolderBase]: For 1802/1955 co-relation queries the response was YES. [2024-11-28 03:19:16,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8534 conditions, 4760 events. 646/4760 cut-off events. For 1802/1955 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 50446 event pairs, 112 based on Foata normal form. 15/4561 useless extension candidates. Maximal degree in co-relation 7323. Up to 698 conditions per place. [2024-11-28 03:19:16,877 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 21 selfloop transitions, 9 changer transitions 0/293 dead transitions. [2024-11-28 03:19:16,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 293 transitions, 857 flow [2024-11-28 03:19:16,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:19:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2024-11-28 03:19:16,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-11-28 03:19:16,879 INFO L175 Difference]: Start difference. First operand has 278 places, 280 transitions, 756 flow. Second operand 3 states and 770 transitions. [2024-11-28 03:19:16,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 293 transitions, 857 flow [2024-11-28 03:19:16,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 293 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:19:16,890 INFO L231 Difference]: Finished difference. Result has 279 places, 287 transitions, 796 flow [2024-11-28 03:19:16,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=279, PETRI_TRANSITIONS=287} [2024-11-28 03:19:16,891 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 12 predicate places. [2024-11-28 03:19:16,892 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 287 transitions, 796 flow [2024-11-28 03:19:16,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:16,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:16,893 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:16,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:19:16,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:16,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash 340963807, now seen corresponding path program 2 times [2024-11-28 03:19:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265274776] [2024-11-28 03:19:16,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:19:16,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:16,955 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:19:16,957 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:19:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:17,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265274776] [2024-11-28 03:19:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265274776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:19:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921493857] [2024-11-28 03:19:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:17,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:19:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:17,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:19:17,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:19:17,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-11-28 03:19:17,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 287 transitions, 796 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:17,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:17,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-11-28 03:19:17,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:18,179 INFO L124 PetriNetUnfolderBase]: 296/2885 cut-off events. [2024-11-28 03:19:18,180 INFO L125 PetriNetUnfolderBase]: For 987/1175 co-relation queries the response was YES. [2024-11-28 03:19:18,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5182 conditions, 2885 events. 296/2885 cut-off events. For 987/1175 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 25810 event pairs, 48 based on Foata normal form. 63/2847 useless extension candidates. Maximal degree in co-relation 4186. Up to 322 conditions per place. [2024-11-28 03:19:18,201 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 28 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2024-11-28 03:19:18,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 293 transitions, 875 flow [2024-11-28 03:19:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:19:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:19:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1256 transitions. [2024-11-28 03:19:18,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9443609022556391 [2024-11-28 03:19:18,205 INFO L175 Difference]: Start difference. First operand has 279 places, 287 transitions, 796 flow. Second operand 5 states and 1256 transitions. [2024-11-28 03:19:18,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 293 transitions, 875 flow [2024-11-28 03:19:18,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 293 transitions, 862 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-28 03:19:18,215 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 759 flow [2024-11-28 03:19:18,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=282, PETRI_TRANSITIONS=282} [2024-11-28 03:19:18,217 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 15 predicate places. [2024-11-28 03:19:18,217 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 759 flow [2024-11-28 03:19:18,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:18,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:18,219 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:18,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:19:18,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:18,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash 369929360, now seen corresponding path program 1 times [2024-11-28 03:19:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:18,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446785622] [2024-11-28 03:19:18,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:18,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:18,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446785622] [2024-11-28 03:19:18,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446785622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:18,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:18,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:18,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021868120] [2024-11-28 03:19:18,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:18,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:18,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:18,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:18,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:18,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 266 [2024-11-28 03:19:18,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 282 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:18,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:18,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 266 [2024-11-28 03:19:18,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:19,070 INFO L124 PetriNetUnfolderBase]: 503/3655 cut-off events. [2024-11-28 03:19:19,071 INFO L125 PetriNetUnfolderBase]: For 2120/2364 co-relation queries the response was YES. [2024-11-28 03:19:19,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7229 conditions, 3655 events. 503/3655 cut-off events. For 2120/2364 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 35083 event pairs, 226 based on Foata normal form. 6/3506 useless extension candidates. Maximal degree in co-relation 6430. Up to 891 conditions per place. [2024-11-28 03:19:19,088 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 37 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2024-11-28 03:19:19,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 853 flow [2024-11-28 03:19:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:19:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2024-11-28 03:19:19,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235588972431078 [2024-11-28 03:19:19,091 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 759 flow. Second operand 3 states and 737 transitions. [2024-11-28 03:19:19,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 853 flow [2024-11-28 03:19:19,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 284 transitions, 841 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:19:19,100 INFO L231 Difference]: Finished difference. Result has 280 places, 281 transitions, 752 flow [2024-11-28 03:19:19,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=280, PETRI_TRANSITIONS=281} [2024-11-28 03:19:19,101 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 13 predicate places. [2024-11-28 03:19:19,102 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 281 transitions, 752 flow [2024-11-28 03:19:19,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:19,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:19,103 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:19,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:19:19,103 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:19,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:19,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1571999867, now seen corresponding path program 1 times [2024-11-28 03:19:19,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:19,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644904732] [2024-11-28 03:19:19,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:19,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:19,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644904732] [2024-11-28 03:19:19,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644904732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:19,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:19,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:19:19,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529510974] [2024-11-28 03:19:19,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:19,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:19:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:19,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:19:19,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:19:19,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 266 [2024-11-28 03:19:19,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 281 transitions, 752 flow. Second operand has 7 states, 7 states have (on average 239.57142857142858) internal successors, (1677), 7 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:19,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:19,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 266 [2024-11-28 03:19:19,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:20,292 INFO L124 PetriNetUnfolderBase]: 323/2359 cut-off events. [2024-11-28 03:19:20,292 INFO L125 PetriNetUnfolderBase]: For 1004/1066 co-relation queries the response was YES. [2024-11-28 03:19:20,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4534 conditions, 2359 events. 323/2359 cut-off events. For 1004/1066 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 18222 event pairs, 78 based on Foata normal form. 22/2301 useless extension candidates. Maximal degree in co-relation 3270. Up to 288 conditions per place. [2024-11-28 03:19:20,307 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 70 selfloop transitions, 14 changer transitions 12/333 dead transitions. [2024-11-28 03:19:20,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 333 transitions, 1161 flow [2024-11-28 03:19:20,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:19:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 03:19:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2210 transitions. [2024-11-28 03:19:20,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.923141186299081 [2024-11-28 03:19:20,312 INFO L175 Difference]: Start difference. First operand has 280 places, 281 transitions, 752 flow. Second operand 9 states and 2210 transitions. [2024-11-28 03:19:20,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 333 transitions, 1161 flow [2024-11-28 03:19:20,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 333 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:19:20,322 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 795 flow [2024-11-28 03:19:20,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=795, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2024-11-28 03:19:20,323 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 21 predicate places. [2024-11-28 03:19:20,323 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 795 flow [2024-11-28 03:19:20,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 239.57142857142858) internal successors, (1677), 7 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:20,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:20,325 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:20,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:19:20,325 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-28 03:19:20,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash -877544252, now seen corresponding path program 1 times [2024-11-28 03:19:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248914423] [2024-11-28 03:19:20,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:19:20,386 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:19:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:19:20,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:19:20,504 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:19:20,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-11-28 03:19:20,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-28 03:19:20,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-28 03:19:20,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-28 03:19:20,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-28 03:19:20,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-28 03:19:20,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-28 03:19:20,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-28 03:19:20,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-28 03:19:20,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-28 03:19:20,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-28 03:19:20,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-28 03:19:20,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-28 03:19:20,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-28 03:19:20,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:19:20,507 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:20,508 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-28 03:19:20,509 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-28 03:19:20,556 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:19:20,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 301 places, 298 transitions, 614 flow [2024-11-28 03:19:20,624 INFO L124 PetriNetUnfolderBase]: 13/440 cut-off events. [2024-11-28 03:19:20,625 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-28 03:19:20,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 440 events. 13/440 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 591 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 362. Up to 8 conditions per place. [2024-11-28 03:19:20,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 298 transitions, 614 flow [2024-11-28 03:19:20,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 298 transitions, 614 flow [2024-11-28 03:19:20,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:19:20,633 INFO L333 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, 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;@4adf95f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:19:20,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-28 03:19:20,645 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:19:20,645 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events. [2024-11-28 03:19:20,645 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:19:20,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:20,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:20,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-28 03:19:20,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash -305111220, now seen corresponding path program 1 times [2024-11-28 03:19:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:20,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304778575] [2024-11-28 03:19:20,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:20,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304778575] [2024-11-28 03:19:20,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304778575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:20,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:20,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146099551] [2024-11-28 03:19:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:20,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:20,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:20,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:20,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:20,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 298 [2024-11-28 03:19:20,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 298 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:20,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:20,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 298 [2024-11-28 03:19:20,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:33,927 INFO L124 PetriNetUnfolderBase]: 35239/82973 cut-off events. [2024-11-28 03:19:33,927 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-11-28 03:19:34,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133785 conditions, 82973 events. 35239/82973 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2926. Compared 1039712 event pairs, 14941 based on Foata normal form. 986/75082 useless extension candidates. Maximal degree in co-relation 112523. Up to 27933 conditions per place. [2024-11-28 03:19:34,485 INFO L140 encePairwiseOnDemand]: 276/298 looper letters, 60 selfloop transitions, 14 changer transitions 1/329 dead transitions. [2024-11-28 03:19:34,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 329 transitions, 836 flow [2024-11-28 03:19:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:19:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2024-11-28 03:19:34,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9496644295302014 [2024-11-28 03:19:34,489 INFO L175 Difference]: Start difference. First operand has 301 places, 298 transitions, 614 flow. Second operand 3 states and 849 transitions. [2024-11-28 03:19:34,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 329 transitions, 836 flow [2024-11-28 03:19:34,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 329 transitions, 832 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-28 03:19:34,503 INFO L231 Difference]: Finished difference. Result has 305 places, 308 transitions, 726 flow [2024-11-28 03:19:34,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=305, PETRI_TRANSITIONS=308} [2024-11-28 03:19:34,505 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 4 predicate places. [2024-11-28 03:19:34,505 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 308 transitions, 726 flow [2024-11-28 03:19:34,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:34,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:34,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:34,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 03:19:34,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-28 03:19:34,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash 186808431, now seen corresponding path program 1 times [2024-11-28 03:19:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:34,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968304220] [2024-11-28 03:19:34,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:34,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:34,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:34,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968304220] [2024-11-28 03:19:34,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968304220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:34,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:34,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:34,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343879337] [2024-11-28 03:19:34,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:34,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:34,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:34,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:34,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:34,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 298 [2024-11-28 03:19:34,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 308 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:34,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:34,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 298 [2024-11-28 03:19:34,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:19:41,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, 34#L691-3true, Black: 304#true, 227#L695-2true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:41,192 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, 34#L691-3true, Black: 304#true, 227#L695-2true, 298#true, 302#true, 138#L695-1true, 309#true, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:41,192 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, 34#L691-3true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 81#L695-1true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:41,192 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,192 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,516 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 81#L695-1true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:41,516 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-28 03:19:41,517 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,517 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,517 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-28 03:19:41,517 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,518 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 225#L712-1true, 227#L695-2true, Black: 304#true, 298#true, 302#true, 138#L695-1true, 309#true, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:41,519 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-28 03:19:41,519 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,519 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,519 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-28 03:19:41,519 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:19:41,823 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, 34#L691-3true, Black: 304#true, 227#L695-2true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:41,823 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-28 03:19:41,823 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-28 03:19:41,824 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-28 03:19:41,824 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-28 03:19:41,824 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-28 03:19:41,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, 34#L691-3true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:41,824 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-28 03:19:41,824 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-28 03:19:41,824 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-28 03:19:41,824 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-28 03:19:43,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, 34#L691-3true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 68#L695-6true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:43,764 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2024-11-28 03:19:43,764 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:43,764 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-28 03:19:43,764 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-28 03:19:43,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [34#L691-3true, 225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 149#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 237#L695-6true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:43,767 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2024-11-28 03:19:43,767 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-28 03:19:43,767 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:43,767 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-28 03:19:45,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, 34#L691-3true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 252#L697-3true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:45,438 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2024-11-28 03:19:45,438 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:19:45,438 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-28 03:19:45,438 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:19:45,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [34#L691-3true, 225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 149#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 126#L697-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:45,442 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2024-11-28 03:19:45,442 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-28 03:19:45,442 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:19:45,442 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:19:45,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, 227#L695-2true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 159#L693-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:45,445 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-28 03:19:45,445 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-28 03:19:45,445 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-28 03:19:45,445 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-28 03:19:45,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, Black: 304#true, 227#L695-2true, 298#true, 302#true, 309#true, 138#L695-1true, 300#true, 159#L693-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:45,445 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-28 03:19:45,445 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,445 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,445 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 159#L693-3true, 81#L695-1true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:45,446 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-28 03:19:45,446 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,446 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,446 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,852 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 159#L693-3true, 81#L695-1true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:45,852 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-28 03:19:45,852 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,852 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,852 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-28 03:19:45,852 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,856 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, Black: 304#true, 227#L695-2true, 298#true, 302#true, 309#true, 138#L695-1true, 300#true, 159#L693-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:45,856 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-28 03:19:45,856 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,856 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,856 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:19:45,856 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-28 03:19:46,330 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, 227#L695-2true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 159#L693-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:46,330 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-28 03:19:46,330 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-28 03:19:46,330 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-28 03:19:46,331 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-28 03:19:46,331 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-28 03:19:46,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 159#L693-3true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:46,331 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-28 03:19:46,331 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-28 03:19:46,331 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-28 03:19:46,332 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-28 03:19:46,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, 227#L695-2true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:46,335 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-28 03:19:46,335 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-28 03:19:46,335 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-28 03:19:46,335 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-28 03:19:46,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, Black: 304#true, 227#L695-2true, 298#true, 302#true, 309#true, 138#L695-1true, 300#true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:46,336 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-28 03:19:46,336 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:46,336 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:46,336 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:46,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 267#L694-3true, 81#L695-1true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:46,336 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-28 03:19:46,336 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:46,336 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:46,336 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:47,059 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 267#L694-3true, 81#L695-1true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:47,059 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-28 03:19:47,059 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-28 03:19:47,059 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:47,059 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:47,059 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:47,062 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, 227#L695-2true, Black: 304#true, 298#true, 302#true, 309#true, 138#L695-1true, 300#true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:47,062 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-28 03:19:47,062 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-28 03:19:47,062 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:47,062 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:47,062 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-28 03:19:47,431 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, Black: 304#true, 227#L695-2true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:47,431 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-28 03:19:47,431 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-28 03:19:47,431 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-28 03:19:47,431 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-28 03:19:47,431 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-28 03:19:47,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 245#L695-2true, 267#L694-3true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:47,432 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-28 03:19:47,432 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-28 03:19:47,432 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-28 03:19:47,432 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-28 03:19:48,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 159#L693-3true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 68#L695-6true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:48,557 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-28 03:19:48,557 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-28 03:19:48,557 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-28 03:19:48,557 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-28 03:19:48,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 149#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 159#L693-3true, 237#L695-6true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:48,562 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-28 03:19:48,562 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-28 03:19:48,562 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-28 03:19:48,562 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-28 03:19:49,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 68#L695-6true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:49,282 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2024-11-28 03:19:49,282 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-28 03:19:49,282 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-28 03:19:49,282 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-28 03:19:49,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 149#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 267#L694-3true, 306#(= |#race~threads_alive~0| 0), 237#L695-6true]) [2024-11-28 03:19:49,286 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2024-11-28 03:19:49,286 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-28 03:19:49,286 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-28 03:19:49,286 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-28 03:19:50,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 159#L693-3true, 252#L697-3true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:50,319 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2024-11-28 03:19:50,319 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-28 03:19:50,319 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-28 03:19:50,319 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-28 03:19:50,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 149#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 159#L693-3true, 126#L697-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:50,325 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2024-11-28 03:19:50,325 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-28 03:19:50,325 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-28 03:19:50,325 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-28 03:19:50,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 252#L697-3true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 267#L694-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:50,961 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2024-11-28 03:19:50,961 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-28 03:19:50,961 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2024-11-28 03:19:50,961 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-28 03:19:50,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 149#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 267#L694-3true, 126#L697-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:50,964 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2024-11-28 03:19:50,964 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-28 03:19:50,964 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-28 03:19:50,964 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2024-11-28 03:19:53,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [225#L712-1true, Black: 304#true, 298#true, 302#true, 160#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 309#true, 300#true, 252#L697-3true, 126#L697-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:53,932 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2024-11-28 03:19:53,932 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 03:19:53,932 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 03:19:53,932 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-28 03:19:53,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [278#L697-3true, 225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 252#L697-3true, 223#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:53,933 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2024-11-28 03:19:53,933 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 03:19:53,933 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 03:19:53,933 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-28 03:19:53,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [278#L697-3true, 225#L712-1true, Black: 304#true, 298#true, 302#true, 309#true, 300#true, 149#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 126#L697-3true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-28 03:19:53,936 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2024-11-28 03:19:53,936 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 03:19:53,936 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 03:19:53,936 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-28 03:19:54,133 INFO L124 PetriNetUnfolderBase]: 38618/104949 cut-off events. [2024-11-28 03:19:54,133 INFO L125 PetriNetUnfolderBase]: For 40146/43704 co-relation queries the response was YES. [2024-11-28 03:19:54,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197504 conditions, 104949 events. 38618/104949 cut-off events. For 40146/43704 co-relation queries the response was YES. Maximal size of possible extension queue 3242. Compared 1447467 event pairs, 24931 based on Foata normal form. 604/95312 useless extension candidates. Maximal degree in co-relation 195212. Up to 46398 conditions per place. [2024-11-28 03:19:54,759 INFO L140 encePairwiseOnDemand]: 288/298 looper letters, 55 selfloop transitions, 16 changer transitions 0/334 dead transitions. [2024-11-28 03:19:54,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 334 transitions, 956 flow [2024-11-28 03:19:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:19:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 834 transitions. [2024-11-28 03:19:54,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9328859060402684 [2024-11-28 03:19:54,762 INFO L175 Difference]: Start difference. First operand has 305 places, 308 transitions, 726 flow. Second operand 3 states and 834 transitions. [2024-11-28 03:19:54,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 334 transitions, 956 flow [2024-11-28 03:19:54,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 334 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:19:54,986 INFO L231 Difference]: Finished difference. Result has 306 places, 322 transitions, 844 flow [2024-11-28 03:19:54,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=306, PETRI_TRANSITIONS=322} [2024-11-28 03:19:54,987 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 5 predicate places. [2024-11-28 03:19:54,987 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 322 transitions, 844 flow [2024-11-28 03:19:54,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:54,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:19:54,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:54,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 03:19:54,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-28 03:19:54,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1310204324, now seen corresponding path program 1 times [2024-11-28 03:19:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880860278] [2024-11-28 03:19:54,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:55,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:55,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880860278] [2024-11-28 03:19:55,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880860278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:55,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:55,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:55,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74228771] [2024-11-28 03:19:55,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:55,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:55,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:55,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:55,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:55,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 298 [2024-11-28 03:19:55,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 322 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:55,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:19:55,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 298 [2024-11-28 03:19:55,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand