./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/lamport.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:16:48,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:16:48,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:16:48,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:16:48,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:16:48,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:16:48,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:16:48,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:16:48,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:16:48,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:16:48,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:16:48,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:16:48,378 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:16:48,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:16:48,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:16:48,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:16:48,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:16:48,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:16:48,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:16:48,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:16:48,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:16:48,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:16:48,379 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:16:48,379 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:16:48,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:16:48,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:16:48,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:16:48,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:16:48,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:16:48,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:16:48,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:16:48,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:16:48,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:16:48,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:16:48,381 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:16:48,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:16:48,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:16:48,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:16:48,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:16:48,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:16:48,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:16:48,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:16:48,382 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c [2025-03-14 01:16:48,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:16:48,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:16:48,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:16:48,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:16:48,621 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:16:48,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport.i [2025-03-14 01:16:49,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18de3f29/87aad8cd688e44d5a8454accd2d77e6b/FLAG8fd8c0264 [2025-03-14 01:16:49,977 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:16:49,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2025-03-14 01:16:49,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18de3f29/87aad8cd688e44d5a8454accd2d77e6b/FLAG8fd8c0264 [2025-03-14 01:16:50,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18de3f29/87aad8cd688e44d5a8454accd2d77e6b [2025-03-14 01:16:50,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:16:50,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:16:50,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:16:50,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:16:50,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:16:50,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48dace18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50, skipping insertion in model container [2025-03-14 01:16:50,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:16:50,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:16:50,594 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:16:50,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:16:50,652 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:16:50,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50 WrapperNode [2025-03-14 01:16:50,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:16:50,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:16:50,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:16:50,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:16:50,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,676 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2025-03-14 01:16:50,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:16:50,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:16:50,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:16:50,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:16:50,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:16:50,693 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:16:50,694 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:16:50,694 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:16:50,694 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (1/1) ... [2025-03-14 01:16:50,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:16:50,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:50,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:16:50,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:16:50,737 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-14 01:16:50,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-14 01:16:50,737 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 01:16:50,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 01:16:50,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:16:50,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:16:50,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:16:50,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:16:50,739 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:16:50,826 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:16:50,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:16:50,998 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:16:50,999 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:16:50,999 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:16:51,015 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:16:51,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:16:51 BoogieIcfgContainer [2025-03-14 01:16:51,016 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:16:51,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:16:51,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:16:51,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:16:51,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:16:50" (1/3) ... [2025-03-14 01:16:51,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d51b386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:16:51, skipping insertion in model container [2025-03-14 01:16:51,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:16:50" (2/3) ... [2025-03-14 01:16:51,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d51b386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:16:51, skipping insertion in model container [2025-03-14 01:16:51,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:16:51" (3/3) ... [2025-03-14 01:16:51,024 INFO L128 eAbstractionObserver]: Analyzing ICFG lamport.i [2025-03-14 01:16:51,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:16:51,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lamport.i that has 3 procedures, 98 locations, 1 initial locations, 8 loop locations, and 4 error locations. [2025-03-14 01:16:51,039 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:16:51,093 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:16:51,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 115 transitions, 244 flow [2025-03-14 01:16:51,169 INFO L124 PetriNetUnfolderBase]: 18/113 cut-off events. [2025-03-14 01:16:51,170 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:16:51,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 113 events. 18/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 232 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 90. Up to 3 conditions per place. [2025-03-14 01:16:51,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 115 transitions, 244 flow [2025-03-14 01:16:51,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 108 transitions, 225 flow [2025-03-14 01:16:51,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:16:51,195 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;@4a8104d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:16:51,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-14 01:16:51,202 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:16:51,202 INFO L124 PetriNetUnfolderBase]: 3/40 cut-off events. [2025-03-14 01:16:51,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:16:51,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:51,203 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] [2025-03-14 01:16:51,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:16:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash 847437989, now seen corresponding path program 1 times [2025-03-14 01:16:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:51,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735229502] [2025-03-14 01:16:51,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:51,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:51,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:16:51,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:16:51,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:51,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:16:51,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735229502] [2025-03-14 01:16:51,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735229502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:51,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:51,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:51,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124233364] [2025-03-14 01:16:51,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:51,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:16:51,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:51,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:16:51,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:16:51,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2025-03-14 01:16:51,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 225 flow. Second operand has 2 states, 2 states have (on average 92.0) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:51,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:51,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2025-03-14 01:16:51,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:51,506 INFO L124 PetriNetUnfolderBase]: 131/472 cut-off events. [2025-03-14 01:16:51,506 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-14 01:16:51,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 472 events. 131/472 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2346 event pairs, 63 based on Foata normal form. 42/415 useless extension candidates. Maximal degree in co-relation 593. Up to 160 conditions per place. [2025-03-14 01:16:51,512 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 17 selfloop transitions, 0 changer transitions 0/100 dead transitions. [2025-03-14 01:16:51,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 100 transitions, 243 flow [2025-03-14 01:16:51,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:16:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:16:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 205 transitions. [2025-03-14 01:16:51,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913043478260869 [2025-03-14 01:16:51,525 INFO L175 Difference]: Start difference. First operand has 97 places, 108 transitions, 225 flow. Second operand 2 states and 205 transitions. [2025-03-14 01:16:51,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 100 transitions, 243 flow [2025-03-14 01:16:51,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 100 transitions, 238 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:16:51,533 INFO L231 Difference]: Finished difference. Result has 93 places, 100 transitions, 204 flow [2025-03-14 01:16:51,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=204, PETRI_PLACES=93, PETRI_TRANSITIONS=100} [2025-03-14 01:16:51,540 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, -4 predicate places. [2025-03-14 01:16:51,542 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 100 transitions, 204 flow [2025-03-14 01:16:51,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 92.0) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:51,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:51,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:51,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:16:51,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:16:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1326261279, now seen corresponding path program 1 times [2025-03-14 01:16:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:51,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259358607] [2025-03-14 01:16:51,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:51,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:16:51,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:16:51,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:51,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:16:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259358607] [2025-03-14 01:16:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259358607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:51,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:51,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:51,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653311858] [2025-03-14 01:16:51,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:51,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:51,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:51,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:51,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:51,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 115 [2025-03-14 01:16:51,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 100 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:51,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:51,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 115 [2025-03-14 01:16:51,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:51,787 INFO L124 PetriNetUnfolderBase]: 218/704 cut-off events. [2025-03-14 01:16:51,787 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 01:16:51,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 704 events. 218/704 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4069 event pairs, 111 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1057. Up to 283 conditions per place. [2025-03-14 01:16:51,794 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 32 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2025-03-14 01:16:51,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 112 transitions, 304 flow [2025-03-14 01:16:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-03-14 01:16:51,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8318840579710145 [2025-03-14 01:16:51,797 INFO L175 Difference]: Start difference. First operand has 93 places, 100 transitions, 204 flow. Second operand 3 states and 287 transitions. [2025-03-14 01:16:51,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 112 transitions, 304 flow [2025-03-14 01:16:51,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 112 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:51,800 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 242 flow [2025-03-14 01:16:51,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2025-03-14 01:16:51,801 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2025-03-14 01:16:51,801 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 242 flow [2025-03-14 01:16:51,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:51,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:51,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:51,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:16:51,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:16:51,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1245891843, now seen corresponding path program 1 times [2025-03-14 01:16:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630774739] [2025-03-14 01:16:51,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:51,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:16:51,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:16:51,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:51,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:16:51,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:51,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630774739] [2025-03-14 01:16:51,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630774739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:51,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:51,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:51,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837612205] [2025-03-14 01:16:51,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:51,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:51,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:51,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:51,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 115 [2025-03-14 01:16:51,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:51,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:51,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 115 [2025-03-14 01:16:51,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:51,984 INFO L124 PetriNetUnfolderBase]: 210/720 cut-off events. [2025-03-14 01:16:51,984 INFO L125 PetriNetUnfolderBase]: For 87/89 co-relation queries the response was YES. [2025-03-14 01:16:51,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 720 events. 210/720 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4175 event pairs, 58 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 1172. Up to 201 conditions per place. [2025-03-14 01:16:51,989 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 38 selfloop transitions, 6 changer transitions 5/126 dead transitions. [2025-03-14 01:16:51,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 126 transitions, 395 flow [2025-03-14 01:16:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-03-14 01:16:51,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863768115942029 [2025-03-14 01:16:51,993 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 242 flow. Second operand 3 states and 298 transitions. [2025-03-14 01:16:51,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 126 transitions, 395 flow [2025-03-14 01:16:51,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 126 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:51,998 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 278 flow [2025-03-14 01:16:51,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=99, PETRI_TRANSITIONS=107} [2025-03-14 01:16:51,999 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 2 predicate places. [2025-03-14 01:16:51,999 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 278 flow [2025-03-14 01:16:51,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:52,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:52,000 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] [2025-03-14 01:16:52,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:16:52,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:16:52,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 333454812, now seen corresponding path program 1 times [2025-03-14 01:16:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:52,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202788762] [2025-03-14 01:16:52,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:52,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:16:52,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:16:52,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:52,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:16:52,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:52,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202788762] [2025-03-14 01:16:52,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202788762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:52,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:52,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:16:52,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488748842] [2025-03-14 01:16:52,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:52,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:52,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:52,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:52,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:52,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 115 [2025-03-14 01:16:52,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 107 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:52,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:52,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 115 [2025-03-14 01:16:52,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:52,194 INFO L124 PetriNetUnfolderBase]: 244/771 cut-off events. [2025-03-14 01:16:52,194 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2025-03-14 01:16:52,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 771 events. 244/771 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4482 event pairs, 112 based on Foata normal form. 0/653 useless extension candidates. Maximal degree in co-relation 1392. Up to 325 conditions per place. [2025-03-14 01:16:52,198 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 31 selfloop transitions, 7 changer transitions 4/119 dead transitions. [2025-03-14 01:16:52,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 119 transitions, 393 flow [2025-03-14 01:16:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-03-14 01:16:52,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8318840579710145 [2025-03-14 01:16:52,200 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 278 flow. Second operand 3 states and 287 transitions. [2025-03-14 01:16:52,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 119 transitions, 393 flow [2025-03-14 01:16:52,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 119 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:52,207 INFO L231 Difference]: Finished difference. Result has 101 places, 110 transitions, 314 flow [2025-03-14 01:16:52,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=101, PETRI_TRANSITIONS=110} [2025-03-14 01:16:52,209 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places. [2025-03-14 01:16:52,209 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 110 transitions, 314 flow [2025-03-14 01:16:52,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:52,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:52,210 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-03-14 01:16:52,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:16:52,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:16:52,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1283942368, now seen corresponding path program 1 times [2025-03-14 01:16:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361650188] [2025-03-14 01:16:52,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:52,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:16:52,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:16:52,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:52,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:16:52,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361650188] [2025-03-14 01:16:52,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361650188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:52,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:16:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789331946] [2025-03-14 01:16:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:52,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:52,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:52,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:52,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 115 [2025-03-14 01:16:52,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 110 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:52,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:52,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 115 [2025-03-14 01:16:52,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:52,429 INFO L124 PetriNetUnfolderBase]: 298/1095 cut-off events. [2025-03-14 01:16:52,429 INFO L125 PetriNetUnfolderBase]: For 251/255 co-relation queries the response was YES. [2025-03-14 01:16:52,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 1095 events. 298/1095 cut-off events. For 251/255 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7463 event pairs, 89 based on Foata normal form. 8/984 useless extension candidates. Maximal degree in co-relation 1970. Up to 325 conditions per place. [2025-03-14 01:16:52,434 INFO L140 encePairwiseOnDemand]: 105/115 looper letters, 32 selfloop transitions, 5 changer transitions 1/121 dead transitions. [2025-03-14 01:16:52,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 121 transitions, 414 flow [2025-03-14 01:16:52,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-14 01:16:52,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289855072463768 [2025-03-14 01:16:52,435 INFO L175 Difference]: Start difference. First operand has 101 places, 110 transitions, 314 flow. Second operand 3 states and 286 transitions. [2025-03-14 01:16:52,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 121 transitions, 414 flow [2025-03-14 01:16:52,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 121 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:52,438 INFO L231 Difference]: Finished difference. Result has 103 places, 114 transitions, 346 flow [2025-03-14 01:16:52,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=103, PETRI_TRANSITIONS=114} [2025-03-14 01:16:52,439 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 6 predicate places. [2025-03-14 01:16:52,439 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 114 transitions, 346 flow [2025-03-14 01:16:52,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:52,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:52,439 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-03-14 01:16:52,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:16:52,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:16:52,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:52,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2091437634, now seen corresponding path program 2 times [2025-03-14 01:16:52,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:52,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448999253] [2025-03-14 01:16:52,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:16:52,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:52,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:16:52,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:16:52,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:16:52,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:16:52,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:52,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448999253] [2025-03-14 01:16:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448999253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:52,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:52,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:16:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969130123] [2025-03-14 01:16:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:52,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:52,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:52,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:52,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:52,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2025-03-14 01:16:52,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 114 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:52,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:52,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2025-03-14 01:16:52,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:52,662 INFO L124 PetriNetUnfolderBase]: 443/1720 cut-off events. [2025-03-14 01:16:52,662 INFO L125 PetriNetUnfolderBase]: For 575/647 co-relation queries the response was YES. [2025-03-14 01:16:52,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 1720 events. 443/1720 cut-off events. For 575/647 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14183 event pairs, 77 based on Foata normal form. 18/1527 useless extension candidates. Maximal degree in co-relation 3282. Up to 284 conditions per place. [2025-03-14 01:16:52,669 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 39 selfloop transitions, 3 changer transitions 0/132 dead transitions. [2025-03-14 01:16:52,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 132 transitions, 489 flow [2025-03-14 01:16:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2025-03-14 01:16:52,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-03-14 01:16:52,671 INFO L175 Difference]: Start difference. First operand has 103 places, 114 transitions, 346 flow. Second operand 3 states and 299 transitions. [2025-03-14 01:16:52,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 132 transitions, 489 flow [2025-03-14 01:16:52,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 132 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:52,676 INFO L231 Difference]: Finished difference. Result has 105 places, 117 transitions, 364 flow [2025-03-14 01:16:52,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=105, PETRI_TRANSITIONS=117} [2025-03-14 01:16:52,677 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 8 predicate places. [2025-03-14 01:16:52,678 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 117 transitions, 364 flow [2025-03-14 01:16:52,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:52,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:52,678 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-03-14 01:16:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:16:52,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:16:52,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1482186316, now seen corresponding path program 3 times [2025-03-14 01:16:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704946718] [2025-03-14 01:16:52,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:16:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:52,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:16:52,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:16:52,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:16:52,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:16:52,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:52,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704946718] [2025-03-14 01:16:52,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704946718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:52,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:16:52,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815899805] [2025-03-14 01:16:52,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:52,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:52,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:52,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:52,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 115 [2025-03-14 01:16:52,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 117 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:52,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:52,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 115 [2025-03-14 01:16:52,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:52,903 INFO L124 PetriNetUnfolderBase]: 434/1826 cut-off events. [2025-03-14 01:16:52,903 INFO L125 PetriNetUnfolderBase]: For 595/649 co-relation queries the response was YES. [2025-03-14 01:16:52,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3592 conditions, 1826 events. 434/1826 cut-off events. For 595/649 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15475 event pairs, 132 based on Foata normal form. 35/1691 useless extension candidates. Maximal degree in co-relation 3583. Up to 508 conditions per place. [2025-03-14 01:16:52,911 INFO L140 encePairwiseOnDemand]: 105/115 looper letters, 32 selfloop transitions, 5 changer transitions 8/129 dead transitions. [2025-03-14 01:16:52,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 129 transitions, 493 flow [2025-03-14 01:16:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-14 01:16:52,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289855072463768 [2025-03-14 01:16:52,913 INFO L175 Difference]: Start difference. First operand has 105 places, 117 transitions, 364 flow. Second operand 3 states and 286 transitions. [2025-03-14 01:16:52,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 129 transitions, 493 flow [2025-03-14 01:16:52,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 129 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:52,916 INFO L231 Difference]: Finished difference. Result has 107 places, 115 transitions, 382 flow [2025-03-14 01:16:52,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=107, PETRI_TRANSITIONS=115} [2025-03-14 01:16:52,916 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 10 predicate places. [2025-03-14 01:16:52,916 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 115 transitions, 382 flow [2025-03-14 01:16:52,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:52,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:52,917 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-03-14 01:16:52,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:16:52,917 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:16:52,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:52,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1319768152, now seen corresponding path program 4 times [2025-03-14 01:16:52,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:52,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405477671] [2025-03-14 01:16:52,918 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:16:52,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:52,923 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-14 01:16:52,926 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 45 of 46 statements. [2025-03-14 01:16:52,927 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:16:52,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:16:52,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405477671] [2025-03-14 01:16:52,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405477671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:52,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:52,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:16:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804999117] [2025-03-14 01:16:52,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:52,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:52,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:52,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:52,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:52,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2025-03-14 01:16:52,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 115 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:52,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:52,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2025-03-14 01:16:52,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:53,106 INFO L124 PetriNetUnfolderBase]: 325/1618 cut-off events. [2025-03-14 01:16:53,107 INFO L125 PetriNetUnfolderBase]: For 865/950 co-relation queries the response was YES. [2025-03-14 01:16:53,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 1618 events. 325/1618 cut-off events. For 865/950 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 14017 event pairs, 65 based on Foata normal form. 31/1493 useless extension candidates. Maximal degree in co-relation 3309. Up to 234 conditions per place. [2025-03-14 01:16:53,113 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 42 selfloop transitions, 3 changer transitions 4/132 dead transitions. [2025-03-14 01:16:53,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 132 transitions, 549 flow [2025-03-14 01:16:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-03-14 01:16:53,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863768115942029 [2025-03-14 01:16:53,116 INFO L175 Difference]: Start difference. First operand has 107 places, 115 transitions, 382 flow. Second operand 3 states and 298 transitions. [2025-03-14 01:16:53,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 132 transitions, 549 flow [2025-03-14 01:16:53,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 132 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:53,119 INFO L231 Difference]: Finished difference. Result has 109 places, 112 transitions, 382 flow [2025-03-14 01:16:53,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=109, PETRI_TRANSITIONS=112} [2025-03-14 01:16:53,120 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 12 predicate places. [2025-03-14 01:16:53,120 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 112 transitions, 382 flow [2025-03-14 01:16:53,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:53,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:53,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:53,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:16:53,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:16:53,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1097290065, now seen corresponding path program 1 times [2025-03-14 01:16:53,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:53,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628514894] [2025-03-14 01:16:53,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:53,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:53,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:16:53,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:16:53,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:53,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:16:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628514894] [2025-03-14 01:16:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628514894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:53,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:53,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:16:53,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657358553] [2025-03-14 01:16:53,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:53,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:53,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:53,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:53,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:53,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2025-03-14 01:16:53,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 112 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:53,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:53,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2025-03-14 01:16:53,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:53,261 INFO L124 PetriNetUnfolderBase]: 235/1151 cut-off events. [2025-03-14 01:16:53,261 INFO L125 PetriNetUnfolderBase]: For 527/567 co-relation queries the response was YES. [2025-03-14 01:16:53,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2359 conditions, 1151 events. 235/1151 cut-off events. For 527/567 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8752 event pairs, 40 based on Foata normal form. 7/1065 useless extension candidates. Maximal degree in co-relation 2348. Up to 197 conditions per place. [2025-03-14 01:16:53,265 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 33 selfloop transitions, 4 changer transitions 8/127 dead transitions. [2025-03-14 01:16:53,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 127 transitions, 533 flow [2025-03-14 01:16:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2025-03-14 01:16:53,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8608695652173913 [2025-03-14 01:16:53,266 INFO L175 Difference]: Start difference. First operand has 109 places, 112 transitions, 382 flow. Second operand 3 states and 297 transitions. [2025-03-14 01:16:53,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 127 transitions, 533 flow [2025-03-14 01:16:53,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 127 transitions, 513 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:53,271 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 372 flow [2025-03-14 01:16:53,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=108, PETRI_TRANSITIONS=108} [2025-03-14 01:16:53,272 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 11 predicate places. [2025-03-14 01:16:53,272 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 372 flow [2025-03-14 01:16:53,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:53,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:53,272 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-03-14 01:16:53,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:16:53,272 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:16:53,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2111792943, now seen corresponding path program 1 times [2025-03-14 01:16:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:53,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778711864] [2025-03-14 01:16:53,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:53,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:53,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:16:53,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:16:53,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:53,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:16:53,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778711864] [2025-03-14 01:16:53,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778711864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:53,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:16:53,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273479718] [2025-03-14 01:16:53,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:53,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:53,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:53,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:16:53,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2025-03-14 01:16:53,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 108 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:53,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:53,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2025-03-14 01:16:53,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:53,397 INFO L124 PetriNetUnfolderBase]: 160/758 cut-off events. [2025-03-14 01:16:53,398 INFO L125 PetriNetUnfolderBase]: For 411/434 co-relation queries the response was YES. [2025-03-14 01:16:53,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 758 events. 160/758 cut-off events. For 411/434 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4819 event pairs, 38 based on Foata normal form. 8/722 useless extension candidates. Maximal degree in co-relation 1648. Up to 162 conditions per place. [2025-03-14 01:16:53,400 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 0 selfloop transitions, 0 changer transitions 107/107 dead transitions. [2025-03-14 01:16:53,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 107 transitions, 444 flow [2025-03-14 01:16:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2025-03-14 01:16:53,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8521739130434782 [2025-03-14 01:16:53,401 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 372 flow. Second operand 3 states and 294 transitions. [2025-03-14 01:16:53,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 107 transitions, 444 flow [2025-03-14 01:16:53,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 406 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:53,405 INFO L231 Difference]: Finished difference. Result has 98 places, 0 transitions, 0 flow [2025-03-14 01:16:53,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=98, PETRI_TRANSITIONS=0} [2025-03-14 01:16:53,406 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2025-03-14 01:16:53,407 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 0 transitions, 0 flow [2025-03-14 01:16:53,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:53,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2025-03-14 01:16:53,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-14 01:16:53,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-14 01:16:53,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-14 01:16:53,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2025-03-14 01:16:53,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2025-03-14 01:16:53,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-14 01:16:53,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-14 01:16:53,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-14 01:16:53,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-14 01:16:53,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:16:53,409 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:53,413 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:16:53,413 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:16:53,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:16:53 BasicIcfg [2025-03-14 01:16:53,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:16:53,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:16:53,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:16:53,416 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:16:53,417 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:16:51" (3/4) ... [2025-03-14 01:16:53,418 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:16:53,420 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-03-14 01:16:53,420 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-03-14 01:16:53,422 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-14 01:16:53,422 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:16:53,422 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:16:53,422 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:16:53,474 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:16:53,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:16:53,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:16:53,476 INFO L158 Benchmark]: Toolchain (without parser) took 3178.46ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 75.7MB in the end (delta: 44.8MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-03-14 01:16:53,476 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:16:53,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.59ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 100.7MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:16:53,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.62ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 98.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:16:53,476 INFO L158 Benchmark]: Boogie Preprocessor took 15.69ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 97.8MB in the end (delta: 912.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:16:53,477 INFO L158 Benchmark]: IcfgBuilder took 322.87ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 82.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:16:53,477 INFO L158 Benchmark]: TraceAbstraction took 2397.99ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 80.8MB in the end (delta: 795.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:16:53,477 INFO L158 Benchmark]: Witness Printer took 58.74ms. Allocated memory is still 167.8MB. Free memory was 80.8MB in the beginning and 75.7MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:16:53,478 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.14ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.59ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 100.7MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.62ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 98.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.69ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 97.8MB in the end (delta: 912.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 322.87ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 82.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2397.99ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 80.8MB in the end (delta: 795.3kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 58.74ms. Allocated memory is still 167.8MB. Free memory was 80.8MB in the beginning and 75.7MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 780]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 781]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 754]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 755]: 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, 164 locations, 10 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.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 516 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 25 mSDtfsCounter, 516 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=7, InterpolantAutomatonStates: 29, 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, 406 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:16:53,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE