./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/fkp2013-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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 ../sv-benchmarks/c/pthread-lit/fkp2013-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e812004a84a4494a04d3a026bee09dbf1dbf7d202520f02258b12ac817a7a74e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:51:55,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:51:55,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:51:55,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:51:55,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:51:55,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:51:55,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:51:55,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:51:55,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:51:55,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:51:55,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:51:55,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:51:55,484 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:51:55,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:51:55,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:51:55,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:51:55,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:51:55,487 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 -> e812004a84a4494a04d3a026bee09dbf1dbf7d202520f02258b12ac817a7a74e [2025-03-08 21:51:55,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:51:55,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:51:55,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:51:55,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:51:55,708 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:51:55,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/fkp2013-2.i [2025-03-08 21:51:56,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0089961bd/5e13d688e64a4af5abb7f4851093c0e7/FLAG28ec57c6a [2025-03-08 21:51:57,114 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:51:57,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/fkp2013-2.i [2025-03-08 21:51:57,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0089961bd/5e13d688e64a4af5abb7f4851093c0e7/FLAG28ec57c6a [2025-03-08 21:51:57,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0089961bd/5e13d688e64a4af5abb7f4851093c0e7 [2025-03-08 21:51:57,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:51:57,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:51:57,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:51:57,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:51:57,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:51:57,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580c9718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57, skipping insertion in model container [2025-03-08 21:51:57,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:51:57,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:51:57,737 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:51:57,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:51:57,814 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:51:57,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57 WrapperNode [2025-03-08 21:51:57,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:51:57,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:51:57,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:51:57,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:51:57,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,846 INFO L138 Inliner]: procedures = 171, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-03-08 21:51:57,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:51:57,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:51:57,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:51:57,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:51:57,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:51:57,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:51:57,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:51:57,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:51:57,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (1/1) ... [2025-03-08 21:51:57,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:51:57,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:51:57,892 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-03-08 21:51:57,895 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-03-08 21:51:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-08 21:51:57,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-08 21:51:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-08 21:51:57,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-08 21:51:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:51:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:51:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:51:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:51:57,912 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:51:58,000 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:51:58,002 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:51:58,123 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:51:58,123 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:51:58,135 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:51:58,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:51:58,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:51:58 BoogieIcfgContainer [2025-03-08 21:51:58,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:51:58,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:51:58,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:51:58,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:51:58,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:51:57" (1/3) ... [2025-03-08 21:51:58,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5f9ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:51:58, skipping insertion in model container [2025-03-08 21:51:58,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:57" (2/3) ... [2025-03-08 21:51:58,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5f9ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:51:58, skipping insertion in model container [2025-03-08 21:51:58,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:51:58" (3/3) ... [2025-03-08 21:51:58,147 INFO L128 eAbstractionObserver]: Analyzing ICFG fkp2013-2.i [2025-03-08 21:51:58,159 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:51:58,161 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fkp2013-2.i that has 3 procedures, 76 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-08 21:51:58,161 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:51:58,216 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:51:58,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 78 transitions, 164 flow [2025-03-08 21:51:58,284 INFO L124 PetriNetUnfolderBase]: 2/87 cut-off events. [2025-03-08 21:51:58,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:51:58,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2025-03-08 21:51:58,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 78 transitions, 164 flow [2025-03-08 21:51:58,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 77 transitions, 161 flow [2025-03-08 21:51:58,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:51:58,310 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;@5f43bf32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:51:58,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-08 21:51:58,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:51:58,318 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-08 21:51:58,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:51:58,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:51:58,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:51:58,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 21:51:58,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:51:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash 375251974, now seen corresponding path program 1 times [2025-03-08 21:51:58,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:51:58,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96288440] [2025-03-08 21:51:58,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:51:58,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:51:58,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 21:51:58,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 21:51:58,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:51:58,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:51:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:51:58,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:51:58,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96288440] [2025-03-08 21:51:58,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96288440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:51:58,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:51:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:51:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053212555] [2025-03-08 21:51:58,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:51:58,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:51:58,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:51:58,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:51:58,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:51:58,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 78 [2025-03-08 21:51:58,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-03-08 21:51:58,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:51:58,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 78 [2025-03-08 21:51:58,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:51:58,581 INFO L124 PetriNetUnfolderBase]: 11/187 cut-off events. [2025-03-08 21:51:58,581 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 21:51:58,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 187 events. 11/187 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 721 event pairs, 11 based on Foata normal form. 14/174 useless extension candidates. Maximal degree in co-relation 194. Up to 31 conditions per place. [2025-03-08 21:51:58,583 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 9 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-08 21:51:58,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 173 flow [2025-03-08 21:51:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:51:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:51:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2025-03-08 21:51:58,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8675213675213675 [2025-03-08 21:51:58,594 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 161 flow. Second operand 3 states and 203 transitions. [2025-03-08 21:51:58,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 173 flow [2025-03-08 21:51:58,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:51:58,602 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 154 flow [2025-03-08 21:51:58,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2025-03-08 21:51:58,606 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -2 predicate places. [2025-03-08 21:51:58,606 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 154 flow [2025-03-08 21:51:58,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-03-08 21:51:58,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:51:58,607 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] [2025-03-08 21:51:58,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:51:58,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 21:51:58,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:51:58,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1601627715, now seen corresponding path program 1 times [2025-03-08 21:51:58,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:51:58,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954194157] [2025-03-08 21:51:58,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:51:58,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:51:58,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 21:51:58,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 21:51:58,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:51:58,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:51:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:51:58,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:51:58,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954194157] [2025-03-08 21:51:58,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954194157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:51:58,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:51:58,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:51:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499752790] [2025-03-08 21:51:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:51:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:51:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:51:58,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:51:58,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:51:58,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 78 [2025-03-08 21:51:58,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-03-08 21:51:58,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:51:58,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 78 [2025-03-08 21:51:58,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:51:58,755 INFO L124 PetriNetUnfolderBase]: 7/165 cut-off events. [2025-03-08 21:51:58,755 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 21:51:58,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 165 events. 7/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 614 event pairs, 3 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 179. Up to 19 conditions per place. [2025-03-08 21:51:58,758 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 9 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2025-03-08 21:51:58,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 189 flow [2025-03-08 21:51:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:51:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:51:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-08 21:51:58,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-03-08 21:51:58,760 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 154 flow. Second operand 3 states and 210 transitions. [2025-03-08 21:51:58,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 189 flow [2025-03-08 21:51:58,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:51:58,762 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 178 flow [2025-03-08 21:51:58,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2025-03-08 21:51:58,763 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -1 predicate places. [2025-03-08 21:51:58,764 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 178 flow [2025-03-08 21:51:58,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-03-08 21:51:58,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:51:58,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:51:58,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:51:58,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 21:51:58,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:51:58,765 INFO L85 PathProgramCache]: Analyzing trace with hash 395529407, now seen corresponding path program 1 times [2025-03-08 21:51:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:51:58,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402623429] [2025-03-08 21:51:58,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:51:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:51:58,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 21:51:58,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 21:51:58,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:51:58,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:51:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:51:58,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:51:58,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402623429] [2025-03-08 21:51:58,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402623429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:51:58,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:51:58,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:51:58,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285826379] [2025-03-08 21:51:58,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:51:58,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:51:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:51:58,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:51:58,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:51:58,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 78 [2025-03-08 21:51:58,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-03-08 21:51:58,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:51:58,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 78 [2025-03-08 21:51:58,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:51:58,892 INFO L124 PetriNetUnfolderBase]: 6/179 cut-off events. [2025-03-08 21:51:58,893 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2025-03-08 21:51:58,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 179 events. 6/179 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 647 event pairs, 2 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 218. Up to 23 conditions per place. [2025-03-08 21:51:58,894 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 11 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-03-08 21:51:58,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 77 transitions, 218 flow [2025-03-08 21:51:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:51:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:51:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-08 21:51:58,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8931623931623932 [2025-03-08 21:51:58,895 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 178 flow. Second operand 3 states and 209 transitions. [2025-03-08 21:51:58,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 77 transitions, 218 flow [2025-03-08 21:51:58,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:51:58,897 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 202 flow [2025-03-08 21:51:58,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2025-03-08 21:51:58,897 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 1 predicate places. [2025-03-08 21:51:58,897 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 202 flow [2025-03-08 21:51:58,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-03-08 21:51:58,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:51:58,898 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 21:51:58,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:51:58,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 21:51:58,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:51:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1087708161, now seen corresponding path program 1 times [2025-03-08 21:51:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:51:58,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259731389] [2025-03-08 21:51:58,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:51:58,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:51:58,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 21:51:58,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 21:51:58,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:51:58,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:51:58,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:51:58,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 21:51:58,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 21:51:58,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:51:58,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:51:58,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:51:58,940 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:51:58,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-08 21:51:58,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-08 21:51:58,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-08 21:51:58,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-08 21:51:58,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-08 21:51:58,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-03-08 21:51:58,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-08 21:51:58,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-08 21:51:58,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-08 21:51:58,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:51:58,943 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 21:51:58,944 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:51:58,944 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 21:51:58,968 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:51:58,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 113 transitions, 246 flow [2025-03-08 21:51:58,986 INFO L124 PetriNetUnfolderBase]: 2/117 cut-off events. [2025-03-08 21:51:58,986 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:51:58,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 117 events. 2/117 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 223 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 124. Up to 3 conditions per place. [2025-03-08 21:51:58,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 113 transitions, 246 flow [2025-03-08 21:51:58,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 92 transitions, 197 flow [2025-03-08 21:51:58,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:51:58,990 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;@5f43bf32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:51:58,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-08 21:51:58,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:51:58,994 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-08 21:51:58,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:51:58,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:51:58,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:51:58,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-08 21:51:58,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:51:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash 200885030, now seen corresponding path program 1 times [2025-03-08 21:51:58,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:51:58,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67832787] [2025-03-08 21:51:58,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:51:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:51:59,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 21:51:59,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 21:51:59,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:51:59,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:51:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:51:59,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:51:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67832787] [2025-03-08 21:51:59,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67832787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:51:59,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:51:59,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:51:59,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095810735] [2025-03-08 21:51:59,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:51:59,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:51:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:51:59,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:51:59,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:51:59,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2025-03-08 21:51:59,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-03-08 21:51:59,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:51:59,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2025-03-08 21:51:59,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:51:59,133 INFO L124 PetriNetUnfolderBase]: 65/495 cut-off events. [2025-03-08 21:51:59,134 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-08 21:51:59,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 495 events. 65/495 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2993 event pairs, 65 based on Foata normal form. 39/452 useless extension candidates. Maximal degree in co-relation 610. Up to 121 conditions per place. [2025-03-08 21:51:59,138 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 12 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-03-08 21:51:59,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 87 transitions, 215 flow [2025-03-08 21:51:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:51:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:51:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-03-08 21:51:59,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8466076696165191 [2025-03-08 21:51:59,141 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 197 flow. Second operand 3 states and 287 transitions. [2025-03-08 21:51:59,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 87 transitions, 215 flow [2025-03-08 21:51:59,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:51:59,143 INFO L231 Difference]: Finished difference. Result has 96 places, 87 transitions, 190 flow [2025-03-08 21:51:59,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=96, PETRI_TRANSITIONS=87} [2025-03-08 21:51:59,143 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -2 predicate places. [2025-03-08 21:51:59,143 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 87 transitions, 190 flow [2025-03-08 21:51:59,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-03-08 21:51:59,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:51:59,144 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] [2025-03-08 21:51:59,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:51:59,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-08 21:51:59,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:51:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1931914787, now seen corresponding path program 1 times [2025-03-08 21:51:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:51:59,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412873369] [2025-03-08 21:51:59,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:51:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:51:59,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 21:51:59,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 21:51:59,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:51:59,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:51:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:51:59,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:51:59,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412873369] [2025-03-08 21:51:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412873369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:51:59,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:51:59,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:51:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54967480] [2025-03-08 21:51:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:51:59,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:51:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:51:59,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:51:59,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:51:59,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2025-03-08 21:51:59,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 87 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-03-08 21:51:59,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:51:59,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2025-03-08 21:51:59,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:51:59,312 INFO L124 PetriNetUnfolderBase]: 97/647 cut-off events. [2025-03-08 21:51:59,312 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-08 21:51:59,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 647 events. 97/647 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4287 event pairs, 36 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 885. Up to 142 conditions per place. [2025-03-08 21:51:59,318 INFO L140 encePairwiseOnDemand]: 102/113 looper letters, 17 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2025-03-08 21:51:59,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 97 transitions, 268 flow [2025-03-08 21:51:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:51:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:51:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-03-08 21:51:59,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8613569321533924 [2025-03-08 21:51:59,319 INFO L175 Difference]: Start difference. First operand has 96 places, 87 transitions, 190 flow. Second operand 3 states and 292 transitions. [2025-03-08 21:51:59,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 97 transitions, 268 flow [2025-03-08 21:51:59,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:51:59,321 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 256 flow [2025-03-08 21:51:59,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-03-08 21:51:59,322 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2025-03-08 21:51:59,322 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 256 flow [2025-03-08 21:51:59,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-03-08 21:51:59,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:51:59,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:51:59,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:51:59,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-08 21:51:59,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:51:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1102126186, now seen corresponding path program 1 times [2025-03-08 21:51:59,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:51:59,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144672041] [2025-03-08 21:51:59,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:51:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:51:59,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 21:51:59,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 21:51:59,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:51:59,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:51:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:51:59,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:51:59,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144672041] [2025-03-08 21:51:59,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144672041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:51:59,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:51:59,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:51:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496718203] [2025-03-08 21:51:59,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:51:59,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:51:59,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:51:59,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:51:59,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:51:59,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2025-03-08 21:51:59,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-03-08 21:51:59,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:51:59,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2025-03-08 21:51:59,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:51:59,513 INFO L124 PetriNetUnfolderBase]: 198/1013 cut-off events. [2025-03-08 21:51:59,513 INFO L125 PetriNetUnfolderBase]: For 385/393 co-relation queries the response was YES. [2025-03-08 21:51:59,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 1013 events. 198/1013 cut-off events. For 385/393 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7762 event pairs, 62 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1812. Up to 256 conditions per place. [2025-03-08 21:51:59,520 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 17 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2025-03-08 21:51:59,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 104 transitions, 351 flow [2025-03-08 21:51:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:51:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:51:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-03-08 21:51:59,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8731563421828908 [2025-03-08 21:51:59,521 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 256 flow. Second operand 3 states and 296 transitions. [2025-03-08 21:51:59,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 104 transitions, 351 flow [2025-03-08 21:51:59,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 104 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:51:59,524 INFO L231 Difference]: Finished difference. Result has 100 places, 103 transitions, 326 flow [2025-03-08 21:51:59,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=100, PETRI_TRANSITIONS=103} [2025-03-08 21:51:59,526 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 2 predicate places. [2025-03-08 21:51:59,526 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 103 transitions, 326 flow [2025-03-08 21:51:59,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-03-08 21:51:59,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:51:59,526 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] [2025-03-08 21:51:59,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:51:59,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-08 21:51:59,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:51:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash -388718693, now seen corresponding path program 1 times [2025-03-08 21:51:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:51:59,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156159948] [2025-03-08 21:51:59,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:51:59,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:51:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 21:51:59,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 21:51:59,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:51:59,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:51:59,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:51:59,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 21:51:59,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 21:51:59,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:51:59,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:51:59,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:51:59,555 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:51:59,555 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining) [2025-03-08 21:51:59,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-08 21:51:59,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-08 21:51:59,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-08 21:51:59,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-08 21:51:59,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 12 remaining) [2025-03-08 21:51:59,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining) [2025-03-08 21:51:59,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-08 21:51:59,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-08 21:51:59,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-08 21:51:59,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-08 21:51:59,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-08 21:51:59,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:51:59,556 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 21:51:59,597 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-03-08 21:51:59,597 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:51:59,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:51:59 BasicIcfg [2025-03-08 21:51:59,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:51:59,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:51:59,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:51:59,604 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:51:59,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:51:58" (3/4) ... [2025-03-08 21:51:59,605 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:51:59,655 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-03-08 21:51:59,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:51:59,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:51:59,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:51:59,693 INFO L158 Benchmark]: Toolchain (without parser) took 2256.77ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 66.5MB in the end (delta: 37.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2025-03-08 21:51:59,693 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:51:59,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.23ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 85.0MB in the end (delta: 18.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:51:59,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.92ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:51:59,694 INFO L158 Benchmark]: Boogie Preprocessor took 16.97ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 996.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:51:59,694 INFO L158 Benchmark]: IcfgBuilder took 272.22ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 69.6MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:51:59,694 INFO L158 Benchmark]: TraceAbstraction took 1464.30ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 78.7MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:51:59,695 INFO L158 Benchmark]: Witness Printer took 87.31ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 66.5MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:51:59,696 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.17ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.23ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 85.0MB in the end (delta: 18.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.92ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.97ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 996.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 272.22ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 69.6MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1464.30ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 78.7MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 87.31ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 66.5MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 699]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int x; VAL [x=0] [L709] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={49:50}, argc=52, x=0] [L710] 0 int i; VAL [\old(argc)=52, \old(argv)={49:50}, argc=52, x=0] [L711] 0 x = 0 VAL [\old(argc)=52, \old(argv)={49:50}, argc=52, x=0] [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={49:50}, argc=52, t1=-1, x=0] [L713] 0 i = 0 VAL [\old(argc)=52, \old(argv)={49:50}, argc=52, i=0, t1=-1, x=0] [L713] COND TRUE 0 i < 50 VAL [\old(argc)=52, \old(argv)={49:50}, argc=52, i=0, t1=-1, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(arg)={0:0}, \old(argc)=52, \old(argv)={49:50}, argc=52, i=0, t1=-1, t2=0, x=0] [L699] 1 x <= 50 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, x=0] [L703] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, x=0] [L704] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, t=0, x=0] [L705] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, t=0, x=1] [L699] 1 x <= 50 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, t=0, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [705] and C: x <= 50 [699] - UnprovableResult [Line: 704]: 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: 711]: 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 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: 714]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 113 edges, 9 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: 0.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 20 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=3, InterpolantAutomatonStates: 9, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 144 locations, 148 edges, 12 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: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 8 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=3, InterpolantAutomatonStates: 9, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-03-08 21:51:59,710 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)