./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d8eafef4fba87d23f577048e1519c0d9e44fde0c61d244f4e4b6ada90f00cba8 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:09:43,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:09:43,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:09:43,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:09:43,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:09:43,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:09:43,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:09:43,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:09:43,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:09:43,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:09:43,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:09:43,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:09:43,483 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:09:43,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:09:43,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:09:43,483 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:09:43,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:09:43,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:09:43,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:43,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:43,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:43,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:09:43,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:43,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:43,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:43,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:09:43,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:09:43,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:09:43,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:09:43,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:09:43,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:09:43,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:09:43,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:09:43,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:09:43,486 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d8eafef4fba87d23f577048e1519c0d9e44fde0c61d244f4e4b6ada90f00cba8 [2025-04-29 11:09:43,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:09:43,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:09:43,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:09:43,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:09:43,718 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:09:43,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.c [2025-04-29 11:09:45,008 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d894a64/f24583554a384b4b84f506196d7c1a8a/FLAG5b682ff17 [2025-04-29 11:09:45,222 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:09:45,223 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.c [2025-04-29 11:09:45,224 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:45,225 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:45,225 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:45,230 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d894a64/f24583554a384b4b84f506196d7c1a8a/FLAG5b682ff17 [2025-04-29 11:09:46,009 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d894a64/f24583554a384b4b84f506196d7c1a8a [2025-04-29 11:09:46,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:09:46,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:09:46,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:46,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:09:46,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:09:46,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a3a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46, skipping insertion in model container [2025-04-29 11:09:46,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:09:46,194 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:46,207 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:09:46,230 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:46,241 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:09:46,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46 WrapperNode [2025-04-29 11:09:46,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:46,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:46,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:09:46,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:09:46,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,281 INFO L138 Inliner]: procedures = 15, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2025-04-29 11:09:46,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:46,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:09:46,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:09:46,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:09:46,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:09:46,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:09:46,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:09:46,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:09:46,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (1/1) ... [2025-04-29 11:09:46,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:46,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:46,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:09:46,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:09:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:09:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:09:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:09:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:09:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:09:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:09:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:09:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:09:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:09:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:09:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:09:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:09:46,363 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:09:46,438 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:09:46,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:09:46,684 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:09:46,684 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:09:46,708 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:09:46,709 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:09:46,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:46 BoogieIcfgContainer [2025-04-29 11:09:46,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:09:46,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:09:46,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:09:46,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:09:46,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:09:46" (1/3) ... [2025-04-29 11:09:46,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6afbc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:46, skipping insertion in model container [2025-04-29 11:09:46,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:46" (2/3) ... [2025-04-29 11:09:46,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6afbc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:46, skipping insertion in model container [2025-04-29 11:09:46,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:46" (3/3) ... [2025-04-29 11:09:46,717 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_28-list2alloc.c [2025-04-29 11:09:46,727 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:09:46,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_28-list2alloc.c that has 2 procedures, 170 locations, 168 edges, 1 initial locations, 0 loop locations, and 14 error locations. [2025-04-29 11:09:46,729 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:09:46,791 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:09:46,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 169 transitions, 342 flow [2025-04-29 11:09:46,876 INFO L116 PetriNetUnfolderBase]: 0/168 cut-off events. [2025-04-29 11:09:46,879 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:46,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 168 events. 0/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:09:46,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 169 transitions, 342 flow [2025-04-29 11:09:46,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 168 transitions, 339 flow [2025-04-29 11:09:46,892 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:09:46,906 INFO L340 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;@4c74ba3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:09:46,907 INFO L341 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-04-29 11:09:46,915 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:09:46,915 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:09:46,915 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:46,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:46,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:46,916 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:09:46,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2111381359, now seen corresponding path program 1 times [2025-04-29 11:09:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:46,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835188211] [2025-04-29 11:09:46,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:46,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:46,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:09:47,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:09:47,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:47,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:47,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:47,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835188211] [2025-04-29 11:09:47,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835188211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:47,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:47,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406687415] [2025-04-29 11:09:47,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:47,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:47,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:47,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:47,725 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 169 [2025-04-29 11:09:47,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:47,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:47,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 169 [2025-04-29 11:09:47,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:47,909 INFO L116 PetriNetUnfolderBase]: 120/622 cut-off events. [2025-04-29 11:09:47,909 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:47,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 622 events. 120/622 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2687 event pairs, 120 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 801. Up to 278 conditions per place. [2025-04-29 11:09:47,916 INFO L140 encePairwiseOnDemand]: 157/169 looper letters, 37 selfloop transitions, 10 changer transitions 0/166 dead transitions. [2025-04-29 11:09:47,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 166 transitions, 429 flow [2025-04-29 11:09:47,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2025-04-29 11:09:47,934 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7583826429980276 [2025-04-29 11:09:47,937 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 339 flow. Second operand 6 states and 769 transitions. [2025-04-29 11:09:47,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 166 transitions, 429 flow [2025-04-29 11:09:47,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 166 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:47,945 INFO L231 Difference]: Finished difference. Result has 174 places, 166 transitions, 354 flow [2025-04-29 11:09:47,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=354, PETRI_PLACES=174, PETRI_TRANSITIONS=166} [2025-04-29 11:09:47,950 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 2 predicate places. [2025-04-29 11:09:47,951 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 354 flow [2025-04-29 11:09:47,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:47,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:47,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:47,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:09:47,952 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:09:47,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1062760487, now seen corresponding path program 1 times [2025-04-29 11:09:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:47,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387758751] [2025-04-29 11:09:47,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:47,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:09:47,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:09:47,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:47,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:48,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387758751] [2025-04-29 11:09:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387758751] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:48,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:48,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:48,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927593744] [2025-04-29 11:09:48,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:48,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:48,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:48,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:48,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:48,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 169 [2025-04-29 11:09:48,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 166 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:48,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:48,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 169 [2025-04-29 11:09:48,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:48,592 INFO L116 PetriNetUnfolderBase]: 120/620 cut-off events. [2025-04-29 11:09:48,592 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:48,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 620 events. 120/620 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2683 event pairs, 120 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 835. Up to 278 conditions per place. [2025-04-29 11:09:48,596 INFO L140 encePairwiseOnDemand]: 157/169 looper letters, 37 selfloop transitions, 10 changer transitions 0/164 dead transitions. [2025-04-29 11:09:48,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 164 transitions, 444 flow [2025-04-29 11:09:48,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2025-04-29 11:09:48,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7583826429980276 [2025-04-29 11:09:48,600 INFO L175 Difference]: Start difference. First operand has 174 places, 166 transitions, 354 flow. Second operand 6 states and 769 transitions. [2025-04-29 11:09:48,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 164 transitions, 444 flow [2025-04-29 11:09:48,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 164 transitions, 424 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:48,605 INFO L231 Difference]: Finished difference. Result has 172 places, 164 transitions, 350 flow [2025-04-29 11:09:48,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=172, PETRI_TRANSITIONS=164} [2025-04-29 11:09:48,607 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 0 predicate places. [2025-04-29 11:09:48,607 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 164 transitions, 350 flow [2025-04-29 11:09:48,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:48,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:48,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:48,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:09:48,608 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:09:48,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1151880309, now seen corresponding path program 1 times [2025-04-29 11:09:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:48,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45424524] [2025-04-29 11:09:48,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:48,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:48,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:09:48,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:09:48,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:48,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:48,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:48,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45424524] [2025-04-29 11:09:48,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45424524] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:48,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:48,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:09:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917140988] [2025-04-29 11:09:48,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:48,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:48,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:48,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:48,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:48,659 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 169 [2025-04-29 11:09:48,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 164 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:48,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:48,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 169 [2025-04-29 11:09:48,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:48,716 INFO L116 PetriNetUnfolderBase]: 20/399 cut-off events. [2025-04-29 11:09:48,717 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:48,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 399 events. 20/399 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1264 event pairs, 20 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 382. Up to 54 conditions per place. [2025-04-29 11:09:48,719 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 13 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-04-29 11:09:48,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 163 transitions, 378 flow [2025-04-29 11:09:48,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-04-29 11:09:48,720 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9368836291913215 [2025-04-29 11:09:48,720 INFO L175 Difference]: Start difference. First operand has 172 places, 164 transitions, 350 flow. Second operand 3 states and 475 transitions. [2025-04-29 11:09:48,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 163 transitions, 378 flow [2025-04-29 11:09:48,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 163 transitions, 358 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:48,725 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 332 flow [2025-04-29 11:09:48,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2025-04-29 11:09:48,726 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -4 predicate places. [2025-04-29 11:09:48,726 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 332 flow [2025-04-29 11:09:48,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:48,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:48,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:48,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:09:48,727 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:09:48,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1953956708, now seen corresponding path program 1 times [2025-04-29 11:09:48,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:48,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783480880] [2025-04-29 11:09:48,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:48,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:48,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:09:48,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:09:48,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:48,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:48,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:48,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783480880] [2025-04-29 11:09:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783480880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:48,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:09:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428375400] [2025-04-29 11:09:48,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:48,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:48,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:48,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:48,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 169 [2025-04-29 11:09:48,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:48,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:48,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 169 [2025-04-29 11:09:48,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:48,837 INFO L116 PetriNetUnfolderBase]: 15/339 cut-off events. [2025-04-29 11:09:48,837 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:48,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 339 events. 15/339 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 900 event pairs, 15 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 338. Up to 43 conditions per place. [2025-04-29 11:09:48,838 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 12 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2025-04-29 11:09:48,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 358 flow [2025-04-29 11:09:48,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-04-29 11:09:48,839 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9408284023668639 [2025-04-29 11:09:48,840 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 332 flow. Second operand 3 states and 477 transitions. [2025-04-29 11:09:48,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 358 flow [2025-04-29 11:09:48,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 162 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:09:48,842 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 330 flow [2025-04-29 11:09:48,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2025-04-29 11:09:48,842 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -5 predicate places. [2025-04-29 11:09:48,842 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 330 flow [2025-04-29 11:09:48,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:48,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:48,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:48,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:09:48,846 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:09:48,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:48,847 INFO L85 PathProgramCache]: Analyzing trace with hash -116501249, now seen corresponding path program 1 times [2025-04-29 11:09:48,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:48,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066015206] [2025-04-29 11:09:48,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:48,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:48,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-29 11:09:48,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-29 11:09:48,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:48,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:48,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:48,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066015206] [2025-04-29 11:09:48,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066015206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:48,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:48,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:09:48,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606359452] [2025-04-29 11:09:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:48,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:48,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:48,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:48,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 169 [2025-04-29 11:09:48,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:48,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:48,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 169 [2025-04-29 11:09:48,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:48,946 INFO L116 PetriNetUnfolderBase]: 24/345 cut-off events. [2025-04-29 11:09:48,947 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:48,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 345 events. 24/345 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 914 event pairs, 13 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 327. Up to 54 conditions per place. [2025-04-29 11:09:48,948 INFO L140 encePairwiseOnDemand]: 165/169 looper letters, 14 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-04-29 11:09:48,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 164 transitions, 366 flow [2025-04-29 11:09:48,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-04-29 11:09:48,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9526627218934911 [2025-04-29 11:09:48,949 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 330 flow. Second operand 3 states and 483 transitions. [2025-04-29 11:09:48,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 164 transitions, 366 flow [2025-04-29 11:09:48,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 164 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:09:48,954 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 336 flow [2025-04-29 11:09:48,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=166, PETRI_TRANSITIONS=162} [2025-04-29 11:09:48,956 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, -6 predicate places. [2025-04-29 11:09:48,957 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 336 flow [2025-04-29 11:09:48,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:48,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:48,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:48,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:09:48,958 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:09:48,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1958116291, now seen corresponding path program 1 times [2025-04-29 11:09:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:48,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334713523] [2025-04-29 11:09:48,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:48,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-29 11:09:48,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-29 11:09:48,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:48,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:49,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:49,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334713523] [2025-04-29 11:09:49,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334713523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:49,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:49,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631823958] [2025-04-29 11:09:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:49,300 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:49,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:49,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:49,470 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 169 [2025-04-29 11:09:49,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:49,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:49,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 169 [2025-04-29 11:09:49,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:49,606 INFO L116 PetriNetUnfolderBase]: 129/673 cut-off events. [2025-04-29 11:09:49,607 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:49,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 673 events. 129/673 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3100 event pairs, 78 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 887. Up to 258 conditions per place. [2025-04-29 11:09:49,609 INFO L140 encePairwiseOnDemand]: 158/169 looper letters, 51 selfloop transitions, 22 changer transitions 0/191 dead transitions. [2025-04-29 11:09:49,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 191 transitions, 540 flow [2025-04-29 11:09:49,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2025-04-29 11:09:49,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8126232741617357 [2025-04-29 11:09:49,612 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 336 flow. Second operand 6 states and 824 transitions. [2025-04-29 11:09:49,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 191 transitions, 540 flow [2025-04-29 11:09:49,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 191 transitions, 540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:49,614 INFO L231 Difference]: Finished difference. Result has 176 places, 183 transitions, 486 flow [2025-04-29 11:09:49,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=176, PETRI_TRANSITIONS=183} [2025-04-29 11:09:49,617 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 4 predicate places. [2025-04-29 11:09:49,617 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 183 transitions, 486 flow [2025-04-29 11:09:49,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:49,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:49,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:49,617 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:09:49,618 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:09:49,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:49,619 INFO L85 PathProgramCache]: Analyzing trace with hash -27035854, now seen corresponding path program 1 times [2025-04-29 11:09:49,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:49,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11922371] [2025-04-29 11:09:49,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:49,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-29 11:09:49,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-29 11:09:49,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:49,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:50,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:50,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11922371] [2025-04-29 11:09:50,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11922371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:50,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:50,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:50,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060157003] [2025-04-29 11:09:50,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:50,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:50,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:50,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:50,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:50,133 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2025-04-29 11:09:50,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 183 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:50,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:50,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2025-04-29 11:09:50,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:50,354 INFO L116 PetriNetUnfolderBase]: 394/1363 cut-off events. [2025-04-29 11:09:50,354 INFO L117 PetriNetUnfolderBase]: For 260/274 co-relation queries the response was YES. [2025-04-29 11:09:50,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 1363 events. 394/1363 cut-off events. For 260/274 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7543 event pairs, 142 based on Foata normal form. 4/1276 useless extension candidates. Maximal degree in co-relation 2554. Up to 686 conditions per place. [2025-04-29 11:09:50,359 INFO L140 encePairwiseOnDemand]: 146/169 looper letters, 78 selfloop transitions, 84 changer transitions 4/278 dead transitions. [2025-04-29 11:09:50,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 278 transitions, 1102 flow [2025-04-29 11:09:50,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2025-04-29 11:09:50,361 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-04-29 11:09:50,361 INFO L175 Difference]: Start difference. First operand has 176 places, 183 transitions, 486 flow. Second operand 6 states and 845 transitions. [2025-04-29 11:09:50,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 278 transitions, 1102 flow [2025-04-29 11:09:50,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 278 transitions, 1102 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:50,366 INFO L231 Difference]: Finished difference. Result has 186 places, 262 transitions, 1132 flow [2025-04-29 11:09:50,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1132, PETRI_PLACES=186, PETRI_TRANSITIONS=262} [2025-04-29 11:09:50,367 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 14 predicate places. [2025-04-29 11:09:50,367 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 262 transitions, 1132 flow [2025-04-29 11:09:50,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:50,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:50,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:50,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:09:50,368 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:09:50,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2002361416, now seen corresponding path program 1 times [2025-04-29 11:09:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:50,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387115837] [2025-04-29 11:09:50,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:50,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-29 11:09:50,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-29 11:09:50,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:50,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:50,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:50,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387115837] [2025-04-29 11:09:50,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387115837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:50,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:50,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:50,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639170589] [2025-04-29 11:09:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:50,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:50,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:50,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:50,831 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 169 [2025-04-29 11:09:50,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 262 transitions, 1132 flow. Second operand has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:50,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:50,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 169 [2025-04-29 11:09:50,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:51,028 INFO L116 PetriNetUnfolderBase]: 344/1216 cut-off events. [2025-04-29 11:09:51,029 INFO L117 PetriNetUnfolderBase]: For 760/772 co-relation queries the response was YES. [2025-04-29 11:09:51,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3230 conditions, 1216 events. 344/1216 cut-off events. For 760/772 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6695 event pairs, 77 based on Foata normal form. 0/1166 useless extension candidates. Maximal degree in co-relation 3113. Up to 606 conditions per place. [2025-04-29 11:09:51,035 INFO L140 encePairwiseOnDemand]: 158/169 looper letters, 146 selfloop transitions, 37 changer transitions 0/297 dead transitions. [2025-04-29 11:09:51,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 297 transitions, 1676 flow [2025-04-29 11:09:51,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions. [2025-04-29 11:09:51,038 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7830374753451677 [2025-04-29 11:09:51,038 INFO L175 Difference]: Start difference. First operand has 186 places, 262 transitions, 1132 flow. Second operand 6 states and 794 transitions. [2025-04-29 11:09:51,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 297 transitions, 1676 flow [2025-04-29 11:09:51,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 297 transitions, 1658 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:51,053 INFO L231 Difference]: Finished difference. Result has 196 places, 289 transitions, 1456 flow [2025-04-29 11:09:51,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1456, PETRI_PLACES=196, PETRI_TRANSITIONS=289} [2025-04-29 11:09:51,054 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 24 predicate places. [2025-04-29 11:09:51,055 INFO L485 AbstractCegarLoop]: Abstraction has has 196 places, 289 transitions, 1456 flow [2025-04-29 11:09:51,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:51,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:51,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:51,056 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:09:51,056 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:09:51,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash -910126217, now seen corresponding path program 1 times [2025-04-29 11:09:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:51,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955535002] [2025-04-29 11:09:51,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:51,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:51,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-29 11:09:51,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-29 11:09:51,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:51,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:51,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:51,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955535002] [2025-04-29 11:09:51,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955535002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:51,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:51,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:09:51,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506773377] [2025-04-29 11:09:51,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:51,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:51,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:51,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:51,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:51,172 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 169 [2025-04-29 11:09:51,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 289 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:51,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:51,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 169 [2025-04-29 11:09:51,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:51,280 INFO L116 PetriNetUnfolderBase]: 257/1025 cut-off events. [2025-04-29 11:09:51,280 INFO L117 PetriNetUnfolderBase]: For 853/863 co-relation queries the response was YES. [2025-04-29 11:09:51,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2628 conditions, 1025 events. 257/1025 cut-off events. For 853/863 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5338 event pairs, 18 based on Foata normal form. 2/1001 useless extension candidates. Maximal degree in co-relation 2523. Up to 251 conditions per place. [2025-04-29 11:09:51,285 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 6 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2025-04-29 11:09:51,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 292 transitions, 1484 flow [2025-04-29 11:09:51,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-04-29 11:09:51,286 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9783037475345168 [2025-04-29 11:09:51,286 INFO L175 Difference]: Start difference. First operand has 196 places, 289 transitions, 1456 flow. Second operand 3 states and 496 transitions. [2025-04-29 11:09:51,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 292 transitions, 1484 flow [2025-04-29 11:09:51,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 292 transitions, 1428 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:51,296 INFO L231 Difference]: Finished difference. Result has 199 places, 291 transitions, 1423 flow [2025-04-29 11:09:51,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1423, PETRI_PLACES=199, PETRI_TRANSITIONS=291} [2025-04-29 11:09:51,296 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 27 predicate places. [2025-04-29 11:09:51,297 INFO L485 AbstractCegarLoop]: Abstraction has has 199 places, 291 transitions, 1423 flow [2025-04-29 11:09:51,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:51,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:51,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:51,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:09:51,297 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:09:51,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1579621679, now seen corresponding path program 2 times [2025-04-29 11:09:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:51,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719730495] [2025-04-29 11:09:51,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:51,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:51,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 1 equivalence classes. [2025-04-29 11:09:51,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-29 11:09:51,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:51,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:09:51,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:09:51,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-29 11:09:51,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-29 11:09:51,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:51,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:09:51,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:09:51,375 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:09:51,376 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2025-04-29 11:09:51,377 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-04-29 11:09:51,377 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-04-29 11:09:51,377 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2025-04-29 11:09:51,378 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-04-29 11:09:51,379 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-04-29 11:09:51,379 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-04-29 11:09:51,379 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-04-29 11:09:51,379 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-04-29 11:09:51,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:09:51,379 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:51,444 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:09:51,444 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:09:51,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:09:51 BasicIcfg [2025-04-29 11:09:51,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:09:51,450 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:09:51,450 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:09:51,450 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:09:51,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:46" (3/4) ... [2025-04-29 11:09:51,451 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:09:51,506 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 5. [2025-04-29 11:09:51,539 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:09:51,540 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:09:51,540 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:09:51,540 INFO L158 Benchmark]: Toolchain (without parser) took 5528.12ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 129.0MB in the beginning and 94.8MB in the end (delta: 34.2MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2025-04-29 11:09:51,541 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:09:51,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.87ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 114.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:09:51,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.77ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 112.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:09:51,542 INFO L158 Benchmark]: Boogie Preprocessor took 31.59ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 110.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:09:51,542 INFO L158 Benchmark]: RCFGBuilder took 392.98ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 88.2MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 11:09:51,543 INFO L158 Benchmark]: TraceAbstraction took 4737.52ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 87.8MB in the beginning and 111.5MB in the end (delta: -23.8MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2025-04-29 11:09:51,543 INFO L158 Benchmark]: Witness Printer took 89.71ms. Allocated memory is still 260.0MB. Free memory was 109.4MB in the beginning and 94.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:09:51,544 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.87ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 114.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.77ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 112.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.59ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 110.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 392.98ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 88.2MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4737.52ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 87.8MB in the beginning and 111.5MB in the end (delta: -23.8MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Witness Printer took 89.71ms. Allocated memory is still 260.0MB. Free memory was 109.4MB in the beginning and 94.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 29]: Data race detected Data race detected The following path leads to a data race: [L12-L15] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L24] 0 pthread_mutex_t A_mutex = PTHREAD_MUTEX_INITIALIZER; VAL [A={0:0}, A_mutex={1:0}, B={0:0}] [L25] 0 pthread_mutex_t B_mutex = PTHREAD_MUTEX_INITIALIZER; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L39] 0 pthread_t t1; [L41] CALL, EXPR 0 new(3) [L18] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \at(x, Pre)=3, p={-2:0}, x=3] [L19] 0 p->datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \at(x, Pre)=3, p={-2:0}, x=3] [L20] 0 p->next = NULL VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \at(x, Pre)=3, p={-2:0}, x=3] [L21] 0 return p; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \at(x, Pre)=3, \result={-2:0}, p={-2:0}, x=3] [L41] RET, EXPR 0 new(3) [L41] 0 A = new(3) VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L42] CALL, EXPR 0 new(5) [L18] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \at(x, Pre)=5, p={-3:0}, x=5] [L19] 0 p->datum = x VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \at(x, Pre)=5, p={-3:0}, x=5] [L20] 0 p->next = NULL VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \at(x, Pre)=5, p={-3:0}, x=5] [L21] 0 return p; VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \at(x, Pre)=5, \result={-3:0}, p={-3:0}, x=5] [L42] RET, EXPR 0 new(5) [L42] 0 B = new(5) VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}] [L44] FCALL, FORK 0 pthread_create(&t1, NULL, t_fun, NULL) VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \at(arg, Pre)={0:0}, t1=-1] [L46] 0 int *data; VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \at(arg, Pre)={0:0}, t1=-1] [L48] EXPR 0 A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \at(arg, Pre)={0:0}, t1=-1] [L48] 0 data = &A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \at(arg, Pre)={0:0}, data={-2:0}, t1=-1] [L29] EXPR 1 A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \at(arg, Pre)={0:0}, arg={0:0}] [L29] 1 A->datum++ VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \at(arg, Pre)={0:0}, arg={0:0}] [L50] 0 *data = 42 VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \at(arg, Pre)={0:0}, arg={0:0}, data={-2:0}, t1=-1] [L29] 1 A->datum++ VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \at(arg, Pre)={0:0}, arg={0:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: p->datum = x [19] * C: p->next = NULL [20] * C: p->next = NULL [20] * C: p->next = NULL [20] * C: p->datum = x [19] * C: *data = 42 [50] * C: p->next = NULL [20] * C: p->datum = x [19] * C: A = new(3) [41] * C: B = new(5) [42] * C: p->datum = x [19] and C: A->datum++ [29] - UnprovableResult [Line: 19]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 44]: 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: 29]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 33]: 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, 227 locations, 225 edges, 21 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: 4.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 820 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 447 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1835 IncrementalHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 87 mSDtfsCounter, 1835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1456occurred in iteration=8, InterpolantAutomatonStates: 42, 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, 1.8s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 665 ConstructedInterpolants, 0 QuantifiedInterpolants, 1102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-29 11:09:51,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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(DATA-RACE)