./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/02-base_26-malloc_struct.i --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/02-base_26-malloc_struct.i -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 71b70db56146daaa7371fed58b975e1add8fa8ab54b0a1b08c677a431a619350 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:25:57,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:25:57,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:25:57,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:25:57,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:25:57,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:25:57,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:25:57,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:25:57,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:25:57,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:25:57,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:25:57,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:25:57,840 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:25:57,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:25:57,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:25:57,841 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:25:57,841 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:25:57,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:25:57,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:25:57,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:25:57,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:25:57,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:25:57,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:25:57,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:25:57,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:25:57,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:25:57,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:25:57,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:25:57,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:25:57,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:25:57,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:25:57,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:25:57,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:25:57,843 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 -> 71b70db56146daaa7371fed58b975e1add8fa8ab54b0a1b08c677a431a619350 [2025-04-30 10:25:58,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:25:58,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:25:58,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:25:58,109 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:25:58,109 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:25:58,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/02-base_26-malloc_struct.i [2025-04-30 10:25:59,435 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc5fe365/f9ed4d5d06f042d999cb0a036b08503c/FLAG555348dd1 [2025-04-30 10:25:59,688 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:25:59,689 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/02-base_26-malloc_struct.i [2025-04-30 10:25:59,701 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc5fe365/f9ed4d5d06f042d999cb0a036b08503c/FLAG555348dd1 [2025-04-30 10:26:00,486 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc5fe365/f9ed4d5d06f042d999cb0a036b08503c [2025-04-30 10:26:00,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:00,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:00,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:00,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:00,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:00,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:00" (1/1) ... [2025-04-30 10:26:00,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4072248e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:00, skipping insertion in model container [2025-04-30 10:26:00,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:00" (1/1) ... [2025-04-30 10:26:00,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:00,933 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:00,950 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:01,022 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:01,081 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:01,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01 WrapperNode [2025-04-30 10:26:01,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:01,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:01,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:01,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:01,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,133 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2025-04-30 10:26:01,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:01,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:01,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:01,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:01,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:01,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:01,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:01,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:01,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (1/1) ... [2025-04-30 10:26:01,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:01,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:01,200 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-30 10:26:01,205 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-30 10:26:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:01,225 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:01,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:01,226 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:26:01,331 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:01,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:01,494 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:01,494 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:01,507 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:01,507 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:01,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:01 BoogieIcfgContainer [2025-04-30 10:26:01,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:01,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:01,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:01,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:01,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:00" (1/3) ... [2025-04-30 10:26:01,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f718d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:01, skipping insertion in model container [2025-04-30 10:26:01,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:01" (2/3) ... [2025-04-30 10:26:01,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f718d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:01, skipping insertion in model container [2025-04-30 10:26:01,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:01" (3/3) ... [2025-04-30 10:26:01,515 INFO L128 eAbstractionObserver]: Analyzing ICFG 02-base_26-malloc_struct.i [2025-04-30 10:26:01,525 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:01,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02-base_26-malloc_struct.i that has 2 procedures, 96 locations, 94 edges, 1 initial locations, 0 loop locations, and 9 error locations. [2025-04-30 10:26:01,527 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:01,577 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:01,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 194 flow [2025-04-30 10:26:01,670 INFO L116 PetriNetUnfolderBase]: 0/94 cut-off events. [2025-04-30 10:26:01,673 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:01,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 94 events. 0/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-30 10:26:01,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 95 transitions, 194 flow [2025-04-30 10:26:01,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 94 transitions, 191 flow [2025-04-30 10:26:01,686 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:01,698 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;@364d02a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:01,699 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-04-30 10:26:01,707 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:01,707 INFO L116 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-04-30 10:26:01,707 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:01,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:01,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:01,708 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:01,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1486570224, now seen corresponding path program 1 times [2025-04-30 10:26:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:01,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955571857] [2025-04-30 10:26:01,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:01,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:26:01,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:26:01,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:01,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:01,870 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-30 10:26:01,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:01,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955571857] [2025-04-30 10:26:01,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955571857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:01,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:01,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:26:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194137444] [2025-04-30 10:26:01,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:01,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:01,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:01,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:01,932 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 95 [2025-04-30 10:26:01,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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-30 10:26:01,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:01,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 95 [2025-04-30 10:26:01,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:01,991 INFO L116 PetriNetUnfolderBase]: 16/229 cut-off events. [2025-04-30 10:26:01,991 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:01,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 229 events. 16/229 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 740 event pairs, 16 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 240. Up to 46 conditions per place. [2025-04-30 10:26:01,995 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 13 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-04-30 10:26:01,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 93 transitions, 219 flow [2025-04-30 10:26:01,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2025-04-30 10:26:02,007 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.887719298245614 [2025-04-30 10:26:02,009 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 191 flow. Second operand 3 states and 253 transitions. [2025-04-30 10:26:02,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 93 transitions, 219 flow [2025-04-30 10:26:02,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:02,017 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 192 flow [2025-04-30 10:26:02,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2025-04-30 10:26:02,024 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2025-04-30 10:26:02,024 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 192 flow [2025-04-30 10:26:02,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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-30 10:26:02,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:02,024 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] [2025-04-30 10:26:02,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:02,025 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:02,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:02,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1118414709, now seen corresponding path program 1 times [2025-04-30 10:26:02,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:02,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337691678] [2025-04-30 10:26:02,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:02,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:02,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:26:02,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:26:02,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:02,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:02,069 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-30 10:26:02,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:02,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337691678] [2025-04-30 10:26:02,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337691678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:02,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:02,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:26:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680635535] [2025-04-30 10:26:02,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:02,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:02,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:02,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:02,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2025-04-30 10:26:02,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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-30 10:26:02,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:02,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2025-04-30 10:26:02,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:02,128 INFO L116 PetriNetUnfolderBase]: 24/301 cut-off events. [2025-04-30 10:26:02,128 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:02,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 301 events. 24/301 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1307 event pairs, 24 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 343. Up to 61 conditions per place. [2025-04-30 10:26:02,130 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 13 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2025-04-30 10:26:02,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 212 flow [2025-04-30 10:26:02,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-04-30 10:26:02,132 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8736842105263158 [2025-04-30 10:26:02,132 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 192 flow. Second operand 3 states and 249 transitions. [2025-04-30 10:26:02,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 212 flow [2025-04-30 10:26:02,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:26:02,134 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 182 flow [2025-04-30 10:26:02,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-04-30 10:26:02,134 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -4 predicate places. [2025-04-30 10:26:02,134 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 182 flow [2025-04-30 10:26:02,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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-30 10:26:02,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:02,135 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] [2025-04-30 10:26:02,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:26:02,135 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:02,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:02,136 INFO L85 PathProgramCache]: Analyzing trace with hash -794414378, now seen corresponding path program 1 times [2025-04-30 10:26:02,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:02,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773992795] [2025-04-30 10:26:02,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:02,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:02,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:26:02,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:26:02,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:02,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:02,551 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-30 10:26:02,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:02,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773992795] [2025-04-30 10:26:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773992795] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247642496] [2025-04-30 10:26:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:02,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:02,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:02,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:02,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:02,670 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 95 [2025-04-30 10:26:02,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 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-30 10:26:02,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:02,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 95 [2025-04-30 10:26:02,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:02,864 INFO L116 PetriNetUnfolderBase]: 185/657 cut-off events. [2025-04-30 10:26:02,864 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:02,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 657 events. 185/657 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3570 event pairs, 52 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 1036. Up to 246 conditions per place. [2025-04-30 10:26:02,869 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 47 selfloop transitions, 41 changer transitions 0/153 dead transitions. [2025-04-30 10:26:02,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 153 transitions, 486 flow [2025-04-30 10:26:02,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 515 transitions. [2025-04-30 10:26:02,871 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9035087719298246 [2025-04-30 10:26:02,871 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 182 flow. Second operand 6 states and 515 transitions. [2025-04-30 10:26:02,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 153 transitions, 486 flow [2025-04-30 10:26:02,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 153 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:02,874 INFO L231 Difference]: Finished difference. Result has 102 places, 131 transitions, 439 flow [2025-04-30 10:26:02,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=102, PETRI_TRANSITIONS=131} [2025-04-30 10:26:02,875 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2025-04-30 10:26:02,875 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 131 transitions, 439 flow [2025-04-30 10:26:02,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 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-30 10:26:02,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:02,876 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] [2025-04-30 10:26:02,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:26:02,876 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:02,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:02,876 INFO L85 PathProgramCache]: Analyzing trace with hash 662746690, now seen corresponding path program 1 times [2025-04-30 10:26:02,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:02,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858844578] [2025-04-30 10:26:02,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:02,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:02,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:26:02,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:26:02,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:02,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:03,139 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-30 10:26:03,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:03,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858844578] [2025-04-30 10:26:03,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858844578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:03,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:03,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:03,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137348748] [2025-04-30 10:26:03,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:03,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:03,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:03,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:03,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:03,276 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2025-04-30 10:26:03,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 131 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 0 states have call successors, (0), 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-30 10:26:03,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:03,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2025-04-30 10:26:03,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:03,444 INFO L116 PetriNetUnfolderBase]: 231/994 cut-off events. [2025-04-30 10:26:03,444 INFO L117 PetriNetUnfolderBase]: For 290/337 co-relation queries the response was YES. [2025-04-30 10:26:03,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 994 events. 231/994 cut-off events. For 290/337 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6823 event pairs, 25 based on Foata normal form. 26/987 useless extension candidates. Maximal degree in co-relation 2036. Up to 180 conditions per place. [2025-04-30 10:26:03,451 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 67 selfloop transitions, 32 changer transitions 0/190 dead transitions. [2025-04-30 10:26:03,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 190 transitions, 869 flow [2025-04-30 10:26:03,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2025-04-30 10:26:03,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9280701754385965 [2025-04-30 10:26:03,453 INFO L175 Difference]: Start difference. First operand has 102 places, 131 transitions, 439 flow. Second operand 6 states and 529 transitions. [2025-04-30 10:26:03,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 190 transitions, 869 flow [2025-04-30 10:26:03,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 190 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:03,458 INFO L231 Difference]: Finished difference. Result has 112 places, 161 transitions, 741 flow [2025-04-30 10:26:03,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=112, PETRI_TRANSITIONS=161} [2025-04-30 10:26:03,459 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 14 predicate places. [2025-04-30 10:26:03,459 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 161 transitions, 741 flow [2025-04-30 10:26:03,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 0 states have call successors, (0), 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-30 10:26:03,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:03,459 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] [2025-04-30 10:26:03,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:26:03,459 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:03,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash -390885698, now seen corresponding path program 1 times [2025-04-30 10:26:03,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:03,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017304943] [2025-04-30 10:26:03,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:03,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:03,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:26:03,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:26:03,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:03,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:03,523 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-30 10:26:03,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:03,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017304943] [2025-04-30 10:26:03,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017304943] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:03,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:03,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:26:03,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650171428] [2025-04-30 10:26:03,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:03,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:03,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:03,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:03,534 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 95 [2025-04-30 10:26:03,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 161 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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-30 10:26:03,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:03,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 95 [2025-04-30 10:26:03,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:03,567 INFO L116 PetriNetUnfolderBase]: 39/278 cut-off events. [2025-04-30 10:26:03,568 INFO L117 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-04-30 10:26:03,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 278 events. 39/278 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 969 event pairs, 4 based on Foata normal form. 2/267 useless extension candidates. Maximal degree in co-relation 485. Up to 64 conditions per place. [2025-04-30 10:26:03,570 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 2 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2025-04-30 10:26:03,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 375 flow [2025-04-30 10:26:03,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2025-04-30 10:26:03,571 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-04-30 10:26:03,571 INFO L175 Difference]: Start difference. First operand has 112 places, 161 transitions, 741 flow. Second operand 3 states and 275 transitions. [2025-04-30 10:26:03,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 375 flow [2025-04-30 10:26:03,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 333 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-04-30 10:26:03,579 INFO L231 Difference]: Finished difference. Result has 105 places, 110 transitions, 329 flow [2025-04-30 10:26:03,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=105, PETRI_TRANSITIONS=110} [2025-04-30 10:26:03,579 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2025-04-30 10:26:03,580 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 110 transitions, 329 flow [2025-04-30 10:26:03,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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-30 10:26:03,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:03,580 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] [2025-04-30 10:26:03,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:26:03,580 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:03,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:03,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1313172452, now seen corresponding path program 1 times [2025-04-30 10:26:03,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:03,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274849748] [2025-04-30 10:26:03,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:03,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:26:03,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:26:03,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:03,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:03,851 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-30 10:26:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:03,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274849748] [2025-04-30 10:26:03,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274849748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:03,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:03,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:03,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047860258] [2025-04-30 10:26:03,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:03,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:03,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:03,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:03,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:03,983 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2025-04-30 10:26:03,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 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-30 10:26:03,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:03,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2025-04-30 10:26:03,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:04,104 INFO L116 PetriNetUnfolderBase]: 93/474 cut-off events. [2025-04-30 10:26:04,104 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-30 10:26:04,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 474 events. 93/474 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2171 event pairs, 20 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 867. Up to 153 conditions per place. [2025-04-30 10:26:04,108 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 34 selfloop transitions, 22 changer transitions 0/131 dead transitions. [2025-04-30 10:26:04,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 515 flow [2025-04-30 10:26:04,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 497 transitions. [2025-04-30 10:26:04,110 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8719298245614036 [2025-04-30 10:26:04,111 INFO L175 Difference]: Start difference. First operand has 105 places, 110 transitions, 329 flow. Second operand 6 states and 497 transitions. [2025-04-30 10:26:04,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 515 flow [2025-04-30 10:26:04,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 131 transitions, 511 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:04,115 INFO L231 Difference]: Finished difference. Result has 114 places, 131 transitions, 507 flow [2025-04-30 10:26:04,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=114, PETRI_TRANSITIONS=131} [2025-04-30 10:26:04,116 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 16 predicate places. [2025-04-30 10:26:04,117 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 131 transitions, 507 flow [2025-04-30 10:26:04,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 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-30 10:26:04,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:04,117 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] [2025-04-30 10:26:04,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:26:04,117 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:04,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:04,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1654409923, now seen corresponding path program 1 times [2025-04-30 10:26:04,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:04,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283580834] [2025-04-30 10:26:04,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:04,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:04,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:26:04,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:26:04,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:04,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:04,348 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-30 10:26:04,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:04,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283580834] [2025-04-30 10:26:04,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283580834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:04,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:04,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:04,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666919386] [2025-04-30 10:26:04,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:04,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:04,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:04,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:04,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:04,446 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 95 [2025-04-30 10:26:04,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 131 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:04,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:04,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 95 [2025-04-30 10:26:04,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:04,617 INFO L116 PetriNetUnfolderBase]: 195/727 cut-off events. [2025-04-30 10:26:04,618 INFO L117 PetriNetUnfolderBase]: For 309/315 co-relation queries the response was YES. [2025-04-30 10:26:04,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 727 events. 195/727 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4013 event pairs, 12 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 1775. Up to 295 conditions per place. [2025-04-30 10:26:04,623 INFO L140 encePairwiseOnDemand]: 80/95 looper letters, 56 selfloop transitions, 52 changer transitions 11/188 dead transitions. [2025-04-30 10:26:04,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 188 transitions, 1014 flow [2025-04-30 10:26:04,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 501 transitions. [2025-04-30 10:26:04,626 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8789473684210526 [2025-04-30 10:26:04,627 INFO L175 Difference]: Start difference. First operand has 114 places, 131 transitions, 507 flow. Second operand 6 states and 501 transitions. [2025-04-30 10:26:04,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 188 transitions, 1014 flow [2025-04-30 10:26:04,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 188 transitions, 976 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:04,634 INFO L231 Difference]: Finished difference. Result has 124 places, 173 transitions, 931 flow [2025-04-30 10:26:04,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=931, PETRI_PLACES=124, PETRI_TRANSITIONS=173} [2025-04-30 10:26:04,635 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 26 predicate places. [2025-04-30 10:26:04,635 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 173 transitions, 931 flow [2025-04-30 10:26:04,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:04,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:04,636 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] [2025-04-30 10:26:04,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:26:04,636 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:04,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1313883544, now seen corresponding path program 1 times [2025-04-30 10:26:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:04,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908410833] [2025-04-30 10:26:04,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:04,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:26:04,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:26:04,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:04,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:05,228 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-30 10:26:05,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:05,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908410833] [2025-04-30 10:26:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908410833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:05,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:05,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:26:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988713788] [2025-04-30 10:26:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:05,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:05,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:05,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:26:05,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-04-30 10:26:05,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 173 transitions, 931 flow. Second operand has 10 states, 10 states have (on average 67.3) internal successors, (673), 10 states have internal predecessors, (673), 0 states have call successors, (0), 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-30 10:26:05,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:05,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-04-30 10:26:05,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:05,649 INFO L116 PetriNetUnfolderBase]: 188/692 cut-off events. [2025-04-30 10:26:05,649 INFO L117 PetriNetUnfolderBase]: For 726/756 co-relation queries the response was YES. [2025-04-30 10:26:05,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 692 events. 188/692 cut-off events. For 726/756 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3780 event pairs, 19 based on Foata normal form. 21/706 useless extension candidates. Maximal degree in co-relation 2073. Up to 132 conditions per place. [2025-04-30 10:26:05,652 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 88 selfloop transitions, 36 changer transitions 16/220 dead transitions. [2025-04-30 10:26:05,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 220 transitions, 1545 flow [2025-04-30 10:26:05,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:26:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:26:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 712 transitions. [2025-04-30 10:26:05,654 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7494736842105263 [2025-04-30 10:26:05,654 INFO L175 Difference]: Start difference. First operand has 124 places, 173 transitions, 931 flow. Second operand 10 states and 712 transitions. [2025-04-30 10:26:05,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 220 transitions, 1545 flow [2025-04-30 10:26:05,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 220 transitions, 1502 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:05,662 INFO L231 Difference]: Finished difference. Result has 138 places, 181 transitions, 1078 flow [2025-04-30 10:26:05,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1078, PETRI_PLACES=138, PETRI_TRANSITIONS=181} [2025-04-30 10:26:05,662 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 40 predicate places. [2025-04-30 10:26:05,662 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 181 transitions, 1078 flow [2025-04-30 10:26:05,663 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 67.3) internal successors, (673), 10 states have internal predecessors, (673), 0 states have call successors, (0), 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-30 10:26:05,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:05,663 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] [2025-04-30 10:26:05,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:26:05,663 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:05,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1916998803, now seen corresponding path program 1 times [2025-04-30 10:26:05,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:05,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127294577] [2025-04-30 10:26:05,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:05,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:26:05,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:26:05,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:05,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:06,129 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-30 10:26:06,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:06,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127294577] [2025-04-30 10:26:06,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127294577] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:06,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:06,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:26:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616542015] [2025-04-30 10:26:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:06,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:06,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:06,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:26:06,360 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 95 [2025-04-30 10:26:06,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 181 transitions, 1078 flow. Second operand has 10 states, 10 states have (on average 68.7) internal successors, (687), 10 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:06,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:06,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 95 [2025-04-30 10:26:06,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:06,580 INFO L116 PetriNetUnfolderBase]: 230/794 cut-off events. [2025-04-30 10:26:06,580 INFO L117 PetriNetUnfolderBase]: For 1366/1408 co-relation queries the response was YES. [2025-04-30 10:26:06,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 794 events. 230/794 cut-off events. For 1366/1408 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4552 event pairs, 8 based on Foata normal form. 28/818 useless extension candidates. Maximal degree in co-relation 2754. Up to 159 conditions per place. [2025-04-30 10:26:06,586 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 116 selfloop transitions, 67 changer transitions 17/263 dead transitions. [2025-04-30 10:26:06,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 263 transitions, 2090 flow [2025-04-30 10:26:06,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 706 transitions. [2025-04-30 10:26:06,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8257309941520468 [2025-04-30 10:26:06,588 INFO L175 Difference]: Start difference. First operand has 138 places, 181 transitions, 1078 flow. Second operand 9 states and 706 transitions. [2025-04-30 10:26:06,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 263 transitions, 2090 flow [2025-04-30 10:26:06,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 263 transitions, 2051 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-30 10:26:06,601 INFO L231 Difference]: Finished difference. Result has 144 places, 202 transitions, 1455 flow [2025-04-30 10:26:06,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1455, PETRI_PLACES=144, PETRI_TRANSITIONS=202} [2025-04-30 10:26:06,602 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 46 predicate places. [2025-04-30 10:26:06,602 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 202 transitions, 1455 flow [2025-04-30 10:26:06,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 68.7) internal successors, (687), 10 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:06,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:06,602 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] [2025-04-30 10:26:06,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:26:06,603 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:06,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash -781584510, now seen corresponding path program 1 times [2025-04-30 10:26:06,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:06,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635298938] [2025-04-30 10:26:06,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:06,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:26:06,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:26:06,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:06,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:07,030 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-30 10:26:07,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:07,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635298938] [2025-04-30 10:26:07,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635298938] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:07,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:07,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:07,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202907946] [2025-04-30 10:26:07,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:07,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:26:07,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:07,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:26:07,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:26:07,301 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-04-30 10:26:07,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 202 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 0 states have call successors, (0), 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-30 10:26:07,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:07,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-04-30 10:26:07,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:07,475 INFO L116 PetriNetUnfolderBase]: 199/789 cut-off events. [2025-04-30 10:26:07,475 INFO L117 PetriNetUnfolderBase]: For 2260/2346 co-relation queries the response was YES. [2025-04-30 10:26:07,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 789 events. 199/789 cut-off events. For 2260/2346 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4669 event pairs, 21 based on Foata normal form. 43/825 useless extension candidates. Maximal degree in co-relation 2925. Up to 167 conditions per place. [2025-04-30 10:26:07,479 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 93 selfloop transitions, 36 changer transitions 6/229 dead transitions. [2025-04-30 10:26:07,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 229 transitions, 2041 flow [2025-04-30 10:26:07,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:26:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:26:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 772 transitions. [2025-04-30 10:26:07,481 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.738755980861244 [2025-04-30 10:26:07,481 INFO L175 Difference]: Start difference. First operand has 144 places, 202 transitions, 1455 flow. Second operand 11 states and 772 transitions. [2025-04-30 10:26:07,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 229 transitions, 2041 flow [2025-04-30 10:26:07,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 229 transitions, 1993 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-30 10:26:07,495 INFO L231 Difference]: Finished difference. Result has 152 places, 200 transitions, 1479 flow [2025-04-30 10:26:07,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1479, PETRI_PLACES=152, PETRI_TRANSITIONS=200} [2025-04-30 10:26:07,499 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 54 predicate places. [2025-04-30 10:26:07,499 INFO L485 AbstractCegarLoop]: Abstraction has has 152 places, 200 transitions, 1479 flow [2025-04-30 10:26:07,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 0 states have call successors, (0), 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-30 10:26:07,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:07,499 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] [2025-04-30 10:26:07,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:26:07,499 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:07,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash -720812794, now seen corresponding path program 2 times [2025-04-30 10:26:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:07,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725324377] [2025-04-30 10:26:07,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:07,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:26:07,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:26:07,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:07,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:07,905 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-30 10:26:07,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:07,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725324377] [2025-04-30 10:26:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725324377] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:07,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:07,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:07,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322335289] [2025-04-30 10:26:07,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:07,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:26:07,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:07,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:26:07,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:26:08,138 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-04-30 10:26:08,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 200 transitions, 1479 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 0 states have call successors, (0), 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-30 10:26:08,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:08,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-04-30 10:26:08,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:08,340 INFO L116 PetriNetUnfolderBase]: 196/784 cut-off events. [2025-04-30 10:26:08,340 INFO L117 PetriNetUnfolderBase]: For 2426/2481 co-relation queries the response was YES. [2025-04-30 10:26:08,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2989 conditions, 784 events. 196/784 cut-off events. For 2426/2481 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4637 event pairs, 21 based on Foata normal form. 28/805 useless extension candidates. Maximal degree in co-relation 2956. Up to 167 conditions per place. [2025-04-30 10:26:08,344 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 93 selfloop transitions, 34 changer transitions 7/228 dead transitions. [2025-04-30 10:26:08,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 228 transitions, 2057 flow [2025-04-30 10:26:08,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:26:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:26:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 837 transitions. [2025-04-30 10:26:08,347 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7342105263157894 [2025-04-30 10:26:08,347 INFO L175 Difference]: Start difference. First operand has 152 places, 200 transitions, 1479 flow. Second operand 12 states and 837 transitions. [2025-04-30 10:26:08,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 228 transitions, 2057 flow [2025-04-30 10:26:08,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 228 transitions, 1975 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-04-30 10:26:08,359 INFO L231 Difference]: Finished difference. Result has 154 places, 198 transitions, 1455 flow [2025-04-30 10:26:08,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1455, PETRI_PLACES=154, PETRI_TRANSITIONS=198} [2025-04-30 10:26:08,360 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 56 predicate places. [2025-04-30 10:26:08,360 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 198 transitions, 1455 flow [2025-04-30 10:26:08,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 0 states have call successors, (0), 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-30 10:26:08,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:08,360 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] [2025-04-30 10:26:08,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:26:08,360 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:08,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash -277143894, now seen corresponding path program 3 times [2025-04-30 10:26:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:08,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400751814] [2025-04-30 10:26:08,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:26:08,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:08,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:26:08,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:26:08,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:26:08,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:08,670 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-30 10:26:08,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:08,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400751814] [2025-04-30 10:26:08,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400751814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:08,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:08,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:08,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568382220] [2025-04-30 10:26:08,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:08,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:26:08,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:08,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:26:08,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:26:09,020 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-04-30 10:26:09,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 198 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 0 states have call successors, (0), 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-30 10:26:09,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:09,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-04-30 10:26:09,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:09,314 INFO L116 PetriNetUnfolderBase]: 200/841 cut-off events. [2025-04-30 10:26:09,314 INFO L117 PetriNetUnfolderBase]: For 2498/2524 co-relation queries the response was YES. [2025-04-30 10:26:09,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 841 events. 200/841 cut-off events. For 2498/2524 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5224 event pairs, 21 based on Foata normal form. 13/847 useless extension candidates. Maximal degree in co-relation 3125. Up to 242 conditions per place. [2025-04-30 10:26:09,319 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 70 selfloop transitions, 42 changer transitions 12/218 dead transitions. [2025-04-30 10:26:09,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 218 transitions, 1896 flow [2025-04-30 10:26:09,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:26:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:26:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 911 transitions. [2025-04-30 10:26:09,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7376518218623481 [2025-04-30 10:26:09,321 INFO L175 Difference]: Start difference. First operand has 154 places, 198 transitions, 1455 flow. Second operand 13 states and 911 transitions. [2025-04-30 10:26:09,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 218 transitions, 1896 flow [2025-04-30 10:26:09,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 218 transitions, 1790 flow, removed 7 selfloop flow, removed 11 redundant places. [2025-04-30 10:26:09,334 INFO L231 Difference]: Finished difference. Result has 159 places, 204 transitions, 1566 flow [2025-04-30 10:26:09,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1566, PETRI_PLACES=159, PETRI_TRANSITIONS=204} [2025-04-30 10:26:09,335 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 61 predicate places. [2025-04-30 10:26:09,335 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 204 transitions, 1566 flow [2025-04-30 10:26:09,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 0 states have call successors, (0), 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-30 10:26:09,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:09,335 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] [2025-04-30 10:26:09,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:26:09,336 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:09,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash -66813786, now seen corresponding path program 4 times [2025-04-30 10:26:09,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:09,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873937873] [2025-04-30 10:26:09,336 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:26:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:09,351 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-30 10:26:09,354 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 66 of 69 statements. [2025-04-30 10:26:09,354 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:26:09,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:09,634 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-30 10:26:09,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:09,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873937873] [2025-04-30 10:26:09,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873937873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:09,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:09,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:09,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334777826] [2025-04-30 10:26:09,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:09,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:26:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:09,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:26:09,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:26:09,888 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-04-30 10:26:09,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 204 transitions, 1566 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 0 states have call successors, (0), 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-30 10:26:09,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:09,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-04-30 10:26:09,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:10,093 INFO L116 PetriNetUnfolderBase]: 197/827 cut-off events. [2025-04-30 10:26:10,093 INFO L117 PetriNetUnfolderBase]: For 2483/2508 co-relation queries the response was YES. [2025-04-30 10:26:10,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3148 conditions, 827 events. 197/827 cut-off events. For 2483/2508 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5109 event pairs, 21 based on Foata normal form. 13/833 useless extension candidates. Maximal degree in co-relation 3114. Up to 169 conditions per place. [2025-04-30 10:26:10,098 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 91 selfloop transitions, 37 changer transitions 7/229 dead transitions. [2025-04-30 10:26:10,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 229 transitions, 2122 flow [2025-04-30 10:26:10,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:26:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:26:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 898 transitions. [2025-04-30 10:26:10,101 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7271255060728745 [2025-04-30 10:26:10,101 INFO L175 Difference]: Start difference. First operand has 159 places, 204 transitions, 1566 flow. Second operand 13 states and 898 transitions. [2025-04-30 10:26:10,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 229 transitions, 2122 flow [2025-04-30 10:26:10,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 229 transitions, 2069 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-04-30 10:26:10,115 INFO L231 Difference]: Finished difference. Result has 158 places, 199 transitions, 1552 flow [2025-04-30 10:26:10,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1552, PETRI_PLACES=158, PETRI_TRANSITIONS=199} [2025-04-30 10:26:10,116 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 60 predicate places. [2025-04-30 10:26:10,116 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 199 transitions, 1552 flow [2025-04-30 10:26:10,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 0 states have call successors, (0), 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-30 10:26:10,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:10,116 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] [2025-04-30 10:26:10,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:26:10,117 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:10,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash -413351309, now seen corresponding path program 1 times [2025-04-30 10:26:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:10,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993467342] [2025-04-30 10:26:10,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:10,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-30 10:26:10,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:26:10,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:10,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:10,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:26:10,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-30 10:26:10,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:26:10,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:10,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:10,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:26:10,165 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:26:10,166 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-04-30 10:26:10,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-04-30 10:26:10,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-04-30 10:26:10,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-04-30 10:26:10,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-04-30 10:26:10,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-04-30 10:26:10,168 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-04-30 10:26:10,168 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-04-30 10:26:10,168 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-04-30 10:26:10,168 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-04-30 10:26:10,168 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-04-30 10:26:10,168 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-04-30 10:26:10,168 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-04-30 10:26:10,168 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-04-30 10:26:10,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:26:10,168 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:10,215 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:26:10,216 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:26:10,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:26:10 BasicIcfg [2025-04-30 10:26:10,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:26:10,219 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:26:10,219 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:26:10,220 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:26:10,220 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:01" (3/4) ... [2025-04-30 10:26:10,221 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:26:10,266 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-04-30 10:26:10,303 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:26:10,303 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:26:10,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:26:10,304 INFO L158 Benchmark]: Toolchain (without parser) took 9815.05ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 109.8MB in the beginning and 226.5MB in the end (delta: -116.7MB). Peak memory consumption was 162.0MB. Max. memory is 16.1GB. [2025-04-30 10:26:10,304 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:10,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.93ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 69.1MB in the end (delta: 40.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:26:10,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.72ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 66.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:10,304 INFO L158 Benchmark]: Boogie Preprocessor took 35.14ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 65.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:10,304 INFO L158 Benchmark]: RCFGBuilder took 336.47ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 48.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:26:10,305 INFO L158 Benchmark]: TraceAbstraction took 8710.22ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 47.9MB in the beginning and 87.7MB in the end (delta: -39.8MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. [2025-04-30 10:26:10,305 INFO L158 Benchmark]: Witness Printer took 83.77ms. Allocated memory is still 268.4MB. Free memory was 87.7MB in the beginning and 226.5MB in the end (delta: -138.8MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2025-04-30 10:26:10,306 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.63ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.93ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 69.1MB in the end (delta: 40.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.72ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 66.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.14ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 65.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 336.47ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 48.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8710.22ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 47.9MB in the beginning and 87.7MB in the end (delta: -39.8MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. * Witness Printer took 83.77ms. Allocated memory is still 268.4MB. Free memory was 87.7MB in the beginning and 226.5MB in the end (delta: -138.8MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1245]: Data race detected Data race detected The following path leads to a data race: [L1227] 0 data *d; VAL [d={0:0}] [L1228] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [d={0:0}, m={1:0}] [L1237] 0 pthread_t id; VAL [d={0:0}, m={1:0}] [L1238] 0 data *z; VAL [d={0:0}, m={1:0}] [L1239] 0 d = malloc(sizeof(data)) VAL [d={-2:0}, m={1:0}] [L1240] 0 z = d VAL [d={-2:0}, m={1:0}, z={-2:0}] [L1241] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\at(arg, Pre)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1243] EXPR 0 d->x VAL [\at(arg, Pre)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1243] 0 printf("%d\n",d->x) VAL [\at(arg, Pre)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1231] EXPR 1 d->x VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1231] 1 d->x = 3 VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1245] EXPR 0 z->y VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1232] EXPR 1 d->y VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1232] 1 d->y = 8 VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1245] 0 printf("%d\n",z->y) VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2: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: d->x = 3 [1231] * C: d->x = 3 [1231] * C: d = malloc(sizeof(data)) [1239] * C: d->y = 8 [1232] * C: d->x = 3 [1231] * C: d->x = 3 [1231] and C: printf("%d\n",z->y) [1245] - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: 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: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: 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, 129 locations, 127 edges, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1462 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1058 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 500 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4786 IncrementalHoareTripleChecker+Invalid, 5286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 500 mSolverCounterUnsat, 64 mSDtfsCounter, 4786 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1566occurred in iteration=12, InterpolantAutomatonStates: 101, 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, 3.6s InterpolantComputationTime, 740 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 4099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-30 10:26:10,319 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)