./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/fib_unsafe-11.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 5b16c68af06359cf155927d2335a825cd179e6a83a999e1ead7a6952268e92c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:08:35,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:08:35,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:08:35,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:08:35,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:08:35,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:08:35,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:08:35,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:08:35,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:08:35,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:08:35,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:08:35,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:08:35,241 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:08:35,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:08:35,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:08:35,242 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:08:35,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:08:35,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:08:35,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:08:35,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:08:35,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:08:35,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:08:35,243 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:08:35,243 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:08:35,243 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:08:35,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:08:35,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:08:35,243 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:08:35,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:08:35,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:08:35,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:08:35,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:08:35,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:08:35,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:08:35,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:08:35,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:08:35,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:08:35,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:08:35,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:08:35,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:08:35,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:08:35,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:08:35,244 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 -> 5b16c68af06359cf155927d2335a825cd179e6a83a999e1ead7a6952268e92c6 [2025-02-08 05:08:35,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:08:35,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:08:35,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:08:35,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:08:35,509 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:08:35,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-11.i [2025-02-08 05:08:36,701 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fcabcf6a/51ec22f53ca0435589635d6f986ced0b/FLAGb6c3d969a [2025-02-08 05:08:37,021 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:08:37,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-11.i [2025-02-08 05:08:37,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fcabcf6a/51ec22f53ca0435589635d6f986ced0b/FLAGb6c3d969a [2025-02-08 05:08:37,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fcabcf6a/51ec22f53ca0435589635d6f986ced0b [2025-02-08 05:08:37,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:08:37,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:08:37,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:08:37,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:08:37,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:08:37,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c3981a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37, skipping insertion in model container [2025-02-08 05:08:37,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:08:37,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:08:37,546 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:08:37,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:08:37,621 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:08:37,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37 WrapperNode [2025-02-08 05:08:37,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:08:37,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:08:37,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:08:37,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:08:37,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,647 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2025-02-08 05:08:37,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:08:37,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:08:37,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:08:37,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:08:37,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,658 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:08:37,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:08:37,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:08:37,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:08:37,663 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (1/1) ... [2025-02-08 05:08:37,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:08:37,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:08:37,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:08:37,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:08:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-08 05:08:37,707 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-08 05:08:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-08 05:08:37,707 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-08 05:08:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:08:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:08:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:08:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:08:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:08:37,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:08:37,708 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:08:37,788 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:08:37,789 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:08:38,029 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:08:38,029 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:08:38,103 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:08:38,104 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:08:38,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:08:38 BoogieIcfgContainer [2025-02-08 05:08:38,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:08:38,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:08:38,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:08:38,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:08:38,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:08:37" (1/3) ... [2025-02-08 05:08:38,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3caf81a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:08:38, skipping insertion in model container [2025-02-08 05:08:38,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:08:37" (2/3) ... [2025-02-08 05:08:38,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3caf81a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:08:38, skipping insertion in model container [2025-02-08 05:08:38,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:08:38" (3/3) ... [2025-02-08 05:08:38,115 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-11.i [2025-02-08 05:08:38,124 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:08:38,126 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-11.i that has 3 procedures, 176 locations, 1 initial locations, 3 loop locations, and 30 error locations. [2025-02-08 05:08:38,126 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:08:38,163 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:08:38,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 183 transitions, 374 flow [2025-02-08 05:08:38,248 INFO L124 PetriNetUnfolderBase]: 8/181 cut-off events. [2025-02-08 05:08:38,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:38,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 8/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 372 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 155. Up to 2 conditions per place. [2025-02-08 05:08:38,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 183 transitions, 374 flow [2025-02-08 05:08:38,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 181 transitions, 368 flow [2025-02-08 05:08:38,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:08:38,279 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;@3e77aea1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:08:38,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 05:08:38,286 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:08:38,287 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-02-08 05:08:38,287 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:38,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:38,288 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] [2025-02-08 05:08:38,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:38,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:38,295 INFO L85 PathProgramCache]: Analyzing trace with hash 374529245, now seen corresponding path program 1 times [2025-02-08 05:08:38,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:38,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83681286] [2025-02-08 05:08:38,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:38,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 05:08:38,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:08:38,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:38,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:38,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83681286] [2025-02-08 05:08:38,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83681286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:38,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:38,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:08:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217825803] [2025-02-08 05:08:38,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:38,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:08:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:38,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:08:38,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:08:38,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 183 [2025-02-08 05:08:38,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 181 transitions, 368 flow. Second operand has 2 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:38,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:38,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 183 [2025-02-08 05:08:38,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:38,587 INFO L124 PetriNetUnfolderBase]: 13/317 cut-off events. [2025-02-08 05:08:38,591 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:08:38,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 317 events. 13/317 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1169 event pairs, 6 based on Foata normal form. 22/285 useless extension candidates. Maximal degree in co-relation 312. Up to 21 conditions per place. [2025-02-08 05:08:38,599 INFO L140 encePairwiseOnDemand]: 168/183 looper letters, 7 selfloop transitions, 0 changer transitions 0/164 dead transitions. [2025-02-08 05:08:38,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 348 flow [2025-02-08 05:08:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:08:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:08:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 342 transitions. [2025-02-08 05:08:38,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344262295081968 [2025-02-08 05:08:38,614 INFO L175 Difference]: Start difference. First operand has 180 places, 181 transitions, 368 flow. Second operand 2 states and 342 transitions. [2025-02-08 05:08:38,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 348 flow [2025-02-08 05:08:38,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:38,620 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 332 flow [2025-02-08 05:08:38,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=332, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2025-02-08 05:08:38,625 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -13 predicate places. [2025-02-08 05:08:38,627 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 332 flow [2025-02-08 05:08:38,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:38,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:38,627 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] [2025-02-08 05:08:38,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:08:38,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:38,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1727822325, now seen corresponding path program 1 times [2025-02-08 05:08:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:38,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54314596] [2025-02-08 05:08:38,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:38,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:08:38,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:08:38,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:38,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:38,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54314596] [2025-02-08 05:08:38,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54314596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:38,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192045682] [2025-02-08 05:08:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:38,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:38,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:38,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:38,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-02-08 05:08:38,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:38,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:38,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-02-08 05:08:38,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:38,837 INFO L124 PetriNetUnfolderBase]: 63/594 cut-off events. [2025-02-08 05:08:38,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:38,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 594 events. 63/594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3295 event pairs, 29 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 716. Up to 81 conditions per place. [2025-02-08 05:08:38,846 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-02-08 05:08:38,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 372 flow [2025-02-08 05:08:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:08:38,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-02-08 05:08:38,852 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 332 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:08:38,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 372 flow [2025-02-08 05:08:38,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 372 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:08:38,856 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 334 flow [2025-02-08 05:08:38,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2025-02-08 05:08:38,859 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -12 predicate places. [2025-02-08 05:08:38,859 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 334 flow [2025-02-08 05:08:38,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:38,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:38,859 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] [2025-02-08 05:08:38,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:08:38,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:38,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1628580544, now seen corresponding path program 1 times [2025-02-08 05:08:38,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:38,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922268458] [2025-02-08 05:08:38,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:38,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:08:38,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:08:38,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:38,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922268458] [2025-02-08 05:08:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922268458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:38,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:38,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:38,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74738203] [2025-02-08 05:08:38,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:38,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:38,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:38,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:38,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-02-08 05:08:38,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:38,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:38,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-02-08 05:08:38,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:38,985 INFO L124 PetriNetUnfolderBase]: 50/334 cut-off events. [2025-02-08 05:08:38,986 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:08:38,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 334 events. 50/334 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1522 event pairs, 11 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 447. Up to 55 conditions per place. [2025-02-08 05:08:38,988 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-02-08 05:08:38,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 370 flow [2025-02-08 05:08:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:08:38,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-02-08 05:08:38,991 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 334 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:08:38,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 370 flow [2025-02-08 05:08:38,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:38,995 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 330 flow [2025-02-08 05:08:38,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2025-02-08 05:08:38,997 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -14 predicate places. [2025-02-08 05:08:38,997 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 330 flow [2025-02-08 05:08:38,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:38,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:38,997 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] [2025-02-08 05:08:38,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:08:38,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:38,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:38,999 INFO L85 PathProgramCache]: Analyzing trace with hash 884190699, now seen corresponding path program 1 times [2025-02-08 05:08:38,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:38,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075408752] [2025-02-08 05:08:38,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:38,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:39,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:08:39,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:08:39,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:39,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075408752] [2025-02-08 05:08:39,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075408752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:39,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:39,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:39,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379572278] [2025-02-08 05:08:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:39,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:39,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:39,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:39,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-02-08 05:08:39,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:39,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-02-08 05:08:39,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:39,166 INFO L124 PetriNetUnfolderBase]: 41/346 cut-off events. [2025-02-08 05:08:39,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:39,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 346 events. 41/346 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1662 event pairs, 26 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 428. Up to 59 conditions per place. [2025-02-08 05:08:39,168 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2025-02-08 05:08:39,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 162 transitions, 364 flow [2025-02-08 05:08:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-02-08 05:08:39,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-02-08 05:08:39,171 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 330 flow. Second operand 3 states and 473 transitions. [2025-02-08 05:08:39,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 162 transitions, 364 flow [2025-02-08 05:08:39,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 162 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:39,173 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 328 flow [2025-02-08 05:08:39,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-02-08 05:08:39,175 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -15 predicate places. [2025-02-08 05:08:39,175 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 328 flow [2025-02-08 05:08:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:39,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:08:39,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:08:39,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:39,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash -108860610, now seen corresponding path program 1 times [2025-02-08 05:08:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:39,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984585226] [2025-02-08 05:08:39,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:39,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:39,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:08:39,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:08:39,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:39,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:39,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984585226] [2025-02-08 05:08:39,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984585226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:39,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:39,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:39,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288812706] [2025-02-08 05:08:39,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:39,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:39,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:39,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:39,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:39,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-02-08 05:08:39,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:39,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-02-08 05:08:39,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:39,280 INFO L124 PetriNetUnfolderBase]: 37/360 cut-off events. [2025-02-08 05:08:39,280 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:08:39,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 360 events. 37/360 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1721 event pairs, 16 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 440. Up to 40 conditions per place. [2025-02-08 05:08:39,283 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 13 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2025-02-08 05:08:39,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 160 transitions, 358 flow [2025-02-08 05:08:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-02-08 05:08:39,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-02-08 05:08:39,285 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 328 flow. Second operand 3 states and 473 transitions. [2025-02-08 05:08:39,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 160 transitions, 358 flow [2025-02-08 05:08:39,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:39,287 INFO L231 Difference]: Finished difference. Result has 163 places, 158 transitions, 324 flow [2025-02-08 05:08:39,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=163, PETRI_TRANSITIONS=158} [2025-02-08 05:08:39,288 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -17 predicate places. [2025-02-08 05:08:39,288 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 158 transitions, 324 flow [2025-02-08 05:08:39,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:39,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:08:39,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:08:39,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:39,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:39,290 INFO L85 PathProgramCache]: Analyzing trace with hash -323255418, now seen corresponding path program 1 times [2025-02-08 05:08:39,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:39,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670280597] [2025-02-08 05:08:39,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:39,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:08:39,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:08:39,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:39,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:39,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:39,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670280597] [2025-02-08 05:08:39,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670280597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:39,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:39,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:39,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038127937] [2025-02-08 05:08:39,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:39,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:39,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:39,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:39,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:39,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2025-02-08 05:08:39,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 158 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:39,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2025-02-08 05:08:39,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:39,385 INFO L124 PetriNetUnfolderBase]: 65/502 cut-off events. [2025-02-08 05:08:39,385 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:39,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 502 events. 65/502 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2713 event pairs, 24 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 622. Up to 87 conditions per place. [2025-02-08 05:08:39,389 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 16 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-02-08 05:08:39,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 362 flow [2025-02-08 05:08:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-02-08 05:08:39,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-02-08 05:08:39,391 INFO L175 Difference]: Start difference. First operand has 163 places, 158 transitions, 324 flow. Second operand 3 states and 469 transitions. [2025-02-08 05:08:39,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 159 transitions, 362 flow [2025-02-08 05:08:39,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:39,393 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 322 flow [2025-02-08 05:08:39,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-02-08 05:08:39,394 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -18 predicate places. [2025-02-08 05:08:39,394 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 322 flow [2025-02-08 05:08:39,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:39,395 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-08 05:08:39,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:08:39,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:39,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash -785076140, now seen corresponding path program 1 times [2025-02-08 05:08:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:39,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999541706] [2025-02-08 05:08:39,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:39,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:08:39,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:08:39,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:39,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:39,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:39,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999541706] [2025-02-08 05:08:39,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999541706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:39,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280359245] [2025-02-08 05:08:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:39,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:39,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:39,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:39,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-02-08 05:08:39,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:39,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-02-08 05:08:39,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:39,501 INFO L124 PetriNetUnfolderBase]: 37/428 cut-off events. [2025-02-08 05:08:39,502 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:08:39,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 428 events. 37/428 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2094 event pairs, 10 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 508. Up to 40 conditions per place. [2025-02-08 05:08:39,505 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-02-08 05:08:39,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 352 flow [2025-02-08 05:08:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-02-08 05:08:39,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-02-08 05:08:39,506 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 322 flow. Second operand 3 states and 473 transitions. [2025-02-08 05:08:39,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 352 flow [2025-02-08 05:08:39,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:39,508 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 318 flow [2025-02-08 05:08:39,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2025-02-08 05:08:39,509 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -20 predicate places. [2025-02-08 05:08:39,509 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 318 flow [2025-02-08 05:08:39,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:39,510 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-08 05:08:39,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:08:39,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:39,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1904828980, now seen corresponding path program 1 times [2025-02-08 05:08:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:39,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330842269] [2025-02-08 05:08:39,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:39,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:39,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:08:39,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:08:39,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:39,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:39,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:39,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330842269] [2025-02-08 05:08:39,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330842269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:39,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:39,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:39,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007498079] [2025-02-08 05:08:39,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:39,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:39,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:39,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:39,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:39,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-02-08 05:08:39,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:39,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-02-08 05:08:39,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:39,597 INFO L124 PetriNetUnfolderBase]: 52/363 cut-off events. [2025-02-08 05:08:39,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:39,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 363 events. 52/363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1688 event pairs, 26 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 476. Up to 72 conditions per place. [2025-02-08 05:08:39,600 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-02-08 05:08:39,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 358 flow [2025-02-08 05:08:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:08:39,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-02-08 05:08:39,602 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 318 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:08:39,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 358 flow [2025-02-08 05:08:39,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:39,606 INFO L231 Difference]: Finished difference. Result has 159 places, 154 transitions, 316 flow [2025-02-08 05:08:39,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=159, PETRI_TRANSITIONS=154} [2025-02-08 05:08:39,607 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -21 predicate places. [2025-02-08 05:08:39,607 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 154 transitions, 316 flow [2025-02-08 05:08:39,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:39,608 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] [2025-02-08 05:08:39,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:08:39,608 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:39,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:39,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2106103084, now seen corresponding path program 1 times [2025-02-08 05:08:39,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:39,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480864423] [2025-02-08 05:08:39,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:39,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:39,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:08:39,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:08:39,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:39,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:39,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:39,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480864423] [2025-02-08 05:08:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480864423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:39,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:08:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212638487] [2025-02-08 05:08:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:39,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:39,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:39,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:39,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:39,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2025-02-08 05:08:39,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 154 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:39,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2025-02-08 05:08:39,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:39,700 INFO L124 PetriNetUnfolderBase]: 25/567 cut-off events. [2025-02-08 05:08:39,700 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:39,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 567 events. 25/567 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2460 event pairs, 6 based on Foata normal form. 4/495 useless extension candidates. Maximal degree in co-relation 622. Up to 29 conditions per place. [2025-02-08 05:08:39,703 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-02-08 05:08:39,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 350 flow [2025-02-08 05:08:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-02-08 05:08:39,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8797814207650273 [2025-02-08 05:08:39,705 INFO L175 Difference]: Start difference. First operand has 159 places, 154 transitions, 316 flow. Second operand 3 states and 483 transitions. [2025-02-08 05:08:39,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 350 flow [2025-02-08 05:08:39,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:39,707 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 324 flow [2025-02-08 05:08:39,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2025-02-08 05:08:39,708 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -20 predicate places. [2025-02-08 05:08:39,708 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 324 flow [2025-02-08 05:08:39,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:39,709 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] [2025-02-08 05:08:39,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:08:39,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:39,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2106103472, now seen corresponding path program 1 times [2025-02-08 05:08:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:39,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059619345] [2025-02-08 05:08:39,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:39,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:08:39,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:08:39,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:39,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:39,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:39,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059619345] [2025-02-08 05:08:39,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059619345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:39,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:39,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:39,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143969907] [2025-02-08 05:08:39,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:39,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:39,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:39,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:39,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:39,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 183 [2025-02-08 05:08:39,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:39,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 183 [2025-02-08 05:08:39,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:39,804 INFO L124 PetriNetUnfolderBase]: 57/553 cut-off events. [2025-02-08 05:08:39,804 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:08:39,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 553 events. 57/553 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2417 event pairs, 10 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 664. Up to 66 conditions per place. [2025-02-08 05:08:39,808 INFO L140 encePairwiseOnDemand]: 178/183 looper letters, 11 selfloop transitions, 3 changer transitions 0/155 dead transitions. [2025-02-08 05:08:39,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 155 transitions, 352 flow [2025-02-08 05:08:39,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-02-08 05:08:39,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652094717668488 [2025-02-08 05:08:39,809 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 324 flow. Second operand 3 states and 475 transitions. [2025-02-08 05:08:39,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 155 transitions, 352 flow [2025-02-08 05:08:39,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:08:39,811 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 324 flow [2025-02-08 05:08:39,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=159, PETRI_TRANSITIONS=153} [2025-02-08 05:08:39,812 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -21 predicate places. [2025-02-08 05:08:39,812 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 324 flow [2025-02-08 05:08:39,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:39,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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:08:39,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:08:39,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:39,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1035831409, now seen corresponding path program 1 times [2025-02-08 05:08:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:39,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456001830] [2025-02-08 05:08:39,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:39,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:08:39,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:08:39,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:39,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:39,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:39,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456001830] [2025-02-08 05:08:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456001830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:39,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116268836] [2025-02-08 05:08:39,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:39,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:39,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:39,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:39,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:39,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 183 [2025-02-08 05:08:39,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 153 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:39,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 183 [2025-02-08 05:08:39,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:39,901 INFO L124 PetriNetUnfolderBase]: 65/561 cut-off events. [2025-02-08 05:08:39,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:39,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 561 events. 65/561 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2504 event pairs, 14 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 700. Up to 72 conditions per place. [2025-02-08 05:08:39,905 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-02-08 05:08:39,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 153 transitions, 352 flow [2025-02-08 05:08:39,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-02-08 05:08:39,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652094717668488 [2025-02-08 05:08:39,907 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 324 flow. Second operand 3 states and 475 transitions. [2025-02-08 05:08:39,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 153 transitions, 352 flow [2025-02-08 05:08:39,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 153 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:39,909 INFO L231 Difference]: Finished difference. Result has 157 places, 151 transitions, 318 flow [2025-02-08 05:08:39,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=157, PETRI_TRANSITIONS=151} [2025-02-08 05:08:39,910 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -23 predicate places. [2025-02-08 05:08:39,910 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 151 transitions, 318 flow [2025-02-08 05:08:39,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:39,911 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-08 05:08:39,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:08:39,911 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:39,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1671446380, now seen corresponding path program 1 times [2025-02-08 05:08:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:39,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479997064] [2025-02-08 05:08:39,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:39,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:39,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:08:39,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:08:39,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:39,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:39,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:39,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479997064] [2025-02-08 05:08:39,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479997064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:39,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:39,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:39,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352326819] [2025-02-08 05:08:39,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:39,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:39,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:39,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:39,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-02-08 05:08:39,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 151 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:39,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:39,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-02-08 05:08:39,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:39,994 INFO L124 PetriNetUnfolderBase]: 37/409 cut-off events. [2025-02-08 05:08:39,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:39,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 409 events. 37/409 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1520 event pairs, 24 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 500. Up to 55 conditions per place. [2025-02-08 05:08:39,998 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2025-02-08 05:08:39,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 152 transitions, 352 flow [2025-02-08 05:08:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-02-08 05:08:40,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-02-08 05:08:40,000 INFO L175 Difference]: Start difference. First operand has 157 places, 151 transitions, 318 flow. Second operand 3 states and 473 transitions. [2025-02-08 05:08:40,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 152 transitions, 352 flow [2025-02-08 05:08:40,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 152 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:40,018 INFO L231 Difference]: Finished difference. Result has 156 places, 150 transitions, 316 flow [2025-02-08 05:08:40,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=156, PETRI_TRANSITIONS=150} [2025-02-08 05:08:40,019 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -24 predicate places. [2025-02-08 05:08:40,019 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 150 transitions, 316 flow [2025-02-08 05:08:40,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:40,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:08:40,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:08:40,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:40,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1722177580, now seen corresponding path program 1 times [2025-02-08 05:08:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:40,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963655766] [2025-02-08 05:08:40,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:40,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:08:40,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:08:40,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:40,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:40,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:40,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963655766] [2025-02-08 05:08:40,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963655766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:40,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:40,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:40,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241703662] [2025-02-08 05:08:40,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:40,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:40,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:40,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:40,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-02-08 05:08:40,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 150 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:40,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-02-08 05:08:40,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:40,109 INFO L124 PetriNetUnfolderBase]: 61/567 cut-off events. [2025-02-08 05:08:40,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:40,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 567 events. 61/567 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2719 event pairs, 38 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 704. Up to 83 conditions per place. [2025-02-08 05:08:40,113 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-02-08 05:08:40,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 151 transitions, 350 flow [2025-02-08 05:08:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-02-08 05:08:40,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-02-08 05:08:40,115 INFO L175 Difference]: Start difference. First operand has 156 places, 150 transitions, 316 flow. Second operand 3 states and 473 transitions. [2025-02-08 05:08:40,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 151 transitions, 350 flow [2025-02-08 05:08:40,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 151 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:40,117 INFO L231 Difference]: Finished difference. Result has 155 places, 149 transitions, 314 flow [2025-02-08 05:08:40,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=155, PETRI_TRANSITIONS=149} [2025-02-08 05:08:40,118 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -25 predicate places. [2025-02-08 05:08:40,118 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 149 transitions, 314 flow [2025-02-08 05:08:40,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:40,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:08:40,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:08:40,119 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:40,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:40,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1236526129, now seen corresponding path program 1 times [2025-02-08 05:08:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:40,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653396499] [2025-02-08 05:08:40,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:40,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:40,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:08:40,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:08:40,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:40,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:40,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653396499] [2025-02-08 05:08:40,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653396499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:40,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:40,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263797026] [2025-02-08 05:08:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:40,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:40,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:40,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:40,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:40,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2025-02-08 05:08:40,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 149 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:40,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2025-02-08 05:08:40,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:40,210 INFO L124 PetriNetUnfolderBase]: 65/563 cut-off events. [2025-02-08 05:08:40,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:40,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 563 events. 65/563 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2747 event pairs, 42 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 720. Up to 91 conditions per place. [2025-02-08 05:08:40,214 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-02-08 05:08:40,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 150 transitions, 350 flow [2025-02-08 05:08:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-02-08 05:08:40,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-02-08 05:08:40,216 INFO L175 Difference]: Start difference. First operand has 155 places, 149 transitions, 314 flow. Second operand 3 states and 471 transitions. [2025-02-08 05:08:40,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 150 transitions, 350 flow [2025-02-08 05:08:40,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 150 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:40,218 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 312 flow [2025-02-08 05:08:40,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=152, 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=312, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-02-08 05:08:40,219 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-02-08 05:08:40,219 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 312 flow [2025-02-08 05:08:40,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:40,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:08:40,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:08:40,220 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:40,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash 584907342, now seen corresponding path program 1 times [2025-02-08 05:08:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:40,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765006603] [2025-02-08 05:08:40,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:40,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:08:40,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:08:40,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:40,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:40,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:40,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765006603] [2025-02-08 05:08:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765006603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:40,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965201785] [2025-02-08 05:08:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:40,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:40,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:40,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:40,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:40,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2025-02-08 05:08:40,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:40,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2025-02-08 05:08:40,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:40,327 INFO L124 PetriNetUnfolderBase]: 51/535 cut-off events. [2025-02-08 05:08:40,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:40,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 535 events. 51/535 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2271 event pairs, 10 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 642. Up to 50 conditions per place. [2025-02-08 05:08:40,330 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 11 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-02-08 05:08:40,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 150 transitions, 342 flow [2025-02-08 05:08:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2025-02-08 05:08:40,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8779599271402551 [2025-02-08 05:08:40,332 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 312 flow. Second operand 3 states and 482 transitions. [2025-02-08 05:08:40,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 150 transitions, 342 flow [2025-02-08 05:08:40,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 150 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:40,335 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 316 flow [2025-02-08 05:08:40,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-02-08 05:08:40,335 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-02-08 05:08:40,335 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 316 flow [2025-02-08 05:08:40,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:40,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:08:40,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:08:40,336 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:40,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:40,337 INFO L85 PathProgramCache]: Analyzing trace with hash 479873615, now seen corresponding path program 1 times [2025-02-08 05:08:40,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:40,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405845349] [2025-02-08 05:08:40,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:40,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:40,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:08:40,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:08:40,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:40,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:40,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-08 05:08:40,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:40,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405845349] [2025-02-08 05:08:40,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405845349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:40,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:40,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:40,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819264911] [2025-02-08 05:08:40,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:40,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:40,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:40,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:40,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2025-02-08 05:08:40,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:40,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2025-02-08 05:08:40,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:40,443 INFO L124 PetriNetUnfolderBase]: 69/551 cut-off events. [2025-02-08 05:08:40,443 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:08:40,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 551 events. 69/551 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2717 event pairs, 46 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 720. Up to 99 conditions per place. [2025-02-08 05:08:40,447 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2025-02-08 05:08:40,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 149 transitions, 352 flow [2025-02-08 05:08:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-02-08 05:08:40,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-02-08 05:08:40,448 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 316 flow. Second operand 3 states and 471 transitions. [2025-02-08 05:08:40,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 149 transitions, 352 flow [2025-02-08 05:08:40,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 149 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:08:40,451 INFO L231 Difference]: Finished difference. Result has 154 places, 147 transitions, 316 flow [2025-02-08 05:08:40,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2025-02-08 05:08:40,451 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-02-08 05:08:40,451 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 316 flow [2025-02-08 05:08:40,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:08:40,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:08:40,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:08:40,452 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:08:40,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:08:40,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1819582643, now seen corresponding path program 1 times [2025-02-08 05:08:40,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:08:40,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119004414] [2025-02-08 05:08:40,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:08:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:08:40,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:08:40,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:08:40,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:08:40,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:08:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:08:40,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:08:40,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119004414] [2025-02-08 05:08:40,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119004414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:08:40,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:08:40,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:08:40,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589556261] [2025-02-08 05:08:40,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:08:40,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:08:40,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:08:40,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:08:40,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:08:40,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2025-02-08 05:08:40,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:08:40,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2025-02-08 05:08:40,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:08:40,552 INFO L124 PetriNetUnfolderBase]: 57/535 cut-off events. [2025-02-08 05:08:40,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:08:40,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 535 events. 57/535 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2455 event pairs, 42 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 692. Up to 91 conditions per place. [2025-02-08 05:08:40,555 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 0 selfloop transitions, 0 changer transitions 148/148 dead transitions. [2025-02-08 05:08:40,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 148 transitions, 354 flow [2025-02-08 05:08:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:08:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:08:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-02-08 05:08:40,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-02-08 05:08:40,556 INFO L175 Difference]: Start difference. First operand has 154 places, 147 transitions, 316 flow. Second operand 3 states and 469 transitions. [2025-02-08 05:08:40,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 148 transitions, 354 flow [2025-02-08 05:08:40,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 148 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:08:40,559 INFO L231 Difference]: Finished difference. Result has 153 places, 0 transitions, 0 flow [2025-02-08 05:08:40,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=153, PETRI_TRANSITIONS=0} [2025-02-08 05:08:40,559 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -27 predicate places. [2025-02-08 05:08:40,559 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 0 transitions, 0 flow [2025-02-08 05:08:40,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-02-08 05:08:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-02-08 05:08:40,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-02-08 05:08:40,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-02-08 05:08:40,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-02-08 05:08:40,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-02-08 05:08:40,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-02-08 05:08:40,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-02-08 05:08:40,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-02-08 05:08:40,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:08:40,565 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:08:40,569 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:08:40,569 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:08:40,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:08:40 BasicIcfg [2025-02-08 05:08:40,574 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:08:40,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:08:40,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:08:40,574 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:08:40,575 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:08:38" (3/4) ... [2025-02-08 05:08:40,576 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:08:40,578 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-02-08 05:08:40,578 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-02-08 05:08:40,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 05:08:40,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 05:08:40,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:08:40,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:08:40,629 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:08:40,629 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:08:40,629 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:08:40,630 INFO L158 Benchmark]: Toolchain (without parser) took 3357.30ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 128.6MB in the beginning and 111.2MB in the end (delta: 17.4MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2025-02-08 05:08:40,630 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:08:40,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.93ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 108.9MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:08:40,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 107.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:08:40,631 INFO L158 Benchmark]: Boogie Preprocessor took 13.83ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 106.3MB in the end (delta: 890.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:08:40,631 INFO L158 Benchmark]: IcfgBuilder took 441.94ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 81.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:08:40,631 INFO L158 Benchmark]: TraceAbstraction took 2468.03ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 80.7MB in the beginning and 116.5MB in the end (delta: -35.8MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2025-02-08 05:08:40,631 INFO L158 Benchmark]: Witness Printer took 55.21ms. Allocated memory is still 243.3MB. Free memory was 116.5MB in the beginning and 111.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:08:40,632 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.93ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 108.9MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 107.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.83ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 106.3MB in the end (delta: 890.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 441.94ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 81.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2468.03ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 80.7MB in the beginning and 116.5MB in the end (delta: -35.8MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * Witness Printer took 55.21ms. Allocated memory is still 243.3MB. Free memory was 116.5MB in the beginning and 111.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 236 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 515 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 51 mSDtfsCounter, 515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 791 NumberOfCodeBlocks, 791 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 774 ConstructedInterpolants, 0 QuantifiedInterpolants, 818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:08:40,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE