./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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/goblint-regression/04-mutex_37-indirect_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91e4ed4bfe1f39ec65b13c41c6a7b6461aa954e8b5b654b0aa1c967848462a4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:45:00,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:45:01,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:45:01,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:45:01,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:45:01,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:45:01,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:45:01,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:45:01,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:45:01,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:45:01,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:45:01,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:45:01,052 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:45:01,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:45:01,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:45:01,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:45:01,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:45:01,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:45:01,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:01,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:45:01,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:45:01,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:45:01,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:45:01,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:45:01,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:45:01,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:45:01,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:45:01,055 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 -> 91e4ed4bfe1f39ec65b13c41c6a7b6461aa954e8b5b654b0aa1c967848462a4b [2025-03-04 06:45:01,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:45:01,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:45:01,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:45:01,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:45:01,407 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:45:01,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.i [2025-03-04 06:45:02,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df64e02e/a328a9f23b89469d9933b6d2b6a12982/FLAG2dfcfa732 [2025-03-04 06:45:02,818 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:45:02,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.i [2025-03-04 06:45:02,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df64e02e/a328a9f23b89469d9933b6d2b6a12982/FLAG2dfcfa732 [2025-03-04 06:45:02,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df64e02e/a328a9f23b89469d9933b6d2b6a12982 [2025-03-04 06:45:02,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:45:02,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:45:02,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:02,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:45:02,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:45:02,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:02" (1/1) ... [2025-03-04 06:45:02,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f29031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:02, skipping insertion in model container [2025-03-04 06:45:02,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:02" (1/1) ... [2025-03-04 06:45:02,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:45:03,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:03,099 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:45:03,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:03,153 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:45:03,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03 WrapperNode [2025-03-04 06:45:03,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:03,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:03,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:45:03,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:45:03,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,177 INFO L138 Inliner]: procedures = 162, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2025-03-04 06:45:03,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:03,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:45:03,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:45:03,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:45:03,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,193 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:45:03,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:45:03,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:45:03,199 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:45:03,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (1/1) ... [2025-03-04 06:45:03,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:03,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:03,227 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-04 06:45:03,229 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-04 06:45:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:45:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:45:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:45:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:45:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:45:03,249 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:45:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:45:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:45:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:45:03,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:45:03,250 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:45:03,346 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:45:03,348 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:45:03,509 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:45:03,509 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:45:03,524 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:45:03,525 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:45:03,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:03 BoogieIcfgContainer [2025-03-04 06:45:03,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:45:03,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:45:03,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:45:03,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:45:03,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:45:02" (1/3) ... [2025-03-04 06:45:03,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c382af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:03, skipping insertion in model container [2025-03-04 06:45:03,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:03" (2/3) ... [2025-03-04 06:45:03,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c382af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:03, skipping insertion in model container [2025-03-04 06:45:03,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:03" (3/3) ... [2025-03-04 06:45:03,533 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_37-indirect_rc.i [2025-03-04 06:45:03,543 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:45:03,545 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_37-indirect_rc.i that has 2 procedures, 97 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-03-04 06:45:03,545 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:45:03,593 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:45:03,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 96 transitions, 199 flow [2025-03-04 06:45:03,657 INFO L124 PetriNetUnfolderBase]: 0/95 cut-off events. [2025-03-04 06:45:03,660 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:03,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 95 events. 0/95 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 06:45:03,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 96 transitions, 199 flow [2025-03-04 06:45:03,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 90 transitions, 183 flow [2025-03-04 06:45:03,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:45:03,679 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;@2f06ec43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:45:03,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 06:45:03,684 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:45:03,684 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-04 06:45:03,684 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:03,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:03,685 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] [2025-03-04 06:45:03,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:45:03,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash -880142678, now seen corresponding path program 1 times [2025-03-04 06:45:03,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:03,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518280087] [2025-03-04 06:45:03,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:03,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:03,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 06:45:03,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 06:45:03,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:03,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:03,861 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-04 06:45:03,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:03,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518280087] [2025-03-04 06:45:03,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518280087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:03,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:03,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:45:03,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395386178] [2025-03-04 06:45:03,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:03,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:03,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:03,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:03,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:03,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2025-03-04 06:45:03,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-04 06:45:03,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:03,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2025-03-04 06:45:03,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:03,964 INFO L124 PetriNetUnfolderBase]: 2/119 cut-off events. [2025-03-04 06:45:03,966 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:03,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 119 events. 2/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 186 event pairs, 2 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 90. Up to 13 conditions per place. [2025-03-04 06:45:03,969 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 8 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-03-04 06:45:03,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 89 transitions, 201 flow [2025-03-04 06:45:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2025-03-04 06:45:03,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2025-03-04 06:45:03,979 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 183 flow. Second operand 3 states and 260 transitions. [2025-03-04 06:45:03,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 89 transitions, 201 flow [2025-03-04 06:45:03,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:03,986 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 184 flow [2025-03-04 06:45:03,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-03-04 06:45:03,991 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 0 predicate places. [2025-03-04 06:45:03,992 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 184 flow [2025-03-04 06:45:03,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-04 06:45:03,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:03,993 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] [2025-03-04 06:45:03,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:45:03,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:45:03,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:03,994 INFO L85 PathProgramCache]: Analyzing trace with hash 291446738, now seen corresponding path program 1 times [2025-03-04 06:45:03,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701674618] [2025-03-04 06:45:03,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:04,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 06:45:04,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 06:45:04,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:04,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:04,053 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-04 06:45:04,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701674618] [2025-03-04 06:45:04,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701674618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:04,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:04,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:45:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066673567] [2025-03-04 06:45:04,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:04,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:04,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:04,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:04,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:04,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 96 [2025-03-04 06:45:04,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-04 06:45:04,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:04,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 96 [2025-03-04 06:45:04,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:04,115 INFO L124 PetriNetUnfolderBase]: 4/159 cut-off events. [2025-03-04 06:45:04,115 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:45:04,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 159 events. 4/159 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 319 event pairs, 4 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 152. Up to 15 conditions per place. [2025-03-04 06:45:04,116 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 7 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2025-03-04 06:45:04,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 196 flow [2025-03-04 06:45:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2025-03-04 06:45:04,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9201388888888888 [2025-03-04 06:45:04,118 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 184 flow. Second operand 3 states and 265 transitions. [2025-03-04 06:45:04,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 196 flow [2025-03-04 06:45:04,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 87 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:45:04,120 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 178 flow [2025-03-04 06:45:04,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2025-03-04 06:45:04,121 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2025-03-04 06:45:04,121 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 178 flow [2025-03-04 06:45:04,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-04 06:45:04,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:04,121 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] [2025-03-04 06:45:04,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:45:04,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:45:04,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:04,122 INFO L85 PathProgramCache]: Analyzing trace with hash 177460903, now seen corresponding path program 1 times [2025-03-04 06:45:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423929614] [2025-03-04 06:45:04,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:04,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:04,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:45:04,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:45:04,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:04,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:04,172 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-04 06:45:04,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:04,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423929614] [2025-03-04 06:45:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423929614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:04,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:04,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:45:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774573024] [2025-03-04 06:45:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:04,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:04,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:04,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:04,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2025-03-04 06:45:04,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-04 06:45:04,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:04,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2025-03-04 06:45:04,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:04,214 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2025-03-04 06:45:04,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:04,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 86 events. 0/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-03-04 06:45:04,215 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 7 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-03-04 06:45:04,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 86 transitions, 194 flow [2025-03-04 06:45:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-04 06:45:04,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9097222222222222 [2025-03-04 06:45:04,225 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 178 flow. Second operand 3 states and 262 transitions. [2025-03-04 06:45:04,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 86 transitions, 194 flow [2025-03-04 06:45:04,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 86 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:04,228 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 179 flow [2025-03-04 06:45:04,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2025-03-04 06:45:04,230 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2025-03-04 06:45:04,231 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 179 flow [2025-03-04 06:45:04,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-04 06:45:04,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:04,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:04,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:45:04,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:45:04,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:04,232 INFO L85 PathProgramCache]: Analyzing trace with hash 248432377, now seen corresponding path program 1 times [2025-03-04 06:45:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906106225] [2025-03-04 06:45:04,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:04,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:45:04,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:45:04,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:04,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:04,300 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-04 06:45:04,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:04,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906106225] [2025-03-04 06:45:04,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906106225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:04,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:04,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:45:04,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792669828] [2025-03-04 06:45:04,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:04,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:04,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:04,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:04,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:04,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 96 [2025-03-04 06:45:04,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-04 06:45:04,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:04,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 96 [2025-03-04 06:45:04,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:04,332 INFO L124 PetriNetUnfolderBase]: 0/85 cut-off events. [2025-03-04 06:45:04,332 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:04,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 85 events. 0/85 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-03-04 06:45:04,333 INFO L140 encePairwiseOnDemand]: 94/96 looper letters, 5 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2025-03-04 06:45:04,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 85 transitions, 189 flow [2025-03-04 06:45:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2025-03-04 06:45:04,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9409722222222222 [2025-03-04 06:45:04,335 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 179 flow. Second operand 3 states and 271 transitions. [2025-03-04 06:45:04,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 85 transitions, 189 flow [2025-03-04 06:45:04,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 85 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:45:04,336 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 175 flow [2025-03-04 06:45:04,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2025-03-04 06:45:04,337 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -3 predicate places. [2025-03-04 06:45:04,337 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 175 flow [2025-03-04 06:45:04,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-04 06:45:04,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:04,337 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-03-04 06:45:04,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:45:04,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:45:04,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash -855410749, now seen corresponding path program 1 times [2025-03-04 06:45:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:04,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825461966] [2025-03-04 06:45:04,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:04,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:45:04,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:45:04,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:04,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:04,713 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-04 06:45:04,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:04,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825461966] [2025-03-04 06:45:04,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825461966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:04,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:04,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:04,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728748985] [2025-03-04 06:45:04,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:04,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:04,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:04,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:04,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2025-03-04 06:45:04,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-04 06:45:04,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:04,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2025-03-04 06:45:04,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:04,980 INFO L124 PetriNetUnfolderBase]: 84/384 cut-off events. [2025-03-04 06:45:04,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:04,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 384 events. 84/384 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1708 event pairs, 34 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 556. Up to 144 conditions per place. [2025-03-04 06:45:04,983 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 27 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2025-03-04 06:45:04,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 114 transitions, 331 flow [2025-03-04 06:45:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 500 transitions. [2025-03-04 06:45:04,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2025-03-04 06:45:04,986 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 175 flow. Second operand 6 states and 500 transitions. [2025-03-04 06:45:04,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 114 transitions, 331 flow [2025-03-04 06:45:04,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 114 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:04,989 INFO L231 Difference]: Finished difference. Result has 100 places, 106 transitions, 324 flow [2025-03-04 06:45:04,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=100, PETRI_TRANSITIONS=106} [2025-03-04 06:45:04,989 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 6 predicate places. [2025-03-04 06:45:04,989 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 324 flow [2025-03-04 06:45:04,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-04 06:45:04,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:04,990 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] [2025-03-04 06:45:04,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:45:04,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:45:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash -155890212, now seen corresponding path program 1 times [2025-03-04 06:45:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648094425] [2025-03-04 06:45:04,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:04,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:05,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 06:45:05,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 06:45:05,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:05,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:05,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-03-04 06:45:05,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:05,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648094425] [2025-03-04 06:45:05,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648094425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:05,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:05,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:05,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623291400] [2025-03-04 06:45:05,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:05,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:05,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:05,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:05,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:05,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2025-03-04 06:45:05,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 106 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 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-04 06:45:05,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:05,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2025-03-04 06:45:05,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:05,524 INFO L124 PetriNetUnfolderBase]: 97/424 cut-off events. [2025-03-04 06:45:05,524 INFO L125 PetriNetUnfolderBase]: For 117/122 co-relation queries the response was YES. [2025-03-04 06:45:05,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 424 events. 97/424 cut-off events. For 117/122 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2095 event pairs, 25 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 783. Up to 180 conditions per place. [2025-03-04 06:45:05,529 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 32 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2025-03-04 06:45:05,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 127 transitions, 500 flow [2025-03-04 06:45:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 492 transitions. [2025-03-04 06:45:05,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-03-04 06:45:05,532 INFO L175 Difference]: Start difference. First operand has 100 places, 106 transitions, 324 flow. Second operand 6 states and 492 transitions. [2025-03-04 06:45:05,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 127 transitions, 500 flow [2025-03-04 06:45:05,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 127 transitions, 500 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:05,536 INFO L231 Difference]: Finished difference. Result has 110 places, 127 transitions, 508 flow [2025-03-04 06:45:05,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=110, PETRI_TRANSITIONS=127} [2025-03-04 06:45:05,538 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 16 predicate places. [2025-03-04 06:45:05,539 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 127 transitions, 508 flow [2025-03-04 06:45:05,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 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-04 06:45:05,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:05,539 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] [2025-03-04 06:45:05,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:45:05,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:45:05,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:05,540 INFO L85 PathProgramCache]: Analyzing trace with hash 725033606, now seen corresponding path program 1 times [2025-03-04 06:45:05,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:05,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967260280] [2025-03-04 06:45:05,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:05,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:45:05,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:45:05,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:05,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:05,832 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-04 06:45:05,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:05,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967260280] [2025-03-04 06:45:05,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967260280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:05,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:05,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261062845] [2025-03-04 06:45:05,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:05,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:05,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:05,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:05,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 96 [2025-03-04 06:45:05,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 127 transitions, 508 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-04 06:45:05,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:05,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 96 [2025-03-04 06:45:05,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:06,068 INFO L124 PetriNetUnfolderBase]: 232/780 cut-off events. [2025-03-04 06:45:06,068 INFO L125 PetriNetUnfolderBase]: For 479/497 co-relation queries the response was YES. [2025-03-04 06:45:06,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 780 events. 232/780 cut-off events. For 479/497 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4505 event pairs, 51 based on Foata normal form. 7/748 useless extension candidates. Maximal degree in co-relation 1895. Up to 406 conditions per place. [2025-03-04 06:45:06,072 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 66 selfloop transitions, 53 changer transitions 4/182 dead transitions. [2025-03-04 06:45:06,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 182 transitions, 998 flow [2025-03-04 06:45:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 475 transitions. [2025-03-04 06:45:06,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8246527777777778 [2025-03-04 06:45:06,073 INFO L175 Difference]: Start difference. First operand has 110 places, 127 transitions, 508 flow. Second operand 6 states and 475 transitions. [2025-03-04 06:45:06,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 182 transitions, 998 flow [2025-03-04 06:45:06,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 182 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:06,077 INFO L231 Difference]: Finished difference. Result has 120 places, 174 transitions, 990 flow [2025-03-04 06:45:06,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=990, PETRI_PLACES=120, PETRI_TRANSITIONS=174} [2025-03-04 06:45:06,078 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 26 predicate places. [2025-03-04 06:45:06,078 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 174 transitions, 990 flow [2025-03-04 06:45:06,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-04 06:45:06,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:06,078 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] [2025-03-04 06:45:06,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:45:06,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:45:06,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:06,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1628701920, now seen corresponding path program 1 times [2025-03-04 06:45:06,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:06,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828405759] [2025-03-04 06:45:06,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:06,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:06,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:45:06,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:45:06,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:06,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:06,252 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-04 06:45:06,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:06,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828405759] [2025-03-04 06:45:06,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828405759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:06,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:06,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:06,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634922199] [2025-03-04 06:45:06,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:06,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:06,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:06,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:06,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:06,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2025-03-04 06:45:06,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 174 transitions, 990 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-04 06:45:06,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:06,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2025-03-04 06:45:06,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:06,524 INFO L124 PetriNetUnfolderBase]: 315/1003 cut-off events. [2025-03-04 06:45:06,524 INFO L125 PetriNetUnfolderBase]: For 1387/1426 co-relation queries the response was YES. [2025-03-04 06:45:06,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3059 conditions, 1003 events. 315/1003 cut-off events. For 1387/1426 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6163 event pairs, 57 based on Foata normal form. 3/974 useless extension candidates. Maximal degree in co-relation 3017. Up to 531 conditions per place. [2025-03-04 06:45:06,532 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 98 selfloop transitions, 61 changer transitions 6/227 dead transitions. [2025-03-04 06:45:06,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 227 transitions, 1650 flow [2025-03-04 06:45:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 478 transitions. [2025-03-04 06:45:06,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8298611111111112 [2025-03-04 06:45:06,534 INFO L175 Difference]: Start difference. First operand has 120 places, 174 transitions, 990 flow. Second operand 6 states and 478 transitions. [2025-03-04 06:45:06,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 227 transitions, 1650 flow [2025-03-04 06:45:06,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 227 transitions, 1586 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:06,545 INFO L231 Difference]: Finished difference. Result has 130 places, 221 transitions, 1512 flow [2025-03-04 06:45:06,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=130, PETRI_TRANSITIONS=221} [2025-03-04 06:45:06,546 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 36 predicate places. [2025-03-04 06:45:06,546 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 221 transitions, 1512 flow [2025-03-04 06:45:06,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-04 06:45:06,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:06,547 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] [2025-03-04 06:45:06,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:45:06,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:45:06,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:06,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1328932931, now seen corresponding path program 1 times [2025-03-04 06:45:06,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:06,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622163973] [2025-03-04 06:45:06,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:06,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:06,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:45:06,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:45:06,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:06,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:45:06,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:45:06,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:45:06,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:45:06,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:06,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:45:06,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:45:06,607 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:45:06,608 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-03-04 06:45:06,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-04 06:45:06,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-04 06:45:06,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-04 06:45:06,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-04 06:45:06,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-04 06:45:06,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-04 06:45:06,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2025-03-04 06:45:06,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-04 06:45:06,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-04 06:45:06,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-04 06:45:06,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-04 06:45:06,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-04 06:45:06,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:45:06,613 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:06,661 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:45:06,662 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:45:06,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:45:06 BasicIcfg [2025-03-04 06:45:06,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:45:06,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:45:06,669 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:45:06,669 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:45:06,669 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:03" (3/4) ... [2025-03-04 06:45:06,670 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 06:45:06,714 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-03-04 06:45:06,742 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:45:06,742 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:45:06,742 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:45:06,742 INFO L158 Benchmark]: Toolchain (without parser) took 3884.34ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 113.1MB in the beginning and 178.4MB in the end (delta: -65.3MB). Peak memory consumption was 191.3MB. Max. memory is 16.1GB. [2025-03-04 06:45:06,742 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:06,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.05ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 93.8MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:45:06,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.88ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:06,743 INFO L158 Benchmark]: Boogie Preprocessor took 20.69ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.9MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:06,743 INFO L158 Benchmark]: IcfgBuilder took 326.98ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 75.1MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:06,743 INFO L158 Benchmark]: TraceAbstraction took 3139.92ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 74.6MB in the beginning and 186.7MB in the end (delta: -112.1MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. [2025-03-04 06:45:06,743 INFO L158 Benchmark]: Witness Printer took 73.42ms. Allocated memory is still 402.7MB. Free memory was 186.7MB in the beginning and 178.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:06,746 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.32ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.05ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 93.8MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.88ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.69ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.9MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 326.98ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 75.1MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3139.92ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 74.6MB in the beginning and 186.7MB in the end (delta: -112.1MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. * Witness Printer took 73.42ms. Allocated memory is still 402.7MB. Free memory was 186.7MB in the beginning and 178.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L679] 0 int g; VAL [g={1:0}] [L680] 0 int *g1; VAL [g1={0:0}, g={1:0}] [L681] 0 int *g2; VAL [g1={0:0}, g2={0:0}, g={1:0}] [L682] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L690] 0 pthread_t id; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L691] 0 int x; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L692] EXPR 0 g2 = &g VAL [g1={0:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L692] 0 g1 = g2 = &g VAL [g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L693] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L694] EXPR 0 *g2 VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L694] EXPR 0 \read(*g2) VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] EXPR 1 *g1 VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L685] EXPR 1 \read(*g1) VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2: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: g1 = g2 = &g [692] * C: (*g2)++ [694] * C: g2 = &g [692] and C: (*g1)++ [685] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: 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: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 128 locations, 13 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: 3.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 776 IncrementalHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 34 mSDtfsCounter, 776 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1512occurred in iteration=8, InterpolantAutomatonStates: 36, 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, 1.3s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-04 06:45:06,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)