./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/singleton_with-uninit-problems-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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/singleton_with-uninit-problems-b.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 ee95c6207d65de8bda179fc4eddfd8312f741d4c9ea2d4ac3b4363fbcaae8d19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:09:04,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:09:04,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:09:04,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:09:04,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:09:04,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:09:04,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:09:04,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:09:04,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:09:04,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:09:04,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:09:04,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:09:04,776 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:09:04,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:09:04,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:09:04,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:09:04,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:09:04,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:09:04,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:09:04,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:09:04,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:04,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:09:04,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:09:04,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:09:04,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:09:04,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:09:04,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:09:04,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:09:04,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:09:04,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:09:04,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:09:04,779 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 -> ee95c6207d65de8bda179fc4eddfd8312f741d4c9ea2d4ac3b4363fbcaae8d19 [2025-02-08 05:09:05,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:09:05,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:09:05,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:09:05,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:09:05,016 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:09:05,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton_with-uninit-problems-b.i [2025-02-08 05:09:06,241 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de2e1b3b1/362e551159f84d5a8874df5256e10c1e/FLAG38133fa91 [2025-02-08 05:09:06,597 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:09:06,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/singleton_with-uninit-problems-b.i [2025-02-08 05:09:06,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de2e1b3b1/362e551159f84d5a8874df5256e10c1e/FLAG38133fa91 [2025-02-08 05:09:06,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de2e1b3b1/362e551159f84d5a8874df5256e10c1e [2025-02-08 05:09:06,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:09:06,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:09:06,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:06,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:09:06,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:09:06,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:06" (1/1) ... [2025-02-08 05:09:06,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11bf89e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:06, skipping insertion in model container [2025-02-08 05:09:06,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:06" (1/1) ... [2025-02-08 05:09:06,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:09:07,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:07,238 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:09:07,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:07,356 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:09:07,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07 WrapperNode [2025-02-08 05:09:07,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:07,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:07,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:09:07,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:09:07,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,398 INFO L138 Inliner]: procedures = 322, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-02-08 05:09:07,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:07,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:09:07,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:09:07,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:09:07,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:09:07,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:09:07,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:09:07,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:09:07,420 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (1/1) ... [2025-02-08 05:09:07,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:07,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:09:07,452 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-02-08 05:09:07,456 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-02-08 05:09:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:09:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2025-02-08 05:09:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2025-02-08 05:09:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:09:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:09:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:09:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:09:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:09:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:09:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:09:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:09:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:09:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:09:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:09:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:09:07,472 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:09:07,556 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:09:07,562 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:09:07,783 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:09:07,783 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:09:07,797 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:09:07,797 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:09:07,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:07 BoogieIcfgContainer [2025-02-08 05:09:07,797 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:09:07,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:09:07,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:09:07,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:09:07,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:09:06" (1/3) ... [2025-02-08 05:09:07,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22144501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:07, skipping insertion in model container [2025-02-08 05:09:07,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:07" (2/3) ... [2025-02-08 05:09:07,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22144501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:07, skipping insertion in model container [2025-02-08 05:09:07,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:07" (3/3) ... [2025-02-08 05:09:07,806 INFO L128 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems-b.i [2025-02-08 05:09:07,818 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:09:07,819 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG singleton_with-uninit-problems-b.i that has 5 procedures, 135 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-02-08 05:09:07,819 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:09:07,910 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-02-08 05:09:07,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 206 transitions, 509 flow [2025-02-08 05:09:08,018 INFO L124 PetriNetUnfolderBase]: 8/162 cut-off events. [2025-02-08 05:09:08,025 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:09:08,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 162 events. 8/162 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 194 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2025-02-08 05:09:08,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 206 transitions, 509 flow [2025-02-08 05:09:08,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 139 transitions, 329 flow [2025-02-08 05:09:08,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:08,068 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;@3b08c728, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:08,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-08 05:09:08,082 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:08,083 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-08 05:09:08,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:09:08,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:08,083 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] [2025-02-08 05:09:08,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-02-08 05:09:08,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1907201666, now seen corresponding path program 1 times [2025-02-08 05:09:08,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:08,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674793288] [2025-02-08 05:09:08,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:08,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:09:08,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:09:08,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:08,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:08,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:08,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674793288] [2025-02-08 05:09:08,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674793288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:08,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:08,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:08,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858200884] [2025-02-08 05:09:08,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:08,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:08,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:08,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:08,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 208 [2025-02-08 05:09:08,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 139 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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-02-08 05:09:08,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:08,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 208 [2025-02-08 05:09:08,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:08,496 INFO L124 PetriNetUnfolderBase]: 67/533 cut-off events. [2025-02-08 05:09:08,496 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-08 05:09:08,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 533 events. 67/533 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2607 event pairs, 51 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 685. Up to 121 conditions per place. [2025-02-08 05:09:08,503 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 25 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2025-02-08 05:09:08,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 138 transitions, 381 flow [2025-02-08 05:09:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2025-02-08 05:09:08,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8285256410256411 [2025-02-08 05:09:08,515 INFO L175 Difference]: Start difference. First operand has 153 places, 139 transitions, 329 flow. Second operand 3 states and 517 transitions. [2025-02-08 05:09:08,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 138 transitions, 381 flow [2025-02-08 05:09:08,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 138 transitions, 347 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-08 05:09:08,523 INFO L231 Difference]: Finished difference. Result has 142 places, 138 transitions, 297 flow [2025-02-08 05:09:08,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=142, PETRI_TRANSITIONS=138} [2025-02-08 05:09:08,527 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -11 predicate places. [2025-02-08 05:09:08,527 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 138 transitions, 297 flow [2025-02-08 05:09:08,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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-02-08 05:09:08,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:08,528 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] [2025-02-08 05:09:08,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:09:08,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-02-08 05:09:08,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1371688186, now seen corresponding path program 1 times [2025-02-08 05:09:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:08,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164990074] [2025-02-08 05:09:08,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:08,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:09:08,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:09:08,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:08,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164990074] [2025-02-08 05:09:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164990074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:08,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:08,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850237839] [2025-02-08 05:09:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:08,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:08,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:08,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:08,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:08,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 208 [2025-02-08 05:09:08,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 138 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-02-08 05:09:08,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:08,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 208 [2025-02-08 05:09:08,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:08,791 INFO L124 PetriNetUnfolderBase]: 313/1160 cut-off events. [2025-02-08 05:09:08,791 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-02-08 05:09:08,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1689 conditions, 1160 events. 313/1160 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7599 event pairs, 188 based on Foata normal form. 0/992 useless extension candidates. Maximal degree in co-relation 1649. Up to 473 conditions per place. [2025-02-08 05:09:08,800 INFO L140 encePairwiseOnDemand]: 198/208 looper letters, 33 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2025-02-08 05:09:08,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 139 transitions, 376 flow [2025-02-08 05:09:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2025-02-08 05:09:08,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8141025641025641 [2025-02-08 05:09:08,803 INFO L175 Difference]: Start difference. First operand has 142 places, 138 transitions, 297 flow. Second operand 3 states and 508 transitions. [2025-02-08 05:09:08,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 139 transitions, 376 flow [2025-02-08 05:09:08,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 139 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:08,807 INFO L231 Difference]: Finished difference. Result has 137 places, 136 transitions, 309 flow [2025-02-08 05:09:08,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=137, PETRI_TRANSITIONS=136} [2025-02-08 05:09:08,808 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -16 predicate places. [2025-02-08 05:09:08,808 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 136 transitions, 309 flow [2025-02-08 05:09:08,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-02-08 05:09:08,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:08,808 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] [2025-02-08 05:09:08,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:09:08,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-02-08 05:09:08,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash -17007736, now seen corresponding path program 1 times [2025-02-08 05:09:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:08,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991560882] [2025-02-08 05:09:08,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:08,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:09:08,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:09:08,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:08,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:08,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991560882] [2025-02-08 05:09:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991560882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:08,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:08,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442751199] [2025-02-08 05:09:08,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:08,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:08,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:08,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:08,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 208 [2025-02-08 05:09:08,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 136 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-02-08 05:09:08,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:08,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 208 [2025-02-08 05:09:08,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:09,130 INFO L124 PetriNetUnfolderBase]: 333/1225 cut-off events. [2025-02-08 05:09:09,131 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 05:09:09,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 1225 events. 333/1225 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9068 event pairs, 194 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1834. Up to 439 conditions per place. [2025-02-08 05:09:09,140 INFO L140 encePairwiseOnDemand]: 201/208 looper letters, 31 selfloop transitions, 6 changer transitions 0/144 dead transitions. [2025-02-08 05:09:09,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 144 transitions, 402 flow [2025-02-08 05:09:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2025-02-08 05:09:09,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8397435897435898 [2025-02-08 05:09:09,142 INFO L175 Difference]: Start difference. First operand has 137 places, 136 transitions, 309 flow. Second operand 3 states and 524 transitions. [2025-02-08 05:09:09,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 144 transitions, 402 flow [2025-02-08 05:09:09,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 144 transitions, 402 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:09,144 INFO L231 Difference]: Finished difference. Result has 141 places, 141 transitions, 355 flow [2025-02-08 05:09:09,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=355, PETRI_PLACES=141, PETRI_TRANSITIONS=141} [2025-02-08 05:09:09,145 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -12 predicate places. [2025-02-08 05:09:09,145 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 141 transitions, 355 flow [2025-02-08 05:09:09,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-02-08 05:09:09,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:09,146 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] [2025-02-08 05:09:09,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:09:09,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-02-08 05:09:09,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:09,147 INFO L85 PathProgramCache]: Analyzing trace with hash -800193776, now seen corresponding path program 1 times [2025-02-08 05:09:09,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:09,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350295167] [2025-02-08 05:09:09,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:09,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:09:09,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:09:09,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:09,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:09,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:09,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350295167] [2025-02-08 05:09:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350295167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:09,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891172957] [2025-02-08 05:09:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:09,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:09,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:09,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:09,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:09,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 208 [2025-02-08 05:09:09,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 141 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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-02-08 05:09:09,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:09,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 208 [2025-02-08 05:09:09,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:09,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([338] L1116-2-->L1116: Formula: (= |v_#race_3| (store |v_#race_4| v_~v~0.base_4 (store (select |v_#race_4| v_~v~0.base_4) v_~v~0.offset_4 |v_thread2Thread1of1ForFork5_#t~nondet5_3|))) InVars {#race=|v_#race_4|, thread2Thread1of1ForFork5_#t~nondet5=|v_thread2Thread1of1ForFork5_#t~nondet5_3|, ~v~0.offset=v_~v~0.offset_4, ~v~0.base=v_~v~0.base_4} OutVars{#race=|v_#race_3|, thread2Thread1of1ForFork5_#t~nondet5=|v_thread2Thread1of1ForFork5_#t~nondet5_3|, ~v~0.offset=v_~v~0.offset_4, ~v~0.base=v_~v~0.base_4} AuxVars[] AssignedVars[#race][123], [130#L1116true, 4#L1116-1true, 9#L1121-1true, Black: 226#(= |thread2Thread1of1ForFork4_#t~nondet5| (select (select |#race| ~v~0.base) ~v~0.offset)), 224#true, 229#true, 104#L1142-1true, 96#L1116true, 222#(= |#race~v~0| 0), 81#L1132-1true, Black: 220#true]) [2025-02-08 05:09:09,495 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-02-08 05:09:09,496 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-02-08 05:09:09,496 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-02-08 05:09:09,496 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-02-08 05:09:09,520 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([338] L1116-2-->L1116: Formula: (= |v_#race_3| (store |v_#race_4| v_~v~0.base_4 (store (select |v_#race_4| v_~v~0.base_4) v_~v~0.offset_4 |v_thread2Thread1of1ForFork5_#t~nondet5_3|))) InVars {#race=|v_#race_4|, thread2Thread1of1ForFork5_#t~nondet5=|v_thread2Thread1of1ForFork5_#t~nondet5_3|, ~v~0.offset=v_~v~0.offset_4, ~v~0.base=v_~v~0.base_4} OutVars{#race=|v_#race_3|, thread2Thread1of1ForFork5_#t~nondet5=|v_thread2Thread1of1ForFork5_#t~nondet5_3|, ~v~0.offset=v_~v~0.offset_4, ~v~0.base=v_~v~0.base_4} AuxVars[] AssignedVars[#race][105], [130#L1116true, 4#L1116-1true, Black: 226#(= |thread2Thread1of1ForFork4_#t~nondet5| (select (select |#race| ~v~0.base) ~v~0.offset)), 90#L1122true, 224#true, 104#L1142-1true, 229#true, 96#L1116true, 222#(= |#race~v~0| 0), 81#L1132-1true, Black: 220#true]) [2025-02-08 05:09:09,520 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-02-08 05:09:09,520 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-02-08 05:09:09,520 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-02-08 05:09:09,520 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-02-08 05:09:09,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([338] L1116-2-->L1116: Formula: (= |v_#race_3| (store |v_#race_4| v_~v~0.base_4 (store (select |v_#race_4| v_~v~0.base_4) v_~v~0.offset_4 |v_thread2Thread1of1ForFork5_#t~nondet5_3|))) InVars {#race=|v_#race_4|, thread2Thread1of1ForFork5_#t~nondet5=|v_thread2Thread1of1ForFork5_#t~nondet5_3|, ~v~0.offset=v_~v~0.offset_4, ~v~0.base=v_~v~0.base_4} OutVars{#race=|v_#race_3|, thread2Thread1of1ForFork5_#t~nondet5=|v_thread2Thread1of1ForFork5_#t~nondet5_3|, ~v~0.offset=v_~v~0.offset_4, ~v~0.base=v_~v~0.base_4} AuxVars[] AssignedVars[#race][92], [130#L1116true, 189#thread2Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 226#(= |thread2Thread1of1ForFork4_#t~nondet5| (select (select |#race| ~v~0.base) ~v~0.offset)), 90#L1122true, 224#true, 104#L1142-1true, 229#true, 96#L1116true, 222#(= |#race~v~0| 0), 81#L1132-1true, Black: 220#true]) [2025-02-08 05:09:09,538 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is not cut-off event [2025-02-08 05:09:09,539 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2025-02-08 05:09:09,539 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2025-02-08 05:09:09,539 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2025-02-08 05:09:09,556 INFO L124 PetriNetUnfolderBase]: 952/2702 cut-off events. [2025-02-08 05:09:09,556 INFO L125 PetriNetUnfolderBase]: For 850/1001 co-relation queries the response was YES. [2025-02-08 05:09:09,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5488 conditions, 2702 events. 952/2702 cut-off events. For 850/1001 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 22923 event pairs, 362 based on Foata normal form. 2/2300 useless extension candidates. Maximal degree in co-relation 5447. Up to 1046 conditions per place. [2025-02-08 05:09:09,573 INFO L140 encePairwiseOnDemand]: 201/208 looper letters, 34 selfloop transitions, 9 changer transitions 0/152 dead transitions. [2025-02-08 05:09:09,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 483 flow [2025-02-08 05:09:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2025-02-08 05:09:09,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8413461538461539 [2025-02-08 05:09:09,579 INFO L175 Difference]: Start difference. First operand has 141 places, 141 transitions, 355 flow. Second operand 3 states and 525 transitions. [2025-02-08 05:09:09,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 483 flow [2025-02-08 05:09:09,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:09,590 INFO L231 Difference]: Finished difference. Result has 143 places, 148 transitions, 419 flow [2025-02-08 05:09:09,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=143, PETRI_TRANSITIONS=148} [2025-02-08 05:09:09,590 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -10 predicate places. [2025-02-08 05:09:09,590 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 148 transitions, 419 flow [2025-02-08 05:09:09,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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-02-08 05:09:09,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:09,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:09,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:09:09,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-02-08 05:09:09,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1201253894, now seen corresponding path program 1 times [2025-02-08 05:09:09,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:09,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043905526] [2025-02-08 05:09:09,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:09,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:09,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:09:09,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:09:09,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:09,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:09:09,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:09:09,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:09:09,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:09:09,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:09,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:09:09,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:09:09,672 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:09:09,672 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2025-02-08 05:09:09,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 29 remaining) [2025-02-08 05:09:09,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 29 remaining) [2025-02-08 05:09:09,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork2Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork2Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork2Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork2Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork2Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-02-08 05:09:09,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-02-08 05:09:09,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:09:09,680 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 05:09:09,748 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:09:09,749 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:09:09,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:09:09 BasicIcfg [2025-02-08 05:09:09,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:09:09,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:09:09,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:09:09,757 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:09:09,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:07" (3/4) ... [2025-02-08 05:09:09,762 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:09:09,813 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-02-08 05:09:09,863 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:09:09,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:09:09,867 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:09:09,867 INFO L158 Benchmark]: Toolchain (without parser) took 3029.78ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 111.8MB in the beginning and 127.7MB in the end (delta: -15.9MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2025-02-08 05:09:09,867 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:09,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.98ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 79.7MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:09:09,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.84ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 77.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:09,868 INFO L158 Benchmark]: Boogie Preprocessor took 19.67ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 76.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:09,868 INFO L158 Benchmark]: IcfgBuilder took 378.40ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 60.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:09:09,868 INFO L158 Benchmark]: TraceAbstraction took 1957.10ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 59.9MB in the beginning and 142.6MB in the end (delta: -82.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:09,869 INFO L158 Benchmark]: Witness Printer took 109.69ms. Allocated memory is still 192.9MB. Free memory was 142.6MB in the beginning and 127.7MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:09:09,872 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.98ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 79.7MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.84ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 77.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.67ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 76.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 378.40ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 60.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1957.10ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 59.9MB in the beginning and 142.6MB in the end (delta: -82.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 109.69ms. Allocated memory is still 192.9MB. Free memory was 142.6MB in the beginning and 127.7MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1116]: Data race detected Data race detected The following path leads to a data race: [L1108] 0 char *v; VAL [v={0:0}] [L1141] 0 pthread_t t; VAL [v={0:0}] [L1142] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [\old(arg)={0:0}, t=-3, v={0:0}] [L1126] 1 pthread_t t1, t2, t3, t4, t5; VAL [\old(arg)={0:0}, arg={0:0}, v={0:0}] [L1127] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, t1=-2, v={0:0}] [L1111] 2 v = malloc(sizeof(char)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, t1=-2, v={-1:0}] [L1112] 2 return 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, v={-1:0}] [L1128] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, v={-1:0}] [L1129] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, v={-1:0}] [L1130] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1116] EXPR 3 v[0] VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1121] EXPR 4 v[0] VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1121] 4 v[0] = 'Y' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1116] EXPR 3 v[0] VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1116] 3 v[0] = 'X' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1121] 4 v[0] = 'Y' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1116] 3 v[0] = 'X' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: v = malloc(sizeof(char)) [1111] * C: v[0] [1116] * C: v[0] = 'Y' [1121] * C: v[0] [1121] and C: v[0] = 'X' [1116] - UnprovableResult [Line: 1132]: 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: 1127]: 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: 1130]: 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: 1131]: 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: 1129]: 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: 1111]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1116]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1121]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1121]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1144]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1144]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1144]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1144]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1142]: 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: 1130]: 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: 1127]: 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: 1131]: 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: 1129]: 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: 1132]: 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 11 procedures, 254 locations, 29 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: 1.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 56 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=419occurred in iteration=4, InterpolantAutomatonStates: 12, 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.4s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-02-08 05:09:09,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)