./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd --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 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:13:09,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:13:09,381 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-13 15:13:09,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:13:09,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:13:09,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:13:09,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:13:09,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:13:09,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:13:09,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:13:09,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:13:09,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:13:09,426 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:13:09,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:13:09,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:13:09,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:13:09,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:13:09,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:13:09,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:13:09,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:13:09,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:13:09,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:13:09,427 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 15:13:09,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:13:09,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:13:09,428 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:13:09,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:13:09,428 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:13:09,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:13:09,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:13:09,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:13:09,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:13:09,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:13:09,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:13:09,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:13:09,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:13:09,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:13:09,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:13:09,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:13:09,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:13:09,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:13:09,432 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_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd 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 -> 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac [2024-11-13 15:13:09,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:13:09,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:13:09,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:13:09,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:13:09,825 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:13:09,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i Unable to find full path for "g++" [2024-11-13 15:13:11,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:13:12,395 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:13:12,396 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i [2024-11-13 15:13:12,418 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/data/9e6eb387d/6a3f840ad919449ea1046d3e309c3603/FLAGcffb0572a [2024-11-13 15:13:12,541 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/data/9e6eb387d/6a3f840ad919449ea1046d3e309c3603 [2024-11-13 15:13:12,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:13:12,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:13:12,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:13:12,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:13:12,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:13:12,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:13:12" (1/1) ... [2024-11-13 15:13:12,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6486a88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:12, skipping insertion in model container [2024-11-13 15:13:12,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:13:12" (1/1) ... [2024-11-13 15:13:12,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:13:12,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:13:12,972 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:13:13,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:13:13,055 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:13:13,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13 WrapperNode [2024-11-13 15:13:13,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:13:13,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:13:13,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:13:13,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:13:13,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,093 INFO L138 Inliner]: procedures = 162, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2024-11-13 15:13:13,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:13:13,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:13:13,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:13:13,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:13:13,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:13:13,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:13:13,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:13:13,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:13:13,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (1/1) ... [2024-11-13 15:13:13,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:13:13,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:13:13,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:13:13,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:13:13,201 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 15:13:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:13:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 15:13:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 15:13:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-13 15:13:13,202 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-13 15:13:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 15:13:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:13:13,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:13:13,204 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 15:13:13,375 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:13:13,377 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:13:13,641 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 15:13:13,641 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:13:13,673 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:13:13,673 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 15:13:13,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:13:13 BoogieIcfgContainer [2024-11-13 15:13:13,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:13:13,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:13:13,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:13:13,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:13:13,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:13:12" (1/3) ... [2024-11-13 15:13:13,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62503982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:13:13, skipping insertion in model container [2024-11-13 15:13:13,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:13" (2/3) ... [2024-11-13 15:13:13,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62503982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:13:13, skipping insertion in model container [2024-11-13 15:13:13,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:13:13" (3/3) ... [2024-11-13 15:13:13,688 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race.i [2024-11-13 15:13:13,709 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:13:13,711 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race.i that has 2 procedures, 94 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2024-11-13 15:13:13,712 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 15:13:13,795 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 15:13:13,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 98 transitions, 200 flow [2024-11-13 15:13:13,911 INFO L124 PetriNetUnfolderBase]: 7/130 cut-off events. [2024-11-13 15:13:13,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:13:13,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 130 events. 7/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 187 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2024-11-13 15:13:13,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 98 transitions, 200 flow [2024-11-13 15:13:13,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 98 transitions, 200 flow [2024-11-13 15:13:13,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:13:13,954 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;@3a97e665, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:13:13,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-13 15:13:13,966 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 15:13:13,967 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-13 15:13:13,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:13:13,967 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:13,968 INFO L204 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] [2024-11-13 15:13:13,968 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-13 15:13:13,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash 203622760, now seen corresponding path program 1 times [2024-11-13 15:13:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164556068] [2024-11-13 15:13:13,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:14,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-13 15:13:14,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:14,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164556068] [2024-11-13 15:13:14,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164556068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:14,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:14,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:14,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551995686] [2024-11-13 15:13:14,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:14,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:14,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:14,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:14,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:14,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 98 [2024-11-13 15:13:14,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 98 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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-13 15:13:14,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:14,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 98 [2024-11-13 15:13:14,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:14,625 INFO L124 PetriNetUnfolderBase]: 32/296 cut-off events. [2024-11-13 15:13:14,626 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-13 15:13:14,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 296 events. 32/296 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1187 event pairs, 7 based on Foata normal form. 7/272 useless extension candidates. Maximal degree in co-relation 310. Up to 59 conditions per place. [2024-11-13 15:13:14,632 INFO L140 encePairwiseOnDemand]: 84/98 looper letters, 16 selfloop transitions, 8 changer transitions 1/105 dead transitions. [2024-11-13 15:13:14,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 105 transitions, 262 flow [2024-11-13 15:13:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2024-11-13 15:13:14,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935374149659864 [2024-11-13 15:13:14,654 INFO L175 Difference]: Start difference. First operand has 97 places, 98 transitions, 200 flow. Second operand 3 states and 275 transitions. [2024-11-13 15:13:14,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 105 transitions, 262 flow [2024-11-13 15:13:14,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 105 transitions, 262 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:13:14,669 INFO L231 Difference]: Finished difference. Result has 101 places, 102 transitions, 262 flow [2024-11-13 15:13:14,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=101, PETRI_TRANSITIONS=102} [2024-11-13 15:13:14,677 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places. [2024-11-13 15:13:14,677 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 102 transitions, 262 flow [2024-11-13 15:13:14,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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-13 15:13:14,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:14,678 INFO L204 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] [2024-11-13 15:13:14,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:13:14,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-13 15:13:14,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:14,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1275122866, now seen corresponding path program 1 times [2024-11-13 15:13:14,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:14,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29346631] [2024-11-13 15:13:14,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:14,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:14,788 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-13 15:13:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:14,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29346631] [2024-11-13 15:13:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29346631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:14,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:14,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283531300] [2024-11-13 15:13:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:14,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:14,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:14,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:14,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 98 [2024-11-13 15:13:14,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 102 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-13 15:13:14,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:14,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 98 [2024-11-13 15:13:14,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:14,896 INFO L124 PetriNetUnfolderBase]: 27/314 cut-off events. [2024-11-13 15:13:14,896 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-13 15:13:14,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 314 events. 27/314 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1387 event pairs, 6 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 361. Up to 45 conditions per place. [2024-11-13 15:13:14,899 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 8 selfloop transitions, 3 changer transitions 0/106 dead transitions. [2024-11-13 15:13:14,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 106 transitions, 292 flow [2024-11-13 15:13:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2024-11-13 15:13:14,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-11-13 15:13:14,901 INFO L175 Difference]: Start difference. First operand has 101 places, 102 transitions, 262 flow. Second operand 3 states and 276 transitions. [2024-11-13 15:13:14,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 106 transitions, 292 flow [2024-11-13 15:13:14,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 106 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:14,906 INFO L231 Difference]: Finished difference. Result has 102 places, 104 transitions, 268 flow [2024-11-13 15:13:14,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=102, PETRI_TRANSITIONS=104} [2024-11-13 15:13:14,907 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 5 predicate places. [2024-11-13 15:13:14,907 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 104 transitions, 268 flow [2024-11-13 15:13:14,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-13 15:13:14,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:14,908 INFO L204 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] [2024-11-13 15:13:14,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:13:14,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-13 15:13:14,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:14,913 INFO L85 PathProgramCache]: Analyzing trace with hash 677765209, now seen corresponding path program 1 times [2024-11-13 15:13:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110517103] [2024-11-13 15:13:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:15,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-13 15:13:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110517103] [2024-11-13 15:13:15,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110517103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:15,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:15,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141196064] [2024-11-13 15:13:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:15,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:15,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:15,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:15,084 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 98 [2024-11-13 15:13:15,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 104 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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-13 15:13:15,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:15,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 98 [2024-11-13 15:13:15,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:15,218 INFO L124 PetriNetUnfolderBase]: 54/459 cut-off events. [2024-11-13 15:13:15,220 INFO L125 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2024-11-13 15:13:15,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 459 events. 54/459 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2527 event pairs, 23 based on Foata normal form. 4/419 useless extension candidates. Maximal degree in co-relation 627. Up to 104 conditions per place. [2024-11-13 15:13:15,227 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 19 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2024-11-13 15:13:15,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 111 transitions, 340 flow [2024-11-13 15:13:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2024-11-13 15:13:15,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8979591836734694 [2024-11-13 15:13:15,233 INFO L175 Difference]: Start difference. First operand has 102 places, 104 transitions, 268 flow. Second operand 3 states and 264 transitions. [2024-11-13 15:13:15,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 111 transitions, 340 flow [2024-11-13 15:13:15,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 111 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:15,239 INFO L231 Difference]: Finished difference. Result has 104 places, 109 transitions, 318 flow [2024-11-13 15:13:15,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=104, PETRI_TRANSITIONS=109} [2024-11-13 15:13:15,243 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 7 predicate places. [2024-11-13 15:13:15,243 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 109 transitions, 318 flow [2024-11-13 15:13:15,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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-13 15:13:15,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:15,244 INFO L204 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] [2024-11-13 15:13:15,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:13:15,245 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-13 15:13:15,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash -991541723, now seen corresponding path program 1 times [2024-11-13 15:13:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:15,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127972148] [2024-11-13 15:13:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:15,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:15,391 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-13 15:13:15,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:15,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127972148] [2024-11-13 15:13:15,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127972148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:15,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:15,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388822986] [2024-11-13 15:13:15,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:15,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:15,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:15,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:15,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:15,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2024-11-13 15:13:15,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 109 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-13 15:13:15,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:15,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2024-11-13 15:13:15,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:15,517 INFO L124 PetriNetUnfolderBase]: 36/368 cut-off events. [2024-11-13 15:13:15,517 INFO L125 PetriNetUnfolderBase]: For 64/71 co-relation queries the response was YES. [2024-11-13 15:13:15,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 368 events. 36/368 cut-off events. For 64/71 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1942 event pairs, 9 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 493. Up to 51 conditions per place. [2024-11-13 15:13:15,522 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 8 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2024-11-13 15:13:15,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 112 transitions, 352 flow [2024-11-13 15:13:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2024-11-13 15:13:15,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9217687074829932 [2024-11-13 15:13:15,524 INFO L175 Difference]: Start difference. First operand has 104 places, 109 transitions, 318 flow. Second operand 3 states and 271 transitions. [2024-11-13 15:13:15,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 112 transitions, 352 flow [2024-11-13 15:13:15,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 112 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:15,532 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 340 flow [2024-11-13 15:13:15,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2024-11-13 15:13:15,534 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 9 predicate places. [2024-11-13 15:13:15,535 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 340 flow [2024-11-13 15:13:15,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-13 15:13:15,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:15,535 INFO L204 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] [2024-11-13 15:13:15,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:13:15,536 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-13 15:13:15,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 255827401, now seen corresponding path program 1 times [2024-11-13 15:13:15,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:15,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541298926] [2024-11-13 15:13:15,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:15,680 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-13 15:13:15,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:15,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541298926] [2024-11-13 15:13:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541298926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:15,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:15,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809343495] [2024-11-13 15:13:15,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:15,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:15,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:15,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:15,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:15,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 98 [2024-11-13 15:13:15,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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-13 15:13:15,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:15,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 98 [2024-11-13 15:13:15,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:15,839 INFO L124 PetriNetUnfolderBase]: 64/482 cut-off events. [2024-11-13 15:13:15,839 INFO L125 PetriNetUnfolderBase]: For 156/164 co-relation queries the response was YES. [2024-11-13 15:13:15,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 482 events. 64/482 cut-off events. For 156/164 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2696 event pairs, 13 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 796. Up to 109 conditions per place. [2024-11-13 15:13:15,843 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 16 selfloop transitions, 11 changer transitions 1/119 dead transitions. [2024-11-13 15:13:15,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 119 transitions, 422 flow [2024-11-13 15:13:15,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2024-11-13 15:13:15,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9081632653061225 [2024-11-13 15:13:15,845 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 340 flow. Second operand 3 states and 267 transitions. [2024-11-13 15:13:15,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 119 transitions, 422 flow [2024-11-13 15:13:15,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 119 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:15,854 INFO L231 Difference]: Finished difference. Result has 108 places, 118 transitions, 414 flow [2024-11-13 15:13:15,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=108, PETRI_TRANSITIONS=118} [2024-11-13 15:13:15,855 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 11 predicate places. [2024-11-13 15:13:15,858 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 118 transitions, 414 flow [2024-11-13 15:13:15,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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-13 15:13:15,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:15,858 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 15:13:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:13:15,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-13 15:13:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1840457047, now seen corresponding path program 1 times [2024-11-13 15:13:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839327125] [2024-11-13 15:13:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:13:15,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:13:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:13:15,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:13:15,979 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:13:15,980 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-13 15:13:15,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-13 15:13:15,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-13 15:13:15,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-13 15:13:15,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-13 15:13:15,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-13 15:13:15,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-13 15:13:15,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-13 15:13:15,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-13 15:13:15,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-13 15:13:15,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-13 15:13:15,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:13:15,986 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-13 15:13:15,989 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 15:13:15,989 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 15:13:16,042 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 15:13:16,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 126 transitions, 262 flow [2024-11-13 15:13:16,091 INFO L124 PetriNetUnfolderBase]: 10/198 cut-off events. [2024-11-13 15:13:16,091 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-13 15:13:16,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 198 events. 10/198 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 320 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 131. Up to 6 conditions per place. [2024-11-13 15:13:16,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 126 transitions, 262 flow [2024-11-13 15:13:16,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 126 transitions, 262 flow [2024-11-13 15:13:16,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:13:16,104 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;@3a97e665, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:13:16,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-13 15:13:16,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 15:13:16,117 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-13 15:13:16,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:13:16,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:16,117 INFO L204 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] [2024-11-13 15:13:16,117 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-13 15:13:16,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash 817989032, now seen corresponding path program 1 times [2024-11-13 15:13:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:16,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138334595] [2024-11-13 15:13:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:16,204 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-13 15:13:16,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:16,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138334595] [2024-11-13 15:13:16,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138334595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:16,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:16,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:16,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250706237] [2024-11-13 15:13:16,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:16,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:16,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:16,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:16,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:16,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2024-11-13 15:13:16,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 126 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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-13 15:13:16,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:16,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2024-11-13 15:13:16,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:16,812 INFO L124 PetriNetUnfolderBase]: 563/2348 cut-off events. [2024-11-13 15:13:16,812 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-13 15:13:16,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3378 conditions, 2348 events. 563/2348 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 19527 event pairs, 195 based on Foata normal form. 53/2144 useless extension candidates. Maximal degree in co-relation 2679. Up to 666 conditions per place. [2024-11-13 15:13:16,868 INFO L140 encePairwiseOnDemand]: 108/126 looper letters, 26 selfloop transitions, 11 changer transitions 1/139 dead transitions. [2024-11-13 15:13:16,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 139 transitions, 367 flow [2024-11-13 15:13:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2024-11-13 15:13:16,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9312169312169312 [2024-11-13 15:13:16,870 INFO L175 Difference]: Start difference. First operand has 127 places, 126 transitions, 262 flow. Second operand 3 states and 352 transitions. [2024-11-13 15:13:16,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 139 transitions, 367 flow [2024-11-13 15:13:16,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 139 transitions, 367 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:13:16,874 INFO L231 Difference]: Finished difference. Result has 131 places, 133 transitions, 350 flow [2024-11-13 15:13:16,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=131, PETRI_TRANSITIONS=133} [2024-11-13 15:13:16,877 INFO L277 CegarLoopForPetriNet]: 127 programPoint places, 4 predicate places. [2024-11-13 15:13:16,877 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 133 transitions, 350 flow [2024-11-13 15:13:16,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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-13 15:13:16,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:16,877 INFO L204 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] [2024-11-13 15:13:16,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:13:16,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-13 15:13:16,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash 817936142, now seen corresponding path program 1 times [2024-11-13 15:13:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:16,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771431028] [2024-11-13 15:13:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:16,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:16,937 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-13 15:13:16,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:16,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771431028] [2024-11-13 15:13:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771431028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:16,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:16,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537860662] [2024-11-13 15:13:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:16,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:16,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:16,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:16,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 126 [2024-11-13 15:13:16,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 133 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-13 15:13:16,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:16,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 126 [2024-11-13 15:13:16,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:17,489 INFO L124 PetriNetUnfolderBase]: 487/2655 cut-off events. [2024-11-13 15:13:17,489 INFO L125 PetriNetUnfolderBase]: For 239/249 co-relation queries the response was YES. [2024-11-13 15:13:17,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4057 conditions, 2655 events. 487/2655 cut-off events. For 239/249 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 24736 event pairs, 174 based on Foata normal form. 0/2373 useless extension candidates. Maximal degree in co-relation 3290. Up to 500 conditions per place. [2024-11-13 15:13:17,513 INFO L140 encePairwiseOnDemand]: 121/126 looper letters, 14 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2024-11-13 15:13:17,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 140 transitions, 400 flow [2024-11-13 15:13:17,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2024-11-13 15:13:17,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9391534391534392 [2024-11-13 15:13:17,515 INFO L175 Difference]: Start difference. First operand has 131 places, 133 transitions, 350 flow. Second operand 3 states and 355 transitions. [2024-11-13 15:13:17,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 140 transitions, 400 flow [2024-11-13 15:13:17,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:17,528 INFO L231 Difference]: Finished difference. Result has 132 places, 136 transitions, 358 flow [2024-11-13 15:13:17,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=132, PETRI_TRANSITIONS=136} [2024-11-13 15:13:17,530 INFO L277 CegarLoopForPetriNet]: 127 programPoint places, 5 predicate places. [2024-11-13 15:13:17,530 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 136 transitions, 358 flow [2024-11-13 15:13:17,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-13 15:13:17,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:17,530 INFO L204 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] [2024-11-13 15:13:17,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:13:17,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-13 15:13:17,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1138085143, now seen corresponding path program 1 times [2024-11-13 15:13:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:17,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938968302] [2024-11-13 15:13:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:17,597 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-13 15:13:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938968302] [2024-11-13 15:13:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938968302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:17,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:17,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834392667] [2024-11-13 15:13:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:17,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:17,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:17,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 126 [2024-11-13 15:13:17,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 136 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-13 15:13:17,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:17,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 126 [2024-11-13 15:13:17,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:17,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L704-4-->L704-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][40], [140#true, 37#L692-2true, Black: 130#true, 70#L704-1true, 135#true, 128#true, 84#L689-3true, Black: 137#(= |#race~data~0| 0), 126#true]) [2024-11-13 15:13:17,920 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-13 15:13:17,921 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-13 15:13:17,921 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-13 15:13:17,921 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-13 15:13:18,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L704-4-->L704-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][40], [8#L691-3true, 140#true, 37#L692-2true, Black: 130#true, 70#L704-1true, 135#true, 128#true, Black: 137#(= |#race~data~0| 0), 126#true]) [2024-11-13 15:13:18,166 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2024-11-13 15:13:18,166 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 15:13:18,166 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 15:13:18,167 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-13 15:13:18,567 INFO L124 PetriNetUnfolderBase]: 1078/4635 cut-off events. [2024-11-13 15:13:18,568 INFO L125 PetriNetUnfolderBase]: For 832/973 co-relation queries the response was YES. [2024-11-13 15:13:18,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7777 conditions, 4635 events. 1078/4635 cut-off events. For 832/973 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 46248 event pairs, 540 based on Foata normal form. 39/4076 useless extension candidates. Maximal degree in co-relation 6529. Up to 1374 conditions per place. [2024-11-13 15:13:18,599 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 28 selfloop transitions, 12 changer transitions 0/150 dead transitions. [2024-11-13 15:13:18,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 150 transitions, 482 flow [2024-11-13 15:13:18,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2024-11-13 15:13:18,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-13 15:13:18,602 INFO L175 Difference]: Start difference. First operand has 132 places, 136 transitions, 358 flow. Second operand 3 states and 342 transitions. [2024-11-13 15:13:18,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 150 transitions, 482 flow [2024-11-13 15:13:18,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 150 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:18,611 INFO L231 Difference]: Finished difference. Result has 134 places, 146 transitions, 456 flow [2024-11-13 15:13:18,612 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=134, PETRI_TRANSITIONS=146} [2024-11-13 15:13:18,614 INFO L277 CegarLoopForPetriNet]: 127 programPoint places, 7 predicate places. [2024-11-13 15:13:18,614 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 146 transitions, 456 flow [2024-11-13 15:13:18,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-13 15:13:18,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:18,615 INFO L204 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] [2024-11-13 15:13:18,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:13:18,615 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-13 15:13:18,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2087068456, now seen corresponding path program 1 times [2024-11-13 15:13:18,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:18,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188023267] [2024-11-13 15:13:18,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:18,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:18,681 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-13 15:13:18,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188023267] [2024-11-13 15:13:18,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188023267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:18,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:18,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:18,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758561492] [2024-11-13 15:13:18,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:18,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:18,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:18,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:18,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 126 [2024-11-13 15:13:18,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 146 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-13 15:13:18,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:18,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 126 [2024-11-13 15:13:18,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:19,287 INFO L124 PetriNetUnfolderBase]: 733/3804 cut-off events. [2024-11-13 15:13:19,288 INFO L125 PetriNetUnfolderBase]: For 988/1224 co-relation queries the response was YES. [2024-11-13 15:13:19,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6467 conditions, 3804 events. 733/3804 cut-off events. For 988/1224 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 39147 event pairs, 213 based on Foata normal form. 3/3337 useless extension candidates. Maximal degree in co-relation 4163. Up to 665 conditions per place. [2024-11-13 15:13:19,321 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 16 selfloop transitions, 7 changer transitions 0/154 dead transitions. [2024-11-13 15:13:19,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 154 transitions, 529 flow [2024-11-13 15:13:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2024-11-13 15:13:19,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2024-11-13 15:13:19,326 INFO L175 Difference]: Start difference. First operand has 134 places, 146 transitions, 456 flow. Second operand 3 states and 351 transitions. [2024-11-13 15:13:19,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 154 transitions, 529 flow [2024-11-13 15:13:19,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 154 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:19,336 INFO L231 Difference]: Finished difference. Result has 136 places, 151 transitions, 488 flow [2024-11-13 15:13:19,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=136, PETRI_TRANSITIONS=151} [2024-11-13 15:13:19,336 INFO L277 CegarLoopForPetriNet]: 127 programPoint places, 9 predicate places. [2024-11-13 15:13:19,336 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 151 transitions, 488 flow [2024-11-13 15:13:19,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-13 15:13:19,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:19,339 INFO L204 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] [2024-11-13 15:13:19,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:13:19,339 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-13 15:13:19,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash -68191580, now seen corresponding path program 1 times [2024-11-13 15:13:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:19,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498153938] [2024-11-13 15:13:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:19,413 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-13 15:13:19,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498153938] [2024-11-13 15:13:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498153938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:19,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:19,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:19,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618379006] [2024-11-13 15:13:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:19,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:19,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:19,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:19,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:19,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 126 [2024-11-13 15:13:19,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 151 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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-13 15:13:19,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:19,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 126 [2024-11-13 15:13:19,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:19,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L704-4-->L704-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][40], [Black: 142#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), Black: 147#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 37#L692-2true, Black: 130#true, 145#true, 70#L704-1true, 128#true, 84#L689-3true, Black: 137#(= |#race~data~0| 0), 126#true, 150#true]) [2024-11-13 15:13:19,743 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-13 15:13:19,743 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-13 15:13:19,743 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-13 15:13:19,743 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-13 15:13:19,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L704-4-->L704-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][40], [Black: 142#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 8#L691-3true, Black: 147#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 37#L692-2true, Black: 130#true, 145#true, 70#L704-1true, 128#true, Black: 137#(= |#race~data~0| 0), 126#true, 150#true]) [2024-11-13 15:13:19,978 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2024-11-13 15:13:19,979 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-13 15:13:19,979 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 15:13:19,979 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 15:13:20,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L704-4-->L704-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][124], [Black: 142#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 112#L692-2true, Black: 147#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#true, 145#true, 77#L692-7true, 70#L704-1true, 128#true, Black: 137#(= |#race~data~0| 0), 126#true, 150#true]) [2024-11-13 15:13:20,176 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-11-13 15:13:20,176 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-13 15:13:20,176 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-13 15:13:20,177 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-11-13 15:13:20,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L704-4-->L704-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][40], [Black: 142#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 112#L692-2true, Black: 147#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#true, 145#true, 70#L704-1true, 128#true, Black: 137#(= |#race~data~0| 0), 53#L693true, 126#true, 150#true]) [2024-11-13 15:13:20,273 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-13 15:13:20,273 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-13 15:13:20,273 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-13 15:13:20,274 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-13 15:13:20,403 INFO L124 PetriNetUnfolderBase]: 1587/6320 cut-off events. [2024-11-13 15:13:20,403 INFO L125 PetriNetUnfolderBase]: For 3287/3533 co-relation queries the response was YES. [2024-11-13 15:13:20,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12395 conditions, 6320 events. 1587/6320 cut-off events. For 3287/3533 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 66532 event pairs, 516 based on Foata normal form. 46/5555 useless extension candidates. Maximal degree in co-relation 10314. Up to 1835 conditions per place. [2024-11-13 15:13:20,459 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 31 selfloop transitions, 19 changer transitions 0/169 dead transitions. [2024-11-13 15:13:20,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 169 transitions, 673 flow [2024-11-13 15:13:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2024-11-13 15:13:20,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9153439153439153 [2024-11-13 15:13:20,461 INFO L175 Difference]: Start difference. First operand has 136 places, 151 transitions, 488 flow. Second operand 3 states and 346 transitions. [2024-11-13 15:13:20,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 169 transitions, 673 flow [2024-11-13 15:13:20,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 169 transitions, 659 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:20,468 INFO L231 Difference]: Finished difference. Result has 138 places, 166 transitions, 656 flow [2024-11-13 15:13:20,469 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=138, PETRI_TRANSITIONS=166} [2024-11-13 15:13:20,470 INFO L277 CegarLoopForPetriNet]: 127 programPoint places, 11 predicate places. [2024-11-13 15:13:20,470 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 166 transitions, 656 flow [2024-11-13 15:13:20,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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-13 15:13:20,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:20,470 INFO L204 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] [2024-11-13 15:13:20,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:13:20,471 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-13 15:13:20,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1314315002, now seen corresponding path program 1 times [2024-11-13 15:13:20,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:20,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725379277] [2024-11-13 15:13:20,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:20,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:13:20,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:20,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725379277] [2024-11-13 15:13:20,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725379277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:13:20,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038238189] [2024-11-13 15:13:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:20,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:13:20,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:13:20,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:13:20,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:13:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:20,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:13:20,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:13:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:13:20,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:13:20,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038238189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:20,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:13:20,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-13 15:13:20,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988404585] [2024-11-13 15:13:20,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:20,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:13:20,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:20,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:13:20,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:13:21,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2024-11-13 15:13:21,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 166 transitions, 656 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 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-13 15:13:21,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:21,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2024-11-13 15:13:21,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:22,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L704-4-->L704-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][130], [Black: 142#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 112#L692-2true, Black: 147#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#true, 77#L692-7true, 70#L704-1true, Black: 152#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 128#true, Black: 137#(= |#race~data~0| 0), 155#true, 126#true, 150#true]) [2024-11-13 15:13:22,237 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-11-13 15:13:22,238 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-13 15:13:22,238 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-11-13 15:13:22,238 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-13 15:13:22,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L704-4-->L704-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][130], [Black: 142#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 112#L692-2true, Black: 147#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#true, 77#L692-7true, 70#L704-1true, Black: 152#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 128#true, Black: 137#(= |#race~data~0| 0), 159#(<= 1 ~threads_alive~0), 126#true, 150#true]) [2024-11-13 15:13:22,243 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-11-13 15:13:22,243 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-11-13 15:13:22,243 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-13 15:13:22,243 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-13 15:13:22,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L704-4-->L704-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][40], [Black: 142#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 112#L692-2true, Black: 147#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#true, 70#L704-1true, 128#true, Black: 152#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 53#L693true, Black: 137#(= |#race~data~0| 0), 155#true, 126#true, 150#true]) [2024-11-13 15:13:22,499 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-13 15:13:22,499 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-13 15:13:22,500 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-13 15:13:22,500 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-13 15:13:22,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L704-4-->L704-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][40], [Black: 142#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 112#L692-2true, Black: 147#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#true, 70#L704-1true, Black: 152#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 128#true, Black: 137#(= |#race~data~0| 0), 53#L693true, 159#(<= 1 ~threads_alive~0), 126#true, 150#true]) [2024-11-13 15:13:22,503 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-13 15:13:22,503 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-13 15:13:22,503 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-13 15:13:22,503 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-13 15:13:22,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([301] L699-5-->L699-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][41], [112#L692-2true, Black: 147#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 132#(= |#race~threads_alive~0| 0), Black: 152#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 128#true, 64#L699-6true, Black: 137#(= |#race~data~0| 0), 53#L693true, 357#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 1 ~threads_alive~0)), 126#true, Black: 140#true, 150#true]) [2024-11-13 15:13:22,632 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is not cut-off event [2024-11-13 15:13:22,632 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-13 15:13:22,632 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-13 15:13:22,632 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-13 15:13:22,888 INFO L124 PetriNetUnfolderBase]: 2672/9887 cut-off events. [2024-11-13 15:13:22,888 INFO L125 PetriNetUnfolderBase]: For 7465/8465 co-relation queries the response was YES. [2024-11-13 15:13:22,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21294 conditions, 9887 events. 2672/9887 cut-off events. For 7465/8465 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 113717 event pairs, 391 based on Foata normal form. 101/8812 useless extension candidates. Maximal degree in co-relation 16258. Up to 2234 conditions per place. [2024-11-13 15:13:22,985 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 36 selfloop transitions, 14 changer transitions 2/201 dead transitions. [2024-11-13 15:13:22,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 201 transitions, 831 flow [2024-11-13 15:13:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:13:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 15:13:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 802 transitions. [2024-11-13 15:13:22,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.909297052154195 [2024-11-13 15:13:22,989 INFO L175 Difference]: Start difference. First operand has 138 places, 166 transitions, 656 flow. Second operand 7 states and 802 transitions. [2024-11-13 15:13:22,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 201 transitions, 831 flow [2024-11-13 15:13:23,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 201 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:23,033 INFO L231 Difference]: Finished difference. Result has 145 places, 179 transitions, 697 flow [2024-11-13 15:13:23,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=697, PETRI_PLACES=145, PETRI_TRANSITIONS=179} [2024-11-13 15:13:23,034 INFO L277 CegarLoopForPetriNet]: 127 programPoint places, 18 predicate places. [2024-11-13 15:13:23,034 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 179 transitions, 697 flow [2024-11-13 15:13:23,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 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-13 15:13:23,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:23,035 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 15:13:23,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:13:23,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 15:13:23,239 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-13 15:13:23,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2033870034, now seen corresponding path program 1 times [2024-11-13 15:13:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:23,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026160113] [2024-11-13 15:13:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:13:23,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:13:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:13:23,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:13:23,305 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:13:23,305 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-11-13 15:13:23,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-13 15:13:23,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-13 15:13:23,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-13 15:13:23,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-13 15:13:23,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2024-11-13 15:13:23,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-13 15:13:23,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-13 15:13:23,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-13 15:13:23,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-13 15:13:23,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-13 15:13:23,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-13 15:13:23,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-13 15:13:23,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-13 15:13:23,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:13:23,308 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:13:23,393 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-13 15:13:23,394 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:13:23,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:13:23 BasicIcfg [2024-11-13 15:13:23,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:13:23,407 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:13:23,407 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:13:23,408 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:13:23,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:13:13" (3/4) ... [2024-11-13 15:13:23,411 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 15:13:23,486 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 15:13:23,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:13:23,488 INFO L158 Benchmark]: Toolchain (without parser) took 10941.24ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 118.4MB in the beginning and 339.6MB in the end (delta: -221.2MB). Peak memory consumption was 264.1MB. Max. memory is 16.1GB. [2024-11-13 15:13:23,488 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 142.6MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:13:23,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.56ms. Allocated memory is still 142.6MB. Free memory was 118.2MB in the beginning and 98.7MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:13:23,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.41ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:13:23,489 INFO L158 Benchmark]: Boogie Preprocessor took 31.95ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 96.0MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:13:23,490 INFO L158 Benchmark]: RCFGBuilder took 546.48ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 81.9MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:13:23,490 INFO L158 Benchmark]: TraceAbstraction took 9728.55ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 81.4MB in the beginning and 348.0MB in the end (delta: -266.6MB). Peak memory consumption was 222.2MB. Max. memory is 16.1GB. [2024-11-13 15:13:23,491 INFO L158 Benchmark]: Witness Printer took 79.16ms. Allocated memory is still 629.1MB. Free memory was 348.0MB in the beginning and 339.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:13:23,493 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 142.6MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.56ms. Allocated memory is still 142.6MB. Free memory was 118.2MB in the beginning and 98.7MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.41ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.95ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 96.0MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 546.48ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 81.9MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9728.55ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 81.4MB in the beginning and 348.0MB in the end (delta: -266.6MB). Peak memory consumption was 222.2MB. Max. memory is 16.1GB. * Witness Printer took 79.16ms. Allocated memory is still 629.1MB. Free memory was 348.0MB in the beginning and 339.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = 0; VAL [threads_alive=0] [L686] 0 int data = 0; VAL [data=0, threads_alive=0] [L687] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}, threads_alive=0] [L696] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_alive=0, threads_total=2] [L697] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}, threads_alive=0] [L697] RET 0 assume_abort_if_not(threads_total >= 0) [L698] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L699] 0 threads_alive++ VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L700] 0 pthread_t tid; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L701] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid=-1] [L690] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L698] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2] Now there is a data race on ~threads_alive~0 between C: threads_alive++ [699] and C: threads_alive-- [692] - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 123 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 18 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 151 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 50 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=697occurred in iteration=6, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 553 SizeOfPredicates, 2 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-13 15:13:23,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e1b9be-a31e-4346-88de-3c75f859fb24/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE