./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_09-idxsense_rc.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/05-lval_ls_09-idxsense_rc.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 0e635f0fe47aceede1c472bdc8d824736c973da1578eefbb4d4eeab774d2111f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:29,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:29,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:29,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:29,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:29,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:29,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:29,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:29,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:29,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:29,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:29,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:29,270 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:29,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:29,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:29,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:29,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:29,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:29,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:29,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:29,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:29,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:29,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:29,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:29,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:29,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:29,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:29,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:29,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:29,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:29,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:29,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:29,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:29,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:29,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:29,273 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 -> 0e635f0fe47aceede1c472bdc8d824736c973da1578eefbb4d4eeab774d2111f [2025-04-30 10:26:29,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:29,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:29,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:29,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:29,497 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:29,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_09-idxsense_rc.i [2025-04-30 10:26:30,771 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb30ab65e/042beb65716245bfa22f55d9185ef080/FLAG2edcd7e70 [2025-04-30 10:26:30,993 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:30,994 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/05-lval_ls_09-idxsense_rc.i [2025-04-30 10:26:31,009 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb30ab65e/042beb65716245bfa22f55d9185ef080/FLAG2edcd7e70 [2025-04-30 10:26:31,771 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb30ab65e/042beb65716245bfa22f55d9185ef080 [2025-04-30 10:26:31,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:31,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:31,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:31,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:31,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:31,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:31" (1/1) ... [2025-04-30 10:26:31,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a35dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:31, skipping insertion in model container [2025-04-30 10:26:31,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:31" (1/1) ... [2025-04-30 10:26:31,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:32,091 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:32,125 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:32,191 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:32,214 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:32,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:32 WrapperNode [2025-04-30 10:26:32,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:32,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:32,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:32,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:32,225 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:32" (1/1) ... [2025-04-30 10:26:32,240 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:32" (1/1) ... [2025-04-30 10:26:32,258 INFO L138 Inliner]: procedures = 162, calls = 73, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2025-04-30 10:26:32,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:32,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:32,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:32,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:32,265 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:32" (1/1) ... [2025-04-30 10:26:32,265 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:32" (1/1) ... [2025-04-30 10:26:32,269 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:32" (1/1) ... [2025-04-30 10:26:32,270 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:32" (1/1) ... [2025-04-30 10:26:32,280 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:32" (1/1) ... [2025-04-30 10:26:32,284 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:32" (1/1) ... [2025-04-30 10:26:32,286 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:32" (1/1) ... [2025-04-30 10:26:32,291 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:32" (1/1) ... [2025-04-30 10:26:32,291 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:32" (1/1) ... [2025-04-30 10:26:32,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:32,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:32,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:32,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:32,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:32" (1/1) ... [2025-04-30 10:26:32,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:32,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:32,322 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:32,324 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:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:32,339 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:32,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:32,342 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:32,423 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:32,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:32,635 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:32,635 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:32,656 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:32,656 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:32,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:32 BoogieIcfgContainer [2025-04-30 10:26:32,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:32,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:32,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:32,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:32,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:31" (1/3) ... [2025-04-30 10:26:32,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1c7ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:32, skipping insertion in model container [2025-04-30 10:26:32,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:32" (2/3) ... [2025-04-30 10:26:32,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1c7ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:32, skipping insertion in model container [2025-04-30 10:26:32,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:32" (3/3) ... [2025-04-30 10:26:32,666 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_09-idxsense_rc.i [2025-04-30 10:26:32,675 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:32,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_09-idxsense_rc.i that has 2 procedures, 137 locations, 136 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-30 10:26:32,678 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:32,725 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:32,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 137 transitions, 278 flow [2025-04-30 10:26:32,809 INFO L116 PetriNetUnfolderBase]: 1/136 cut-off events. [2025-04-30 10:26:32,812 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:32,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 136 events. 1/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2025-04-30 10:26:32,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 137 transitions, 278 flow [2025-04-30 10:26:32,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 136 transitions, 275 flow [2025-04-30 10:26:32,824 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:32,834 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;@14f67c9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:32,834 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:26:32,853 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:32,853 INFO L116 PetriNetUnfolderBase]: 1/97 cut-off events. [2025-04-30 10:26:32,854 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:32,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:32,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:32,854 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:32,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:32,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1040197650, now seen corresponding path program 1 times [2025-04-30 10:26:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:32,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536435564] [2025-04-30 10:26:32,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:32,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:32,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:26:32,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:26:32,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:32,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:33,177 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:33,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:33,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536435564] [2025-04-30 10:26:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536435564] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:33,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:33,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:26:33,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884941637] [2025-04-30 10:26:33,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:33,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:33,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:33,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:33,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:33,221 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 137 [2025-04-30 10:26:33,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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:33,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:33,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 137 [2025-04-30 10:26:33,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:33,272 INFO L116 PetriNetUnfolderBase]: 7/221 cut-off events. [2025-04-30 10:26:33,272 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:33,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 221 events. 7/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 323 event pairs, 6 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 153. Up to 24 conditions per place. [2025-04-30 10:26:33,274 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 10 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2025-04-30 10:26:33,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 137 transitions, 301 flow [2025-04-30 10:26:33,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2025-04-30 10:26:33,284 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9513381995133819 [2025-04-30 10:26:33,285 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 275 flow. Second operand 3 states and 391 transitions. [2025-04-30 10:26:33,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 137 transitions, 301 flow [2025-04-30 10:26:33,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 137 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:33,293 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 286 flow [2025-04-30 10:26:33,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-04-30 10:26:33,299 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 2 predicate places. [2025-04-30 10:26:33,299 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 286 flow [2025-04-30 10:26:33,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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:33,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:33,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:33,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:33,300 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:33,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:33,302 INFO L85 PathProgramCache]: Analyzing trace with hash -824966364, now seen corresponding path program 1 times [2025-04-30 10:26:33,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:33,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722457395] [2025-04-30 10:26:33,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:33,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-30 10:26:33,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-30 10:26:33,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:33,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:33,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:33,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722457395] [2025-04-30 10:26:33,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722457395] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:33,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016479559] [2025-04-30 10:26:33,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:33,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:33,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:33,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:33,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:26:33,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-30 10:26:33,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-30 10:26:33,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:33,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:33,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:26:33,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:33,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:33,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016479559] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:33,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:33,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:26:33,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184986812] [2025-04-30 10:26:33,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:33,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:33,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:33,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:33,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:26:33,716 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-04-30 10:26:33,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 286 flow. Second operand has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 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:33,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:33,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-04-30 10:26:33,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:33,822 INFO L116 PetriNetUnfolderBase]: 7/228 cut-off events. [2025-04-30 10:26:33,822 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:33,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 228 events. 7/228 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 317 event pairs, 6 based on Foata normal form. 2/217 useless extension candidates. Maximal degree in co-relation 190. Up to 24 conditions per place. [2025-04-30 10:26:33,823 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 14 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2025-04-30 10:26:33,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 350 flow [2025-04-30 10:26:33,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1132 transitions. [2025-04-30 10:26:33,828 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9180859691808597 [2025-04-30 10:26:33,830 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 286 flow. Second operand 9 states and 1132 transitions. [2025-04-30 10:26:33,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 350 flow [2025-04-30 10:26:33,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:33,833 INFO L231 Difference]: Finished difference. Result has 151 places, 143 transitions, 334 flow [2025-04-30 10:26:33,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=334, PETRI_PLACES=151, PETRI_TRANSITIONS=143} [2025-04-30 10:26:33,834 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 12 predicate places. [2025-04-30 10:26:33,835 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 143 transitions, 334 flow [2025-04-30 10:26:33,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 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:33,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:33,836 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:26:34,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:34,037 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:34,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:34,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1610944540, now seen corresponding path program 2 times [2025-04-30 10:26:34,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:34,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059501089] [2025-04-30 10:26:34,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:34,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-04-30 10:26:34,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 100 statements. [2025-04-30 10:26:34,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:34,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:26:34,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:34,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059501089] [2025-04-30 10:26:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059501089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:34,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:34,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205109794] [2025-04-30 10:26:34,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:34,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:34,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:34,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:34,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:34,729 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 137 [2025-04-30 10:26:34,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 143 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 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:34,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:34,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 137 [2025-04-30 10:26:34,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:35,034 INFO L116 PetriNetUnfolderBase]: 261/1003 cut-off events. [2025-04-30 10:26:35,035 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:26:35,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 1003 events. 261/1003 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5963 event pairs, 67 based on Foata normal form. 0/966 useless extension candidates. Maximal degree in co-relation 1492. Up to 257 conditions per place. [2025-04-30 10:26:35,045 INFO L140 encePairwiseOnDemand]: 115/137 looper letters, 88 selfloop transitions, 42 changer transitions 0/245 dead transitions. [2025-04-30 10:26:35,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 245 transitions, 798 flow [2025-04-30 10:26:35,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 786 transitions. [2025-04-30 10:26:35,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9562043795620438 [2025-04-30 10:26:35,049 INFO L175 Difference]: Start difference. First operand has 151 places, 143 transitions, 334 flow. Second operand 6 states and 786 transitions. [2025-04-30 10:26:35,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 245 transitions, 798 flow [2025-04-30 10:26:35,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 245 transitions, 792 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:35,056 INFO L231 Difference]: Finished difference. Result has 160 places, 189 transitions, 644 flow [2025-04-30 10:26:35,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=644, PETRI_PLACES=160, PETRI_TRANSITIONS=189} [2025-04-30 10:26:35,057 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 21 predicate places. [2025-04-30 10:26:35,057 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 189 transitions, 644 flow [2025-04-30 10:26:35,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 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:35,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:35,058 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:26:35,058 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:35,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash 136768233, now seen corresponding path program 1 times [2025-04-30 10:26:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:35,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321100140] [2025-04-30 10:26:35,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:35,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-30 10:26:35,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-30 10:26:35,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:35,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:35,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:35,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321100140] [2025-04-30 10:26:35,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321100140] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:35,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653171489] [2025-04-30 10:26:35,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:35,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:35,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:35,232 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:35,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:26:35,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-30 10:26:35,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-30 10:26:35,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:35,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:35,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:26:35,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:35,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653171489] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:35,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:35,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:26:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088226460] [2025-04-30 10:26:35,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:35,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:26:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:35,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:26:35,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:26:35,487 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-04-30 10:26:35,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 189 transitions, 644 flow. Second operand has 18 states, 18 states have (on average 125.0) internal successors, (2250), 18 states have internal predecessors, (2250), 0 states have call successors, (0), 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:35,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:35,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-04-30 10:26:35,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:35,744 INFO L116 PetriNetUnfolderBase]: 123/770 cut-off events. [2025-04-30 10:26:35,744 INFO L117 PetriNetUnfolderBase]: For 129/144 co-relation queries the response was YES. [2025-04-30 10:26:35,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 770 events. 123/770 cut-off events. For 129/144 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4490 event pairs, 41 based on Foata normal form. 4/757 useless extension candidates. Maximal degree in co-relation 1250. Up to 126 conditions per place. [2025-04-30 10:26:35,748 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 18 selfloop transitions, 21 changer transitions 0/207 dead transitions. [2025-04-30 10:26:35,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 207 transitions, 810 flow [2025-04-30 10:26:35,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:26:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:26:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2626 transitions. [2025-04-30 10:26:35,753 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9127563434132777 [2025-04-30 10:26:35,753 INFO L175 Difference]: Start difference. First operand has 160 places, 189 transitions, 644 flow. Second operand 21 states and 2626 transitions. [2025-04-30 10:26:35,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 207 transitions, 810 flow [2025-04-30 10:26:35,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 207 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:35,759 INFO L231 Difference]: Finished difference. Result has 185 places, 202 transitions, 774 flow [2025-04-30 10:26:35,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=774, PETRI_PLACES=185, PETRI_TRANSITIONS=202} [2025-04-30 10:26:35,760 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 46 predicate places. [2025-04-30 10:26:35,760 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 202 transitions, 774 flow [2025-04-30 10:26:35,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 125.0) internal successors, (2250), 18 states have internal predecessors, (2250), 0 states have call successors, (0), 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:35,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:35,761 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:35,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-30 10:26:35,966 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:35,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1282176105, now seen corresponding path program 2 times [2025-04-30 10:26:35,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:35,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529865434] [2025-04-30 10:26:35,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:35,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:35,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-04-30 10:26:35,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 128 statements. [2025-04-30 10:26:35,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:35,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-04-30 10:26:36,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:36,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529865434] [2025-04-30 10:26:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529865434] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:36,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267513718] [2025-04-30 10:26:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:36,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:36,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:36,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:36,425 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2025-04-30 10:26:36,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 202 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 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:36,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:36,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2025-04-30 10:26:36,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:36,673 INFO L116 PetriNetUnfolderBase]: 417/1422 cut-off events. [2025-04-30 10:26:36,674 INFO L117 PetriNetUnfolderBase]: For 628/663 co-relation queries the response was YES. [2025-04-30 10:26:36,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3426 conditions, 1422 events. 417/1422 cut-off events. For 628/663 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9195 event pairs, 108 based on Foata normal form. 21/1426 useless extension candidates. Maximal degree in co-relation 3228. Up to 602 conditions per place. [2025-04-30 10:26:36,681 INFO L140 encePairwiseOnDemand]: 120/137 looper letters, 99 selfloop transitions, 53 changer transitions 6/285 dead transitions. [2025-04-30 10:26:36,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 285 transitions, 1442 flow [2025-04-30 10:26:36,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2025-04-30 10:26:36,683 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9075425790754258 [2025-04-30 10:26:36,683 INFO L175 Difference]: Start difference. First operand has 185 places, 202 transitions, 774 flow. Second operand 6 states and 746 transitions. [2025-04-30 10:26:36,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 285 transitions, 1442 flow [2025-04-30 10:26:36,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 285 transitions, 1418 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:26:36,694 INFO L231 Difference]: Finished difference. Result has 189 places, 253 transitions, 1256 flow [2025-04-30 10:26:36,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1256, PETRI_PLACES=189, PETRI_TRANSITIONS=253} [2025-04-30 10:26:36,696 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 50 predicate places. [2025-04-30 10:26:36,697 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 253 transitions, 1256 flow [2025-04-30 10:26:36,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 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:36,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:36,697 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:26:36,698 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:36,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash 135322309, now seen corresponding path program 1 times [2025-04-30 10:26:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:36,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976181400] [2025-04-30 10:26:36,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:36,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:36,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-04-30 10:26:36,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-04-30 10:26:36,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:36,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:36,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:36,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976181400] [2025-04-30 10:26:36,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976181400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:36,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125057674] [2025-04-30 10:26:36,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:36,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:36,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:36,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:36,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:26:37,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-04-30 10:26:37,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-04-30 10:26:37,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:37,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:37,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:26:37,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:37,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:37,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125057674] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:37,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:37,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:26:37,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549536367] [2025-04-30 10:26:37,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:37,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:26:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:37,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:26:37,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:26:37,345 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-04-30 10:26:37,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 253 transitions, 1256 flow. Second operand has 23 states, 23 states have (on average 125.08695652173913) internal successors, (2877), 23 states have internal predecessors, (2877), 0 states have call successors, (0), 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:37,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:37,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-04-30 10:26:37,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:37,694 INFO L116 PetriNetUnfolderBase]: 227/1128 cut-off events. [2025-04-30 10:26:37,695 INFO L117 PetriNetUnfolderBase]: For 978/1007 co-relation queries the response was YES. [2025-04-30 10:26:37,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2849 conditions, 1128 events. 227/1128 cut-off events. For 978/1007 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7335 event pairs, 39 based on Foata normal form. 7/1121 useless extension candidates. Maximal degree in co-relation 2571. Up to 212 conditions per place. [2025-04-30 10:26:37,701 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 21 selfloop transitions, 30 changer transitions 0/270 dead transitions. [2025-04-30 10:26:37,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 270 transitions, 1480 flow [2025-04-30 10:26:37,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:26:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-30 10:26:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3744 transitions. [2025-04-30 10:26:37,708 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.910948905109489 [2025-04-30 10:26:37,708 INFO L175 Difference]: Start difference. First operand has 189 places, 253 transitions, 1256 flow. Second operand 30 states and 3744 transitions. [2025-04-30 10:26:37,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 270 transitions, 1480 flow [2025-04-30 10:26:37,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 270 transitions, 1472 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:37,720 INFO L231 Difference]: Finished difference. Result has 222 places, 263 transitions, 1400 flow [2025-04-30 10:26:37,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1400, PETRI_PLACES=222, PETRI_TRANSITIONS=263} [2025-04-30 10:26:37,721 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 83 predicate places. [2025-04-30 10:26:37,721 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 263 transitions, 1400 flow [2025-04-30 10:26:37,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 125.08695652173913) internal successors, (2877), 23 states have internal predecessors, (2877), 0 states have call successors, (0), 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:37,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:37,723 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:37,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:37,923 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:37,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:37,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1440960617, now seen corresponding path program 2 times [2025-04-30 10:26:37,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:37,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930812682] [2025-04-30 10:26:37,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:37,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-04-30 10:26:37,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 144 statements. [2025-04-30 10:26:37,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:37,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:38,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:38,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930812682] [2025-04-30 10:26:38,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930812682] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:38,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:38,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:38,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606110666] [2025-04-30 10:26:38,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:38,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:38,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:38,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:38,280 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2025-04-30 10:26:38,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 263 transitions, 1400 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:38,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:38,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2025-04-30 10:26:38,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:38,561 INFO L116 PetriNetUnfolderBase]: 571/1817 cut-off events. [2025-04-30 10:26:38,561 INFO L117 PetriNetUnfolderBase]: For 2416/2464 co-relation queries the response was YES. [2025-04-30 10:26:38,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 1817 events. 571/1817 cut-off events. For 2416/2464 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12243 event pairs, 127 based on Foata normal form. 25/1817 useless extension candidates. Maximal degree in co-relation 5256. Up to 841 conditions per place. [2025-04-30 10:26:38,570 INFO L140 encePairwiseOnDemand]: 120/137 looper letters, 120 selfloop transitions, 58 changer transitions 39/355 dead transitions. [2025-04-30 10:26:38,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 355 transitions, 2358 flow [2025-04-30 10:26:38,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2025-04-30 10:26:38,571 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8953771289537713 [2025-04-30 10:26:38,571 INFO L175 Difference]: Start difference. First operand has 222 places, 263 transitions, 1400 flow. Second operand 6 states and 736 transitions. [2025-04-30 10:26:38,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 355 transitions, 2358 flow [2025-04-30 10:26:38,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 355 transitions, 2312 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-30 10:26:38,583 INFO L231 Difference]: Finished difference. Result has 213 places, 290 transitions, 1762 flow [2025-04-30 10:26:38,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1762, PETRI_PLACES=213, PETRI_TRANSITIONS=290} [2025-04-30 10:26:38,585 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 74 predicate places. [2025-04-30 10:26:38,585 INFO L485 AbstractCegarLoop]: Abstraction has has 213 places, 290 transitions, 1762 flow [2025-04-30 10:26:38,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:38,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:38,586 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:26:38,586 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:38,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1575165964, now seen corresponding path program 1 times [2025-04-30 10:26:38,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:38,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509453287] [2025-04-30 10:26:38,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:38,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-04-30 10:26:38,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-04-30 10:26:38,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:38,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:38,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:26:38,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-04-30 10:26:38,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-04-30 10:26:38,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:38,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:38,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:26:38,661 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:26:38,661 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-04-30 10:26:38,662 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-30 10:26:38,663 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-30 10:26:38,663 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-30 10:26:38,663 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-30 10:26:38,663 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-30 10:26:38,663 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-30 10:26:38,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:26:38,663 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2025-04-30 10:26:38,723 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:26:38,724 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:26:38,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:26:38 BasicIcfg [2025-04-30 10:26:38,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:26:38,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:26:38,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:26:38,729 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:26:38,730 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:32" (3/4) ... [2025-04-30 10:26:38,730 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:26:38,783 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-04-30 10:26:38,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:26:38,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:26:38,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:26:38,821 INFO L158 Benchmark]: Toolchain (without parser) took 7046.82ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 112.8MB in the beginning and 230.7MB in the end (delta: -117.9MB). Peak memory consumption was 158.2MB. Max. memory is 16.1GB. [2025-04-30 10:26:38,821 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:38,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.79ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 88.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:26:38,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.44ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:38,824 INFO L158 Benchmark]: Boogie Preprocessor took 35.33ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:38,824 INFO L158 Benchmark]: RCFGBuilder took 361.84ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 64.4MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:26:38,825 INFO L158 Benchmark]: TraceAbstraction took 6069.77ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 63.9MB in the beginning and 243.3MB in the end (delta: -179.4MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. [2025-04-30 10:26:38,825 INFO L158 Benchmark]: Witness Printer took 91.62ms. Allocated memory is still 419.4MB. Free memory was 243.3MB in the beginning and 230.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:26:38,826 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.25ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.79ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 88.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.44ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.33ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 361.84ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 64.4MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6069.77ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 63.9MB in the beginning and 243.3MB in the end (delta: -179.4MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. * Witness Printer took 91.62ms. Allocated memory is still 419.4MB. Free memory was 243.3MB in the beginning and 230.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L679] 0 int data[10]; VAL [data={1:0}] [L680] 0 pthread_mutex_t m[10]; VAL [data={1:0}, m={2:0}] [L688] 0 int i = 0; VAL [data={1:0}, i=0, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=1, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=2, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=3, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=4, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=5, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=6, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=7, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=8, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=9, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=10, m={2:0}] [L688] COND FALSE 0 !(i < 10) VAL [data={1:0}, m={2:0}] [L690] 0 pthread_t id; VAL [data={1:0}, m={2:0}] [L691] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data={1:0}, id=-1, m={2:0}] [L683] EXPR 1 data[4] VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L683] 1 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L693] EXPR 0 data[4] VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] [L683] 1 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L693] 0 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] [L683] 1 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L693] 0 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] [L683] 1 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L693] 0 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] Now there is a data race (on the heap) between C: data[4]++ [683] and C: data[4]++ [693] - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: 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: 683]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 683]: 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, 165 locations, 164 edges, 7 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: 5.9s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1172 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 18 mSDtfsCounter, 1172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 631 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1762occurred in iteration=7, InterpolantAutomatonStates: 81, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1260 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1425 ConstructedInterpolants, 0 QuantifiedInterpolants, 2042 SizeOfPredicates, 22 NumberOfNonLiveVariables, 752 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 365/758 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:38,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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)