./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_13-idxunknown_lock.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_13-idxunknown_lock.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7688aff6d5d22cc8ccec6097e1f98cf9f4c3da7a9a8bbabab449855d0421cf17 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:21,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:21,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:08:21,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:21,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:21,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:21,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:21,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:21,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:21,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:21,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:21,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:21,302 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:21,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:21,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:21,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:21,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:21,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:21,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:21,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:21,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:21,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:21,302 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:21,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:21,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:21,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:21,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:21,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:21,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:21,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:21,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:21,304 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 -> 7688aff6d5d22cc8ccec6097e1f98cf9f4c3da7a9a8bbabab449855d0421cf17 [2025-04-29 11:08:21,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:21,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:21,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:21,547 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:21,548 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:21,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_13-idxunknown_lock.c [2025-04-29 11:08:22,838 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5466368b/4b2e0b2e013b46f7a7deb914f2891d84/FLAG9e99bcd2c [2025-04-29 11:08:23,032 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:23,032 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/05-lval_ls_13-idxunknown_lock.c [2025-04-29 11:08:23,034 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:23,038 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5466368b/4b2e0b2e013b46f7a7deb914f2891d84/FLAG9e99bcd2c [2025-04-29 11:08:23,839 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5466368b/4b2e0b2e013b46f7a7deb914f2891d84 [2025-04-29 11:08:23,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:23,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:23,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:23,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:23,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:23,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:23" (1/1) ... [2025-04-29 11:08:23,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275fb87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:23, skipping insertion in model container [2025-04-29 11:08:23,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:23" (1/1) ... [2025-04-29 11:08:23,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:24,016 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:24,025 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:24,056 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:24,070 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:24,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24 WrapperNode [2025-04-29 11:08:24,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:24,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:24,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:24,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:24,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,112 INFO L138 Inliner]: procedures = 14, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-04-29 11:08:24,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:24,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:24,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:24,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:24,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:24,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:24,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:24,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:24,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:24,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:24,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:08:24,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:08:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:24,198 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:08:24,259 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:24,260 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:24,480 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:24,482 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:24,498 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:24,498 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:24,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:24 BoogieIcfgContainer [2025-04-29 11:08:24,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:24,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:24,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:24,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:24,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:23" (1/3) ... [2025-04-29 11:08:24,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d348d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:24, skipping insertion in model container [2025-04-29 11:08:24,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24" (2/3) ... [2025-04-29 11:08:24,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d348d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:24, skipping insertion in model container [2025-04-29 11:08:24,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:24" (3/3) ... [2025-04-29 11:08:24,507 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_13-idxunknown_lock.c [2025-04-29 11:08:24,517 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:24,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_13-idxunknown_lock.c that has 2 procedures, 108 locations, 108 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-29 11:08:24,519 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:24,576 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:24,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 109 transitions, 222 flow [2025-04-29 11:08:24,653 INFO L116 PetriNetUnfolderBase]: 2/108 cut-off events. [2025-04-29 11:08:24,656 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:24,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2025-04-29 11:08:24,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 109 transitions, 222 flow [2025-04-29 11:08:24,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 108 transitions, 219 flow [2025-04-29 11:08:24,672 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:24,680 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;@d54fd6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:24,681 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:08:24,697 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:24,697 INFO L116 PetriNetUnfolderBase]: 2/70 cut-off events. [2025-04-29 11:08:24,697 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:24,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:24,701 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] [2025-04-29 11:08:24,701 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-29 11:08:24,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1343885503, now seen corresponding path program 1 times [2025-04-29 11:08:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:24,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381289528] [2025-04-29 11:08:24,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:24,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:24,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:08:24,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:08:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:24,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:24,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381289528] [2025-04-29 11:08:24,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381289528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:24,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:24,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:08:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096868622] [2025-04-29 11:08:24,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:24,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:24,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:24,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:24,962 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 109 [2025-04-29 11:08:24,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:24,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:24,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 109 [2025-04-29 11:08:24,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:25,042 INFO L116 PetriNetUnfolderBase]: 7/192 cut-off events. [2025-04-29 11:08:25,042 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:25,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 192 events. 7/192 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 326 event pairs, 6 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 153. Up to 24 conditions per place. [2025-04-29 11:08:25,044 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 10 selfloop transitions, 2 changer transitions 1/108 dead transitions. [2025-04-29 11:08:25,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 108 transitions, 243 flow [2025-04-29 11:08:25,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2025-04-29 11:08:25,058 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9327217125382263 [2025-04-29 11:08:25,060 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 219 flow. Second operand 3 states and 305 transitions. [2025-04-29 11:08:25,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 108 transitions, 243 flow [2025-04-29 11:08:25,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 108 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:25,067 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 226 flow [2025-04-29 11:08:25,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2025-04-29 11:08:25,073 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 2 predicate places. [2025-04-29 11:08:25,073 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 226 flow [2025-04-29 11:08:25,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:25,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:25,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:25,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:25,075 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-29 11:08:25,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1958511093, now seen corresponding path program 1 times [2025-04-29 11:08:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:25,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168856881] [2025-04-29 11:08:25,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:25,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:25,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:08:25,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:08:25,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:25,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:25,266 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-29 11:08:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:25,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168856881] [2025-04-29 11:08:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168856881] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:25,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022582023] [2025-04-29 11:08:25,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:25,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:25,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:25,269 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-29 11:08:25,270 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-29 11:08:25,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:08:25,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:08:25,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:25,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:25,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:08:25,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:25,393 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-29 11:08:25,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:25,446 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-29 11:08:25,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022582023] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:25,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:25,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:08:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988896989] [2025-04-29 11:08:25,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:25,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:25,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:25,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:25,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:25,478 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-04-29 11:08:25,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 226 flow. Second operand has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:25,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:25,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-04-29 11:08:25,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:25,594 INFO L116 PetriNetUnfolderBase]: 7/198 cut-off events. [2025-04-29 11:08:25,595 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:25,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 198 events. 7/198 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 319 event pairs, 6 based on Foata normal form. 2/188 useless extension candidates. Maximal degree in co-relation 200. Up to 24 conditions per place. [2025-04-29 11:08:25,596 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 14 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-04-29 11:08:25,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 290 flow [2025-04-29 11:08:25,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 871 transitions. [2025-04-29 11:08:25,603 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8878695208970439 [2025-04-29 11:08:25,603 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 226 flow. Second operand 9 states and 871 transitions. [2025-04-29 11:08:25,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 290 flow [2025-04-29 11:08:25,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 115 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:25,605 INFO L231 Difference]: Finished difference. Result has 121 places, 113 transitions, 274 flow [2025-04-29 11:08:25,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=274, PETRI_PLACES=121, PETRI_TRANSITIONS=113} [2025-04-29 11:08:25,606 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 11 predicate places. [2025-04-29 11:08:25,606 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 113 transitions, 274 flow [2025-04-29 11:08:25,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:25,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:25,609 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] [2025-04-29 11:08:25,616 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-29 11:08:25,809 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-29 11:08:25,810 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-29 11:08:25,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1301985227, now seen corresponding path program 2 times [2025-04-29 11:08:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:25,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189091315] [2025-04-29 11:08:25,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:25,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-04-29 11:08:25,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 70 statements. [2025-04-29 11:08:25,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:25,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:26,183 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-29 11:08:26,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:26,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189091315] [2025-04-29 11:08:26,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189091315] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:26,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:26,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:26,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255234954] [2025-04-29 11:08:26,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:26,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:26,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:26,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:26,375 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 109 [2025-04-29 11:08:26,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:26,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:26,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 109 [2025-04-29 11:08:26,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:26,669 INFO L116 PetriNetUnfolderBase]: 261/978 cut-off events. [2025-04-29 11:08:26,670 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:08:26,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 978 events. 261/978 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6021 event pairs, 67 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1507. Up to 257 conditions per place. [2025-04-29 11:08:26,679 INFO L140 encePairwiseOnDemand]: 87/109 looper letters, 88 selfloop transitions, 42 changer transitions 0/215 dead transitions. [2025-04-29 11:08:26,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 215 transitions, 738 flow [2025-04-29 11:08:26,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 612 transitions. [2025-04-29 11:08:26,683 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9357798165137615 [2025-04-29 11:08:26,683 INFO L175 Difference]: Start difference. First operand has 121 places, 113 transitions, 274 flow. Second operand 6 states and 612 transitions. [2025-04-29 11:08:26,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 215 transitions, 738 flow [2025-04-29 11:08:26,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 215 transitions, 732 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:26,687 INFO L231 Difference]: Finished difference. Result has 130 places, 159 transitions, 584 flow [2025-04-29 11:08:26,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=584, PETRI_PLACES=130, PETRI_TRANSITIONS=159} [2025-04-29 11:08:26,688 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 20 predicate places. [2025-04-29 11:08:26,688 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 159 transitions, 584 flow [2025-04-29 11:08:26,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:26,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:26,689 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] [2025-04-29 11:08:26,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:26,689 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-29 11:08:26,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:26,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1855816144, now seen corresponding path program 1 times [2025-04-29 11:08:26,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:26,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686895080] [2025-04-29 11:08:26,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:26,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:26,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-29 11:08:26,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:08:26,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:26,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:26,851 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-29 11:08:26,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:26,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686895080] [2025-04-29 11:08:26,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686895080] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:26,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201103102] [2025-04-29 11:08:26,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:26,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:26,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:26,854 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-29 11:08:26,856 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-29 11:08:26,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-29 11:08:26,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:08:26,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:26,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:26,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:08:26,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:26,983 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-29 11:08:26,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:27,085 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-29 11:08:27,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201103102] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:27,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:08:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705281237] [2025-04-29 11:08:27,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:27,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:08:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:27,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:08:27,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:08:27,136 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-04-29 11:08:27,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 159 transitions, 584 flow. Second operand has 18 states, 18 states have (on average 96.0) internal successors, (1728), 18 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:27,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:27,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-04-29 11:08:27,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:27,391 INFO L116 PetriNetUnfolderBase]: 122/748 cut-off events. [2025-04-29 11:08:27,393 INFO L117 PetriNetUnfolderBase]: For 128/141 co-relation queries the response was YES. [2025-04-29 11:08:27,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 748 events. 122/748 cut-off events. For 128/141 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4563 event pairs, 40 based on Foata normal form. 4/738 useless extension candidates. Maximal degree in co-relation 1268. Up to 125 conditions per place. [2025-04-29 11:08:27,398 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 18 selfloop transitions, 21 changer transitions 0/177 dead transitions. [2025-04-29 11:08:27,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 177 transitions, 750 flow [2025-04-29 11:08:27,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:08:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:08:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2017 transitions. [2025-04-29 11:08:27,405 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8811708169506335 [2025-04-29 11:08:27,405 INFO L175 Difference]: Start difference. First operand has 130 places, 159 transitions, 584 flow. Second operand 21 states and 2017 transitions. [2025-04-29 11:08:27,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 177 transitions, 750 flow [2025-04-29 11:08:27,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 177 transitions, 750 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:27,411 INFO L231 Difference]: Finished difference. Result has 155 places, 172 transitions, 714 flow [2025-04-29 11:08:27,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=714, PETRI_PLACES=155, PETRI_TRANSITIONS=172} [2025-04-29 11:08:27,412 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 45 predicate places. [2025-04-29 11:08:27,412 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 172 transitions, 714 flow [2025-04-29 11:08:27,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 96.0) internal successors, (1728), 18 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:27,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:27,414 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] [2025-04-29 11:08:27,420 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-29 11:08:27,614 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-29 11:08:27,614 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-29 11:08:27,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1214571856, now seen corresponding path program 2 times [2025-04-29 11:08:27,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:27,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511142721] [2025-04-29 11:08:27,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:27,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 98 statements into 2 equivalence classes. [2025-04-29 11:08:27,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 63 of 98 statements. [2025-04-29 11:08:27,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:27,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:27,891 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-29 11:08:27,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:27,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511142721] [2025-04-29 11:08:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511142721] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:27,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639182733] [2025-04-29 11:08:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:27,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:27,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:27,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:28,021 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2025-04-29 11:08:28,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 172 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:28,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:28,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2025-04-29 11:08:28,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:28,226 INFO L116 PetriNetUnfolderBase]: 417/1392 cut-off events. [2025-04-29 11:08:28,226 INFO L117 PetriNetUnfolderBase]: For 624/659 co-relation queries the response was YES. [2025-04-29 11:08:28,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1392 events. 417/1392 cut-off events. For 624/659 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9227 event pairs, 108 based on Foata normal form. 21/1397 useless extension candidates. Maximal degree in co-relation 3238. Up to 602 conditions per place. [2025-04-29 11:08:28,236 INFO L140 encePairwiseOnDemand]: 92/109 looper letters, 99 selfloop transitions, 53 changer transitions 6/255 dead transitions. [2025-04-29 11:08:28,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 255 transitions, 1382 flow [2025-04-29 11:08:28,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 572 transitions. [2025-04-29 11:08:28,238 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8746177370030581 [2025-04-29 11:08:28,239 INFO L175 Difference]: Start difference. First operand has 155 places, 172 transitions, 714 flow. Second operand 6 states and 572 transitions. [2025-04-29 11:08:28,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 255 transitions, 1382 flow [2025-04-29 11:08:28,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 255 transitions, 1358 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:08:28,246 INFO L231 Difference]: Finished difference. Result has 159 places, 223 transitions, 1196 flow [2025-04-29 11:08:28,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1196, PETRI_PLACES=159, PETRI_TRANSITIONS=223} [2025-04-29 11:08:28,248 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 49 predicate places. [2025-04-29 11:08:28,249 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 223 transitions, 1196 flow [2025-04-29 11:08:28,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:28,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:28,249 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] [2025-04-29 11:08:28,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:28,249 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-29 11:08:28,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:28,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1964727091, now seen corresponding path program 1 times [2025-04-29 11:08:28,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:28,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474562564] [2025-04-29 11:08:28,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:28,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:28,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-29 11:08:28,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-29 11:08:28,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:28,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:28,478 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-29 11:08:28,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:28,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474562564] [2025-04-29 11:08:28,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474562564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:28,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454536848] [2025-04-29 11:08:28,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:28,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:28,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:28,488 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-29 11:08:28,489 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-29 11:08:28,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-29 11:08:28,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-29 11:08:28,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:28,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:28,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:08:28,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:28,629 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-29 11:08:28,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:28,827 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-29 11:08:28,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454536848] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:28,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:28,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:08:28,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699126187] [2025-04-29 11:08:28,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:28,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:08:28,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:28,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:08:28,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:08:28,852 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-04-29 11:08:28,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 223 transitions, 1196 flow. Second operand has 23 states, 23 states have (on average 96.08695652173913) internal successors, (2210), 23 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:28,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:28,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-04-29 11:08:28,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:29,181 INFO L116 PetriNetUnfolderBase]: 227/1098 cut-off events. [2025-04-29 11:08:29,181 INFO L117 PetriNetUnfolderBase]: For 972/1001 co-relation queries the response was YES. [2025-04-29 11:08:29,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 1098 events. 227/1098 cut-off events. For 972/1001 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7352 event pairs, 39 based on Foata normal form. 7/1092 useless extension candidates. Maximal degree in co-relation 2581. Up to 212 conditions per place. [2025-04-29 11:08:29,188 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 21 selfloop transitions, 30 changer transitions 0/240 dead transitions. [2025-04-29 11:08:29,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 240 transitions, 1420 flow [2025-04-29 11:08:29,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:08:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:08:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2874 transitions. [2025-04-29 11:08:29,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8788990825688073 [2025-04-29 11:08:29,194 INFO L175 Difference]: Start difference. First operand has 159 places, 223 transitions, 1196 flow. Second operand 30 states and 2874 transitions. [2025-04-29 11:08:29,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 240 transitions, 1420 flow [2025-04-29 11:08:29,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 240 transitions, 1412 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:29,205 INFO L231 Difference]: Finished difference. Result has 192 places, 233 transitions, 1340 flow [2025-04-29 11:08:29,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1340, PETRI_PLACES=192, PETRI_TRANSITIONS=233} [2025-04-29 11:08:29,207 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 82 predicate places. [2025-04-29 11:08:29,207 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 233 transitions, 1340 flow [2025-04-29 11:08:29,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 96.08695652173913) internal successors, (2210), 23 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:29,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:29,209 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] [2025-04-29 11:08:29,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:08:29,410 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-29 11:08:29,410 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-29 11:08:29,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1563838039, now seen corresponding path program 2 times [2025-04-29 11:08:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:29,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146554441] [2025-04-29 11:08:29,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:29,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-04-29 11:08:29,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 114 statements. [2025-04-29 11:08:29,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:29,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:29,593 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-29 11:08:29,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:29,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146554441] [2025-04-29 11:08:29,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146554441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:29,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:29,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:29,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573948983] [2025-04-29 11:08:29,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:29,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:29,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:29,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:29,738 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2025-04-29 11:08:29,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 233 transitions, 1340 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:29,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:29,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2025-04-29 11:08:29,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:30,018 INFO L116 PetriNetUnfolderBase]: 571/1787 cut-off events. [2025-04-29 11:08:30,018 INFO L117 PetriNetUnfolderBase]: For 2413/2461 co-relation queries the response was YES. [2025-04-29 11:08:30,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5507 conditions, 1787 events. 571/1787 cut-off events. For 2413/2461 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12274 event pairs, 127 based on Foata normal form. 25/1788 useless extension candidates. Maximal degree in co-relation 5266. Up to 841 conditions per place. [2025-04-29 11:08:30,030 INFO L140 encePairwiseOnDemand]: 92/109 looper letters, 120 selfloop transitions, 58 changer transitions 39/325 dead transitions. [2025-04-29 11:08:30,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 325 transitions, 2298 flow [2025-04-29 11:08:30,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:30,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions. [2025-04-29 11:08:30,032 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8593272171253823 [2025-04-29 11:08:30,032 INFO L175 Difference]: Start difference. First operand has 192 places, 233 transitions, 1340 flow. Second operand 6 states and 562 transitions. [2025-04-29 11:08:30,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 325 transitions, 2298 flow [2025-04-29 11:08:30,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 325 transitions, 2252 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:08:30,047 INFO L231 Difference]: Finished difference. Result has 183 places, 260 transitions, 1702 flow [2025-04-29 11:08:30,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1702, PETRI_PLACES=183, PETRI_TRANSITIONS=260} [2025-04-29 11:08:30,048 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 73 predicate places. [2025-04-29 11:08:30,048 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 260 transitions, 1702 flow [2025-04-29 11:08:30,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:30,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:30,048 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] [2025-04-29 11:08:30,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:08:30,049 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-29 11:08:30,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1883294783, now seen corresponding path program 1 times [2025-04-29 11:08:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:30,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145898564] [2025-04-29 11:08:30,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:30,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:30,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:08:30,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:30,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:30,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:30,093 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:08:30,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:08:30,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:30,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:30,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:30,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:08:30,146 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:08:30,147 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-04-29 11:08:30,149 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-29 11:08:30,149 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-29 11:08:30,149 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-29 11:08:30,149 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-29 11:08:30,149 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-29 11:08:30,149 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-29 11:08:30,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:30,150 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2025-04-29 11:08:30,208 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:08:30,208 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:08:30,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:08:30 BasicIcfg [2025-04-29 11:08:30,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:08:30,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:08:30,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:08:30,215 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:08:30,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:24" (3/4) ... [2025-04-29 11:08:30,216 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:08:30,275 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 15. [2025-04-29 11:08:30,315 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:08:30,318 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:08:30,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:08:30,319 INFO L158 Benchmark]: Toolchain (without parser) took 6477.73ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.4MB in the beginning and 259.4MB in the end (delta: -146.1MB). Peak memory consumption was 133.5MB. Max. memory is 16.1GB. [2025-04-29 11:08:30,320 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:30,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.67ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 98.7MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:30,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.35ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:30,320 INFO L158 Benchmark]: Boogie Preprocessor took 34.16ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:30,321 INFO L158 Benchmark]: RCFGBuilder took 349.87ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 78.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:30,321 INFO L158 Benchmark]: TraceAbstraction took 5713.79ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 77.9MB in the beginning and 272.0MB in the end (delta: -194.1MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2025-04-29 11:08:30,321 INFO L158 Benchmark]: Witness Printer took 104.21ms. Allocated memory is still 427.8MB. Free memory was 272.0MB in the beginning and 259.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:30,322 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.15ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.67ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 98.7MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.35ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.16ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 349.87ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 78.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5713.79ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 77.9MB in the beginning and 272.0MB in the end (delta: -194.1MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. * Witness Printer took 104.21ms. Allocated memory is still 427.8MB. Free memory was 272.0MB in the beginning and 259.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 35]: Data race detected Data race detected The following path leads to a data race: [L16] 0 int data[10]; VAL [data={1:0}] [L17] 0 pthread_mutex_t m[10]; VAL [data={1:0}, m={2:0}] [L27] 0 int i = 0; VAL [data={1:0}, i=0, m={2:0}] [L27] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L27] 0 i++ VAL [data={1:0}, i=1, m={2:0}] [L27] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L27] 0 i++ VAL [data={1:0}, i=2, m={2:0}] [L27] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L27] 0 i++ VAL [data={1:0}, i=3, m={2:0}] [L27] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L27] 0 i++ VAL [data={1:0}, i=4, m={2:0}] [L27] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L27] 0 i++ VAL [data={1:0}, i=5, m={2:0}] [L27] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L27] 0 i++ VAL [data={1:0}, i=6, m={2:0}] [L27] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L27] 0 i++ VAL [data={1:0}, i=7, m={2:0}] [L27] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L27] 0 i++ VAL [data={1:0}, i=8, m={2:0}] [L27] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L27] 0 i++ VAL [data={1:0}, i=9, m={2:0}] [L27] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L27] 0 i++ VAL [data={1:0}, i=10, m={2:0}] [L27] COND FALSE 0 !(i < 10) VAL [data={1:0}, m={2:0}] [L30] 0 int i = __VERIFIER_nondet_int(); VAL [data={1:0}, i=0, m={2:0}] [L31] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, data={1:0}, m={2:0}] [L31] RET 0 assume_abort_if_not(0 <= i && i < 10) [L32] 0 pthread_t id; VAL [data={1:0}, i=0, m={2:0}] [L33] FCALL, FORK 0 pthread_create(&id, NULL, t_fun, NULL) VAL [\at(arg, Pre)={0:0}, data={1:0}, i=0, id=-1, m={2:0}] [L35] EXPR 0 data[4] VAL [\at(arg, Pre)={0:0}, data={1:0}, i=0, id=-1, m={2:0}] [L21] EXPR 1 data[4] VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L21] 1 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L35] 0 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, i=0, id=-1, m={2:0}] [L21] 1 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L35] 0 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, i=0, id=-1, m={2:0}] [L21] 1 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L35] 0 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, i=0, id=-1, m={2:0}] Now there is a data race (on the heap) between C: data[4]++ [21] and C: data[4]++ [35] - UnprovableResult [Line: 35]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that 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: 21]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 21]: 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, 136 locations, 136 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.6s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 484 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1269 IncrementalHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 12 mSDtfsCounter, 1269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 451 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1702occurred 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, 1.9s InterpolantComputationTime, 930 NumberOfCodeBlocks, 830 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1035 ConstructedInterpolants, 0 QuantifiedInterpolants, 1652 SizeOfPredicates, 22 NumberOfNonLiveVariables, 554 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-29 11:08:30,338 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)