./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:39:27,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:39:27,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:39:27,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:39:27,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:39:27,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:39:27,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:39:27,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:39:27,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:39:27,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:39:27,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:39:27,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:39:27,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:39:27,145 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:39:27,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:39:27,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:39:27,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:39:27,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:39:27,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:39:27,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:27,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:27,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:27,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:39:27,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:27,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:27,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:27,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:39:27,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:39:27,147 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:39:27,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:39:27,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:39:27,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:39:27,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:39:27,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:39:27,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:39:27,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:39:27,147 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-jdk21/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 -> a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38 [2025-01-09 21:39:27,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:39:27,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:39:27,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:39:27,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:39:27,362 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:39:27,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2025-01-09 21:39:28,464 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/959f9610a/e9916b6317b5432e908e1362c84eed98/FLAGd512688a3 [2025-01-09 21:39:28,723 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:39:28,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2025-01-09 21:39:28,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/959f9610a/e9916b6317b5432e908e1362c84eed98/FLAGd512688a3 [2025-01-09 21:39:29,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/959f9610a/e9916b6317b5432e908e1362c84eed98 [2025-01-09 21:39:29,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:39:29,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:39:29,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:29,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:39:29,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:39:29,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea24f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29, skipping insertion in model container [2025-01-09 21:39:29,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:39:29,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:29,261 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:39:29,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:29,342 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:39:29,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29 WrapperNode [2025-01-09 21:39:29,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:29,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:29,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:39:29,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:39:29,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,394 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-01-09 21:39:29,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:29,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:39:29,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:39:29,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:39:29,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:39:29,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:39:29,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:39:29,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:39:29,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (1/1) ... [2025-01-09 21:39:29,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:29,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:39:29,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:39:29,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:39:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:39:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:39:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:39:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:39:29,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:39:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:39:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:39:29,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:39:29,474 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:39:29,556 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:39:29,557 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:39:29,803 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:39:29,803 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:39:29,827 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:39:29,829 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:39:29,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:29 BoogieIcfgContainer [2025-01-09 21:39:29,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:39:29,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:39:29,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:39:29,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:39:29,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:29" (1/3) ... [2025-01-09 21:39:29,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bae646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:29, skipping insertion in model container [2025-01-09 21:39:29,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:29" (2/3) ... [2025-01-09 21:39:29,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bae646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:29, skipping insertion in model container [2025-01-09 21:39:29,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:29" (3/3) ... [2025-01-09 21:39:29,837 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-3.i [2025-01-09 21:39:29,847 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:39:29,849 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race-3.i that has 2 procedures, 230 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-01-09 21:39:29,850 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:39:29,909 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:29,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 233 transitions, 470 flow [2025-01-09 21:39:30,015 INFO L124 PetriNetUnfolderBase]: 5/274 cut-off events. [2025-01-09 21:39:30,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:30,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 5/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 233 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 192. Up to 4 conditions per place. [2025-01-09 21:39:30,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 233 transitions, 470 flow [2025-01-09 21:39:30,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 233 transitions, 470 flow [2025-01-09 21:39:30,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:30,036 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a9bbec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:30,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 21:39:30,072 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:30,072 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-01-09 21:39:30,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:30,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:30,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:30,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:30,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:30,077 INFO L85 PathProgramCache]: Analyzing trace with hash -891270066, now seen corresponding path program 1 times [2025-01-09 21:39:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:30,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510377359] [2025-01-09 21:39:30,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:30,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:39:30,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:39:30,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:30,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510377359] [2025-01-09 21:39:30,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510377359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:30,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:30,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:30,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101842856] [2025-01-09 21:39:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:30,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:30,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:30,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:30,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:30,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-01-09 21:39:30,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 233 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-01-09 21:39:30,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:30,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-01-09 21:39:30,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:30,702 INFO L124 PetriNetUnfolderBase]: 98/708 cut-off events. [2025-01-09 21:39:30,702 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:39:30,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 708 events. 98/708 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3309 event pairs, 33 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 731. Up to 138 conditions per place. [2025-01-09 21:39:30,709 INFO L140 encePairwiseOnDemand]: 220/233 looper letters, 32 selfloop transitions, 8 changer transitions 1/249 dead transitions. [2025-01-09 21:39:30,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 249 transitions, 582 flow [2025-01-09 21:39:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2025-01-09 21:39:30,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628040057224606 [2025-01-09 21:39:30,725 INFO L175 Difference]: Start difference. First operand has 233 places, 233 transitions, 470 flow. Second operand 3 states and 673 transitions. [2025-01-09 21:39:30,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 249 transitions, 582 flow [2025-01-09 21:39:30,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 249 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:30,736 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 534 flow [2025-01-09 21:39:30,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2025-01-09 21:39:30,742 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2025-01-09 21:39:30,742 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 534 flow [2025-01-09 21:39:30,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-01-09 21:39:30,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:30,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:30,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:39:30,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:30,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:30,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1322353355, now seen corresponding path program 1 times [2025-01-09 21:39:30,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:30,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655446722] [2025-01-09 21:39:30,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:30,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:39:30,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:39:30,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:30,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:30,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:30,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655446722] [2025-01-09 21:39:30,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655446722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:30,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:30,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:30,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087772142] [2025-01-09 21:39:30,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:30,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:30,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:30,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:30,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-01-09 21:39:30,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-01-09 21:39:30,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:30,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-01-09 21:39:30,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:31,061 INFO L124 PetriNetUnfolderBase]: 114/845 cut-off events. [2025-01-09 21:39:31,061 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2025-01-09 21:39:31,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 845 events. 114/845 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4457 event pairs, 72 based on Foata normal form. 4/793 useless extension candidates. Maximal degree in co-relation 1058. Up to 226 conditions per place. [2025-01-09 21:39:31,064 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 29 selfloop transitions, 7 changer transitions 0/247 dead transitions. [2025-01-09 21:39:31,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 634 flow [2025-01-09 21:39:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2025-01-09 21:39:31,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413447782546495 [2025-01-09 21:39:31,068 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 534 flow. Second operand 3 states and 658 transitions. [2025-01-09 21:39:31,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 634 flow [2025-01-09 21:39:31,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:31,073 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 574 flow [2025-01-09 21:39:31,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2025-01-09 21:39:31,074 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2025-01-09 21:39:31,074 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 574 flow [2025-01-09 21:39:31,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-01-09 21:39:31,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:31,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:39:31,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:31,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash -636381934, now seen corresponding path program 1 times [2025-01-09 21:39:31,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:31,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496733580] [2025-01-09 21:39:31,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:31,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:39:31,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:39:31,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:31,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496733580] [2025-01-09 21:39:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496733580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:31,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:39:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141473558] [2025-01-09 21:39:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:31,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:31,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:31,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:31,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 233 [2025-01-09 21:39:31,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-01-09 21:39:31,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:31,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 233 [2025-01-09 21:39:31,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:31,435 INFO L124 PetriNetUnfolderBase]: 93/762 cut-off events. [2025-01-09 21:39:31,435 INFO L125 PetriNetUnfolderBase]: For 67/70 co-relation queries the response was YES. [2025-01-09 21:39:31,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 762 events. 93/762 cut-off events. For 67/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3867 event pairs, 56 based on Foata normal form. 3/712 useless extension candidates. Maximal degree in co-relation 884. Up to 144 conditions per place. [2025-01-09 21:39:31,439 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 15 selfloop transitions, 2 changer transitions 3/248 dead transitions. [2025-01-09 21:39:31,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 248 transitions, 624 flow [2025-01-09 21:39:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2025-01-09 21:39:31,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570815450643777 [2025-01-09 21:39:31,443 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 574 flow. Second operand 3 states and 669 transitions. [2025-01-09 21:39:31,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 248 transitions, 624 flow [2025-01-09 21:39:31,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 248 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:31,449 INFO L231 Difference]: Finished difference. Result has 239 places, 244 transitions, 572 flow [2025-01-09 21:39:31,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=239, PETRI_TRANSITIONS=244} [2025-01-09 21:39:31,452 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 6 predicate places. [2025-01-09 21:39:31,452 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 244 transitions, 572 flow [2025-01-09 21:39:31,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-01-09 21:39:31,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:31,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:31,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:39:31,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:31,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1177976219, now seen corresponding path program 1 times [2025-01-09 21:39:31,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:31,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168016960] [2025-01-09 21:39:31,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:31,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:31,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:39:31,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:39:31,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:31,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:31,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:31,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168016960] [2025-01-09 21:39:31,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168016960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:31,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:31,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:31,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335670058] [2025-01-09 21:39:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:31,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:31,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:31,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:31,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:31,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 233 [2025-01-09 21:39:31,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 244 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-01-09 21:39:31,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:31,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 233 [2025-01-09 21:39:31,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:31,688 INFO L124 PetriNetUnfolderBase]: 93/723 cut-off events. [2025-01-09 21:39:31,688 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2025-01-09 21:39:31,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 723 events. 93/723 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3678 event pairs, 55 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 859. Up to 131 conditions per place. [2025-01-09 21:39:31,692 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 22 selfloop transitions, 4 changer transitions 0/253 dead transitions. [2025-01-09 21:39:31,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 253 transitions, 642 flow [2025-01-09 21:39:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2025-01-09 21:39:31,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570815450643777 [2025-01-09 21:39:31,694 INFO L175 Difference]: Start difference. First operand has 239 places, 244 transitions, 572 flow. Second operand 3 states and 669 transitions. [2025-01-09 21:39:31,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 253 transitions, 642 flow [2025-01-09 21:39:31,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 253 transitions, 640 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:39:31,701 INFO L231 Difference]: Finished difference. Result has 242 places, 247 transitions, 600 flow [2025-01-09 21:39:31,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=242, PETRI_TRANSITIONS=247} [2025-01-09 21:39:31,703 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 9 predicate places. [2025-01-09 21:39:31,703 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 247 transitions, 600 flow [2025-01-09 21:39:31,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-01-09 21:39:31,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:31,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:31,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:39:31,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:31,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:31,705 INFO L85 PathProgramCache]: Analyzing trace with hash 298645286, now seen corresponding path program 1 times [2025-01-09 21:39:31,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:31,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170087145] [2025-01-09 21:39:31,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:31,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:31,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 21:39:31,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 21:39:31,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:31,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:31,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:31,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170087145] [2025-01-09 21:39:31,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170087145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:31,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:31,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:31,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380826140] [2025-01-09 21:39:31,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:31,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:31,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:31,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:31,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 233 [2025-01-09 21:39:31,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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-01-09 21:39:31,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:31,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 233 [2025-01-09 21:39:31,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:31,928 INFO L124 PetriNetUnfolderBase]: 85/770 cut-off events. [2025-01-09 21:39:31,928 INFO L125 PetriNetUnfolderBase]: For 84/91 co-relation queries the response was YES. [2025-01-09 21:39:31,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 770 events. 85/770 cut-off events. For 84/91 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4049 event pairs, 45 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 938. Up to 113 conditions per place. [2025-01-09 21:39:31,932 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 17 selfloop transitions, 4 changer transitions 1/253 dead transitions. [2025-01-09 21:39:31,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 253 transitions, 660 flow [2025-01-09 21:39:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2025-01-09 21:39:31,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585121602288984 [2025-01-09 21:39:31,935 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 600 flow. Second operand 3 states and 670 transitions. [2025-01-09 21:39:31,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 253 transitions, 660 flow [2025-01-09 21:39:31,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 253 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:31,943 INFO L231 Difference]: Finished difference. Result has 244 places, 249 transitions, 620 flow [2025-01-09 21:39:31,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=244, PETRI_TRANSITIONS=249} [2025-01-09 21:39:31,944 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 11 predicate places. [2025-01-09 21:39:31,944 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 249 transitions, 620 flow [2025-01-09 21:39:31,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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-01-09 21:39:31,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:31,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:31,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:39:31,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:31,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:31,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2010086699, now seen corresponding path program 1 times [2025-01-09 21:39:31,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:31,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122201538] [2025-01-09 21:39:31,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:31,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:31,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 21:39:31,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 21:39:31,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:31,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:32,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:32,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122201538] [2025-01-09 21:39:32,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122201538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:32,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:32,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:32,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595825607] [2025-01-09 21:39:32,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:32,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:32,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:32,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:32,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:32,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-01-09 21:39:32,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 249 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-01-09 21:39:32,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:32,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-01-09 21:39:32,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:32,219 INFO L124 PetriNetUnfolderBase]: 159/956 cut-off events. [2025-01-09 21:39:32,219 INFO L125 PetriNetUnfolderBase]: For 187/193 co-relation queries the response was YES. [2025-01-09 21:39:32,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 956 events. 159/956 cut-off events. For 187/193 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5487 event pairs, 73 based on Foata normal form. 1/920 useless extension candidates. Maximal degree in co-relation 1450. Up to 274 conditions per place. [2025-01-09 21:39:32,222 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 29 selfloop transitions, 11 changer transitions 4/262 dead transitions. [2025-01-09 21:39:32,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 262 transitions, 742 flow [2025-01-09 21:39:32,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2025-01-09 21:39:32,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513590844062947 [2025-01-09 21:39:32,224 INFO L175 Difference]: Start difference. First operand has 244 places, 249 transitions, 620 flow. Second operand 3 states and 665 transitions. [2025-01-09 21:39:32,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 262 transitions, 742 flow [2025-01-09 21:39:32,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 262 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:32,230 INFO L231 Difference]: Finished difference. Result has 246 places, 253 transitions, 688 flow [2025-01-09 21:39:32,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=246, PETRI_TRANSITIONS=253} [2025-01-09 21:39:32,231 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 13 predicate places. [2025-01-09 21:39:32,231 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 253 transitions, 688 flow [2025-01-09 21:39:32,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-01-09 21:39:32,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:32,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:32,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:39:32,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:32,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash 300260320, now seen corresponding path program 1 times [2025-01-09 21:39:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351345417] [2025-01-09 21:39:32,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:32,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:39:32,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:39:32,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:32,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:32,277 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:39:32,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:39:32,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:39:32,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:32,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:32,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:39:32,370 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:39:32,371 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2025-01-09 21:39:32,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-01-09 21:39:32,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-01-09 21:39:32,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-01-09 21:39:32,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-01-09 21:39:32,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-01-09 21:39:32,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-01-09 21:39:32,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-01-09 21:39:32,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-01-09 21:39:32,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-01-09 21:39:32,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-01-09 21:39:32,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:39:32,373 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:32,452 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-01-09 21:39:32,453 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-01-09 21:39:32,454 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-01-09 21:39:32,460 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:39:32,460 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:39:32,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:39:32 BasicIcfg [2025-01-09 21:39:32,463 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:39:32,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:39:32,464 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:39:32,464 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:39:32,464 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:29" (3/4) ... [2025-01-09 21:39:32,465 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:39:32,496 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-01-09 21:39:32,496 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-01-09 21:39:32,497 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-01-09 21:39:32,526 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-01-09 21:39:32,558 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:39:32,558 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:39:32,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:39:32,559 INFO L158 Benchmark]: Toolchain (without parser) took 3528.67ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 107.5MB in the beginning and 151.9MB in the end (delta: -44.4MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2025-01-09 21:39:32,559 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:39:32,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.57ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 87.1MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:39:32,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 84.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:39:32,560 INFO L158 Benchmark]: Boogie Preprocessor took 30.37ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 82.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:39:32,560 INFO L158 Benchmark]: RCFGBuilder took 400.60ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 60.8MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:39:32,560 INFO L158 Benchmark]: TraceAbstraction took 2632.03ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 60.7MB in the beginning and 188.5MB in the end (delta: -127.8MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2025-01-09 21:39:32,560 INFO L158 Benchmark]: Witness Printer took 94.88ms. Allocated memory is still 302.0MB. Free memory was 188.5MB in the beginning and 151.9MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:39:32,561 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.13ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.57ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 87.1MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 84.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.37ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 82.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.60ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 60.8MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2632.03ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 60.7MB in the beginning and 188.5MB in the end (delta: -127.8MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * Witness Printer took 94.88ms. Allocated memory is still 302.0MB. Free memory was 188.5MB in the beginning and 151.9MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = -1; VAL [threads_alive=-1] [L686] 0 pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L687] 0 pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L688] 0 int data = 0; VAL [data=0, threads_alive=-1, threads_alive_mutex={1:0}] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}] [L701] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L702] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}] [L702] RET 0 assume_abort_if_not(threads_total >= 0) [L703] 0 int i = 0; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L703] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={2:0}, i=0, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L705] 0 threads_alive++ VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L707] 0 pthread_t tid; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L708] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1, tid=-1] [L703] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L712] COND FALSE 0 !(\read(threads_alive)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [715] and C: data = __VERIFIER_nondet_int() [692] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: 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: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: 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, 263 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 19 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=688occurred in iteration=6, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1021 ConstructedInterpolants, 0 QuantifiedInterpolants, 1639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:39:32,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)