./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ce97f399f5ab540e05119d9433f4e1bfecfe892f8e87faddc6435387a55a4d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:25:29,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:25:29,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:25:29,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:25:29,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:25:29,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:25:29,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:25:29,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:25:29,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:25:29,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:25:29,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:25:29,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:25:29,651 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:25:29,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:25:29,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:25:29,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:25:29,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:25:29,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:25:29,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:25:29,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:25:29,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:25:29,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:25:29,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:25:29,654 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:25:29,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:25:29,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:25:29,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:25:29,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:25:29,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:25:29,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:25:29,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:25:29,654 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ce97f399f5ab540e05119d9433f4e1bfecfe892f8e87faddc6435387a55a4d6 [2025-02-06 09:25:29,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:25:29,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:25:29,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:25:29,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:25:29,902 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:25:29,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i [2025-02-06 09:25:31,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f58bc4ba/c30285d34ce04c71912bc29f643ffc1c/FLAG54cdc599e [2025-02-06 09:25:31,291 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:25:31,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i [2025-02-06 09:25:31,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f58bc4ba/c30285d34ce04c71912bc29f643ffc1c/FLAG54cdc599e [2025-02-06 09:25:31,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f58bc4ba/c30285d34ce04c71912bc29f643ffc1c [2025-02-06 09:25:31,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:25:31,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:25:31,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:25:31,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:25:31,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:25:31,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69348bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31, skipping insertion in model container [2025-02-06 09:25:31,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:25:31,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:25:31,539 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:25:31,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:25:31,616 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:25:31,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31 WrapperNode [2025-02-06 09:25:31,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:25:31,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:25:31,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:25:31,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:25:31,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,654 INFO L138 Inliner]: procedures = 170, calls = 38, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2025-02-06 09:25:31,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:25:31,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:25:31,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:25:31,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:25:31,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:25:31,690 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:25:31,690 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:25:31,690 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:25:31,691 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (1/1) ... [2025-02-06 09:25:31,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:25:31,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:25:31,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:25:31,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:25:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:25:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:25:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:25:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:25:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:25:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:25:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:25:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:25:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:25:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:25:31,745 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:25:31,847 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:25:31,848 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:25:32,085 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:25:32,085 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:25:32,118 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:25:32,120 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:25:32,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:25:32 BoogieIcfgContainer [2025-02-06 09:25:32,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:25:32,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:25:32,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:25:32,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:25:32,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:25:31" (1/3) ... [2025-02-06 09:25:32,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a19fe6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:25:32, skipping insertion in model container [2025-02-06 09:25:32,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:31" (2/3) ... [2025-02-06 09:25:32,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a19fe6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:25:32, skipping insertion in model container [2025-02-06 09:25:32,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:25:32" (3/3) ... [2025-02-06 09:25:32,128 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_22-deref_read_racefree.i [2025-02-06 09:25:32,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:25:32,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_22-deref_read_racefree.i that has 2 procedures, 150 locations, 1 initial locations, 5 loop locations, and 10 error locations. [2025-02-06 09:25:32,141 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:25:32,202 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:25:32,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 160 transitions, 324 flow [2025-02-06 09:25:32,282 INFO L124 PetriNetUnfolderBase]: 14/215 cut-off events. [2025-02-06 09:25:32,284 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:32,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 215 events. 14/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 638 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 129. Up to 4 conditions per place. [2025-02-06 09:25:32,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 160 transitions, 324 flow [2025-02-06 09:25:32,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 160 transitions, 324 flow [2025-02-06 09:25:32,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:32,311 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;@524150f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:32,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 09:25:32,322 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:32,324 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-02-06 09:25:32,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:32,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:32,325 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] [2025-02-06 09:25:32,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 09:25:32,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 887094261, now seen corresponding path program 1 times [2025-02-06 09:25:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:32,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231717751] [2025-02-06 09:25:32,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:32,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:32,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:25:32,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:25:32,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:32,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:32,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231717751] [2025-02-06 09:25:32,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231717751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:32,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:32,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045732352] [2025-02-06 09:25:32,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:32,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:32,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:32,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:32,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:32,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 160 [2025-02-06 09:25:32,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 160 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:32,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:32,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 160 [2025-02-06 09:25:32,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:32,771 INFO L124 PetriNetUnfolderBase]: 48/537 cut-off events. [2025-02-06 09:25:32,772 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:25:32,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 537 events. 48/537 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2490 event pairs, 35 based on Foata normal form. 81/559 useless extension candidates. Maximal degree in co-relation 611. Up to 106 conditions per place. [2025-02-06 09:25:32,778 INFO L140 encePairwiseOnDemand]: 147/160 looper letters, 21 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2025-02-06 09:25:32,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 154 transitions, 358 flow [2025-02-06 09:25:32,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2025-02-06 09:25:32,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9083333333333333 [2025-02-06 09:25:32,796 INFO L175 Difference]: Start difference. First operand has 153 places, 160 transitions, 324 flow. Second operand 3 states and 436 transitions. [2025-02-06 09:25:32,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 154 transitions, 358 flow [2025-02-06 09:25:32,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 154 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:32,805 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 308 flow [2025-02-06 09:25:32,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-02-06 09:25:32,810 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 1 predicate places. [2025-02-06 09:25:32,812 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 308 flow [2025-02-06 09:25:32,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:32,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:32,813 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] [2025-02-06 09:25:32,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:25:32,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 09:25:32,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:32,815 INFO L85 PathProgramCache]: Analyzing trace with hash 103433428, now seen corresponding path program 1 times [2025-02-06 09:25:32,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:32,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812323737] [2025-02-06 09:25:32,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:32,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:32,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 09:25:32,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 09:25:32,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:32,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:32,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:32,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812323737] [2025-02-06 09:25:32,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812323737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:32,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:32,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170087145] [2025-02-06 09:25:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:32,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:25:32,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:32,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:25:32,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:25:32,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 160 [2025-02-06 09:25:32,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:32,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:32,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 160 [2025-02-06 09:25:32,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:33,038 INFO L124 PetriNetUnfolderBase]: 18/173 cut-off events. [2025-02-06 09:25:33,040 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:25:33,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 173 events. 18/173 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 262 event pairs, 0 based on Foata normal form. 7/174 useless extension candidates. Maximal degree in co-relation 191. Up to 13 conditions per place. [2025-02-06 09:25:33,042 INFO L140 encePairwiseOnDemand]: 155/160 looper letters, 26 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-02-06 09:25:33,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 121 transitions, 312 flow [2025-02-06 09:25:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 811 transitions. [2025-02-06 09:25:33,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447916666666667 [2025-02-06 09:25:33,045 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 308 flow. Second operand 6 states and 811 transitions. [2025-02-06 09:25:33,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 121 transitions, 312 flow [2025-02-06 09:25:33,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 121 transitions, 306 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 09:25:33,049 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 218 flow [2025-02-06 09:25:33,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2025-02-06 09:25:33,050 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -42 predicate places. [2025-02-06 09:25:33,050 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 218 flow [2025-02-06 09:25:33,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:33,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:33,051 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:33,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:25:33,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 09:25:33,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1091477303, now seen corresponding path program 1 times [2025-02-06 09:25:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:33,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625326289] [2025-02-06 09:25:33,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:33,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:33,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:25:33,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:25:33,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:33,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:33,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:25:33,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:25:33,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:25:33,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:33,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:33,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:25:33,105 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:25:33,106 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-06 09:25:33,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-02-06 09:25:33,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-02-06 09:25:33,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-02-06 09:25:33,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-02-06 09:25:33,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-02-06 09:25:33,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-02-06 09:25:33,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:25:33,110 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 09:25:33,112 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:25:33,112 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:25:33,176 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:25:33,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 232 transitions, 474 flow [2025-02-06 09:25:33,213 INFO L124 PetriNetUnfolderBase]: 24/345 cut-off events. [2025-02-06 09:25:33,213 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:25:33,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 345 events. 24/345 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1420 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 216. Up to 6 conditions per place. [2025-02-06 09:25:33,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 232 transitions, 474 flow [2025-02-06 09:25:33,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 232 transitions, 474 flow [2025-02-06 09:25:33,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:33,222 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;@524150f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:33,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-06 09:25:33,226 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:33,226 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-02-06 09:25:33,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:33,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:33,226 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] [2025-02-06 09:25:33,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:33,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash -631362339, now seen corresponding path program 1 times [2025-02-06 09:25:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:33,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897809969] [2025-02-06 09:25:33,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:33,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:33,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:25:33,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:25:33,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:33,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:33,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897809969] [2025-02-06 09:25:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897809969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:33,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:33,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:33,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744186530] [2025-02-06 09:25:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:33,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:33,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:33,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:33,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:33,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 232 [2025-02-06 09:25:33,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 232 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:33,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:33,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 232 [2025-02-06 09:25:33,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:34,065 INFO L124 PetriNetUnfolderBase]: 762/5971 cut-off events. [2025-02-06 09:25:34,065 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 09:25:34,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7266 conditions, 5971 events. 762/5971 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 59592 event pairs, 686 based on Foata normal form. 1003/6397 useless extension candidates. Maximal degree in co-relation 5665. Up to 1261 conditions per place. [2025-02-06 09:25:34,098 INFO L140 encePairwiseOnDemand]: 213/232 looper letters, 29 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-02-06 09:25:34,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 221 transitions, 514 flow [2025-02-06 09:25:34,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2025-02-06 09:25:34,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9008620689655172 [2025-02-06 09:25:34,101 INFO L175 Difference]: Start difference. First operand has 221 places, 232 transitions, 474 flow. Second operand 3 states and 627 transitions. [2025-02-06 09:25:34,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 221 transitions, 514 flow [2025-02-06 09:25:34,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 221 transitions, 514 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:34,107 INFO L231 Difference]: Finished difference. Result has 222 places, 215 transitions, 450 flow [2025-02-06 09:25:34,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=222, PETRI_TRANSITIONS=215} [2025-02-06 09:25:34,109 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, 1 predicate places. [2025-02-06 09:25:34,109 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 215 transitions, 450 flow [2025-02-06 09:25:34,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:34,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:34,110 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] [2025-02-06 09:25:34,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:25:34,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:34,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash -37915755, now seen corresponding path program 1 times [2025-02-06 09:25:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:34,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54815909] [2025-02-06 09:25:34,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:34,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:34,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 09:25:34,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 09:25:34,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:34,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:34,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54815909] [2025-02-06 09:25:34,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54815909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:34,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:34,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:34,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384817318] [2025-02-06 09:25:34,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:34,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:25:34,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:34,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:25:34,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:25:34,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 232 [2025-02-06 09:25:34,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 215 transitions, 450 flow. Second operand has 5 states, 5 states have (on average 190.6) internal successors, (953), 5 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:34,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:34,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 232 [2025-02-06 09:25:34,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:34,741 INFO L124 PetriNetUnfolderBase]: 900/4602 cut-off events. [2025-02-06 09:25:34,741 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-02-06 09:25:34,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6213 conditions, 4602 events. 900/4602 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 42659 event pairs, 322 based on Foata normal form. 7/4065 useless extension candidates. Maximal degree in co-relation 5120. Up to 1199 conditions per place. [2025-02-06 09:25:34,767 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 54 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2025-02-06 09:25:34,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 247 transitions, 632 flow [2025-02-06 09:25:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1194 transitions. [2025-02-06 09:25:34,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8577586206896551 [2025-02-06 09:25:34,770 INFO L175 Difference]: Start difference. First operand has 222 places, 215 transitions, 450 flow. Second operand 6 states and 1194 transitions. [2025-02-06 09:25:34,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 247 transitions, 632 flow [2025-02-06 09:25:34,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 247 transitions, 630 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:25:34,777 INFO L231 Difference]: Finished difference. Result has 229 places, 217 transitions, 474 flow [2025-02-06 09:25:34,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=229, PETRI_TRANSITIONS=217} [2025-02-06 09:25:34,779 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, 8 predicate places. [2025-02-06 09:25:34,779 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 217 transitions, 474 flow [2025-02-06 09:25:34,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.6) internal successors, (953), 5 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:34,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:34,780 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] [2025-02-06 09:25:34,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:25:34,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:34,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 25233066, now seen corresponding path program 1 times [2025-02-06 09:25:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:34,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263896957] [2025-02-06 09:25:34,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:34,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:25:34,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:25:34,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:34,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:34,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:34,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263896957] [2025-02-06 09:25:34,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263896957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:34,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:34,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:34,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205541638] [2025-02-06 09:25:34,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:34,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:34,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:34,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:34,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:34,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 232 [2025-02-06 09:25:34,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 217 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:34,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:34,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 232 [2025-02-06 09:25:34,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:35,561 INFO L124 PetriNetUnfolderBase]: 1430/7954 cut-off events. [2025-02-06 09:25:35,561 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-02-06 09:25:35,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10301 conditions, 7954 events. 1430/7954 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 83158 event pairs, 1028 based on Foata normal form. 0/7343 useless extension candidates. Maximal degree in co-relation 10112. Up to 2270 conditions per place. [2025-02-06 09:25:35,602 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 33 selfloop transitions, 3 changer transitions 0/220 dead transitions. [2025-02-06 09:25:35,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 220 transitions, 557 flow [2025-02-06 09:25:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2025-02-06 09:25:35,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433908045977011 [2025-02-06 09:25:35,604 INFO L175 Difference]: Start difference. First operand has 229 places, 217 transitions, 474 flow. Second operand 3 states and 587 transitions. [2025-02-06 09:25:35,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 220 transitions, 557 flow [2025-02-06 09:25:35,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 220 transitions, 551 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:35,611 INFO L231 Difference]: Finished difference. Result has 225 places, 215 transitions, 479 flow [2025-02-06 09:25:35,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=479, PETRI_PLACES=225, PETRI_TRANSITIONS=215} [2025-02-06 09:25:35,613 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, 4 predicate places. [2025-02-06 09:25:35,613 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 215 transitions, 479 flow [2025-02-06 09:25:35,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:35,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:35,614 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] [2025-02-06 09:25:35,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:25:35,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:35,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1459969551, now seen corresponding path program 1 times [2025-02-06 09:25:35,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:35,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894862053] [2025-02-06 09:25:35,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:35,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:35,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 09:25:35,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 09:25:35,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:35,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:35,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:35,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894862053] [2025-02-06 09:25:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894862053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:35,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786231327] [2025-02-06 09:25:35,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:35,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:35,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:35,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:36,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 232 [2025-02-06 09:25:36,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 215 transitions, 479 flow. Second operand has 6 states, 6 states have (on average 153.5) internal successors, (921), 6 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:36,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:36,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 232 [2025-02-06 09:25:36,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:39,282 INFO L124 PetriNetUnfolderBase]: 14484/33685 cut-off events. [2025-02-06 09:25:39,283 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-02-06 09:25:39,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56853 conditions, 33685 events. 14484/33685 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 1175. Compared 375193 event pairs, 4152 based on Foata normal form. 0/32417 useless extension candidates. Maximal degree in co-relation 56568. Up to 10036 conditions per place. [2025-02-06 09:25:39,492 INFO L140 encePairwiseOnDemand]: 188/232 looper letters, 219 selfloop transitions, 84 changer transitions 0/455 dead transitions. [2025-02-06 09:25:39,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 455 transitions, 1585 flow [2025-02-06 09:25:39,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1219 transitions. [2025-02-06 09:25:39,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8757183908045977 [2025-02-06 09:25:39,495 INFO L175 Difference]: Start difference. First operand has 225 places, 215 transitions, 479 flow. Second operand 6 states and 1219 transitions. [2025-02-06 09:25:39,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 455 transitions, 1585 flow [2025-02-06 09:25:39,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 455 transitions, 1585 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:39,501 INFO L231 Difference]: Finished difference. Result has 235 places, 307 transitions, 1111 flow [2025-02-06 09:25:39,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1111, PETRI_PLACES=235, PETRI_TRANSITIONS=307} [2025-02-06 09:25:39,502 INFO L279 CegarLoopForPetriNet]: 221 programPoint places, 14 predicate places. [2025-02-06 09:25:39,502 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 307 transitions, 1111 flow [2025-02-06 09:25:39,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.5) internal successors, (921), 6 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:39,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:39,503 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:39,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:25:39,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:39,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:39,504 INFO L85 PathProgramCache]: Analyzing trace with hash 792806048, now seen corresponding path program 1 times [2025-02-06 09:25:39,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:39,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110951228] [2025-02-06 09:25:39,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:39,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:39,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:25:39,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:25:39,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:39,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:39,515 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:25:39,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:25:39,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:25:39,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:39,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:39,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:25:39,526 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:25:39,526 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-02-06 09:25:39,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-02-06 09:25:39,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-02-06 09:25:39,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-02-06 09:25:39,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-02-06 09:25:39,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-02-06 09:25:39,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-02-06 09:25:39,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-02-06 09:25:39,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-02-06 09:25:39,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-02-06 09:25:39,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:25:39,528 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 09:25:39,528 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:25:39,529 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:25:39,556 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:25:39,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 289 places, 304 transitions, 626 flow [2025-02-06 09:25:39,603 INFO L124 PetriNetUnfolderBase]: 34/475 cut-off events. [2025-02-06 09:25:39,603 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:25:39,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 475 events. 34/475 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2254 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 349. Up to 8 conditions per place. [2025-02-06 09:25:39,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 289 places, 304 transitions, 626 flow [2025-02-06 09:25:39,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 304 transitions, 626 flow [2025-02-06 09:25:39,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:39,611 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;@524150f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:39,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-06 09:25:39,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:39,614 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-02-06 09:25:39,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:39,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:39,614 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] [2025-02-06 09:25:39,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:25:39,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash -547631603, now seen corresponding path program 1 times [2025-02-06 09:25:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:39,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489914] [2025-02-06 09:25:39,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:39,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:25:39,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:25:39,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:39,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:39,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:39,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489914] [2025-02-06 09:25:39,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:39,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:39,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:39,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154142859] [2025-02-06 09:25:39,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:39,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:39,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:39,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:39,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:39,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 304 [2025-02-06 09:25:39,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 304 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:39,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:39,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 304 [2025-02-06 09:25:39,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:44,215 INFO L124 PetriNetUnfolderBase]: 8406/46559 cut-off events. [2025-02-06 09:25:44,215 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2025-02-06 09:25:44,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58782 conditions, 46559 events. 8406/46559 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 657123 event pairs, 7889 based on Foata normal form. 10101/52324 useless extension candidates. Maximal degree in co-relation 43826. Up to 11992 conditions per place. [2025-02-06 09:25:44,543 INFO L140 encePairwiseOnDemand]: 279/304 looper letters, 36 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-02-06 09:25:44,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 287 transitions, 668 flow [2025-02-06 09:25:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2025-02-06 09:25:44,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2025-02-06 09:25:44,546 INFO L175 Difference]: Start difference. First operand has 289 places, 304 transitions, 626 flow. Second operand 3 states and 817 transitions. [2025-02-06 09:25:44,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 287 transitions, 668 flow [2025-02-06 09:25:44,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 287 transitions, 666 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:44,549 INFO L231 Difference]: Finished difference. Result has 290 places, 281 transitions, 588 flow [2025-02-06 09:25:44,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=290, PETRI_TRANSITIONS=281} [2025-02-06 09:25:44,550 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, 1 predicate places. [2025-02-06 09:25:44,550 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 281 transitions, 588 flow [2025-02-06 09:25:44,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:44,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:44,551 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] [2025-02-06 09:25:44,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:25:44,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:25:44,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:44,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1599476066, now seen corresponding path program 1 times [2025-02-06 09:25:44,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:44,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855868564] [2025-02-06 09:25:44,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:44,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:44,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 09:25:44,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 09:25:44,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:44,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:44,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855868564] [2025-02-06 09:25:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855868564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:44,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:44,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421448230] [2025-02-06 09:25:44,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:44,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:25:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:44,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:25:44,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:25:44,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 304 [2025-02-06 09:25:44,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 281 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 249.6) internal successors, (1248), 5 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:44,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:44,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 304 [2025-02-06 09:25:44,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:48,146 INFO L124 PetriNetUnfolderBase]: 10308/34879 cut-off events. [2025-02-06 09:25:48,146 INFO L125 PetriNetUnfolderBase]: For 1201/1201 co-relation queries the response was YES. [2025-02-06 09:25:48,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50505 conditions, 34879 events. 10308/34879 cut-off events. For 1201/1201 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 435880 event pairs, 2982 based on Foata normal form. 7/30972 useless extension candidates. Maximal degree in co-relation 7390. Up to 14380 conditions per place. [2025-02-06 09:25:48,334 INFO L140 encePairwiseOnDemand]: 299/304 looper letters, 63 selfloop transitions, 5 changer transitions 0/315 dead transitions. [2025-02-06 09:25:48,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 315 transitions, 794 flow [2025-02-06 09:25:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1557 transitions. [2025-02-06 09:25:48,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8536184210526315 [2025-02-06 09:25:48,336 INFO L175 Difference]: Start difference. First operand has 290 places, 281 transitions, 588 flow. Second operand 6 states and 1557 transitions. [2025-02-06 09:25:48,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 315 transitions, 794 flow [2025-02-06 09:25:48,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 315 transitions, 792 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:25:48,342 INFO L231 Difference]: Finished difference. Result has 297 places, 284 transitions, 618 flow [2025-02-06 09:25:48,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=618, PETRI_PLACES=297, PETRI_TRANSITIONS=284} [2025-02-06 09:25:48,343 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, 8 predicate places. [2025-02-06 09:25:48,343 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 284 transitions, 618 flow [2025-02-06 09:25:48,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 249.6) internal successors, (1248), 5 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:48,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:48,343 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] [2025-02-06 09:25:48,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:25:48,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:25:48,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash -902806783, now seen corresponding path program 1 times [2025-02-06 09:25:48,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:48,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907139781] [2025-02-06 09:25:48,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:48,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:25:48,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:25:48,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:48,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:48,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907139781] [2025-02-06 09:25:48,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907139781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:48,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:48,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:48,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028621125] [2025-02-06 09:25:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:48,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:48,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:48,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:48,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:48,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 304 [2025-02-06 09:25:48,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 284 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:48,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:48,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 304 [2025-02-06 09:25:48,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:58,341 INFO L124 PetriNetUnfolderBase]: 25630/106275 cut-off events. [2025-02-06 09:25:58,341 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2025-02-06 09:25:58,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142509 conditions, 106275 events. 25630/106275 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 1829. Compared 1614011 event pairs, 18890 based on Foata normal form. 0/98740 useless extension candidates. Maximal degree in co-relation 142319. Up to 35724 conditions per place. [2025-02-06 09:25:59,072 INFO L140 encePairwiseOnDemand]: 293/304 looper letters, 47 selfloop transitions, 4 changer transitions 0/289 dead transitions. [2025-02-06 09:25:59,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 289 transitions, 740 flow [2025-02-06 09:25:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 763 transitions. [2025-02-06 09:25:59,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8366228070175439 [2025-02-06 09:25:59,075 INFO L175 Difference]: Start difference. First operand has 297 places, 284 transitions, 618 flow. Second operand 3 states and 763 transitions. [2025-02-06 09:25:59,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 289 transitions, 740 flow [2025-02-06 09:25:59,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 734 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:59,079 INFO L231 Difference]: Finished difference. Result has 291 places, 281 transitions, 626 flow [2025-02-06 09:25:59,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=291, PETRI_TRANSITIONS=281} [2025-02-06 09:25:59,080 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, 2 predicate places. [2025-02-06 09:25:59,081 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 281 transitions, 626 flow [2025-02-06 09:25:59,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:59,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:59,081 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] [2025-02-06 09:25:59,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:25:59,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:25:59,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:59,082 INFO L85 PathProgramCache]: Analyzing trace with hash -184887224, now seen corresponding path program 1 times [2025-02-06 09:25:59,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:59,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048115089] [2025-02-06 09:25:59,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:59,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:59,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 09:25:59,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 09:25:59,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:59,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:59,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048115089] [2025-02-06 09:25:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048115089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:59,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:59,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:59,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828254128] [2025-02-06 09:25:59,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:59,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:59,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:59,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:59,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 304 [2025-02-06 09:25:59,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 281 transitions, 626 flow. Second operand has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:59,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:59,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 304 [2025-02-06 09:25:59,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand