/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:10:54,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:10:54,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:10:54,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:10:54,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:10:54,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:10:54,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:10:54,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:10:54,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:10:54,841 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:10:54,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:10:54,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:10:54,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:10:54,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:10:54,842 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:10:54,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:10:54,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:10:54,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:10:54,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:10:54,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:10:54,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:10:54,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:54,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:54,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:54,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:54,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:10:54,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:10:54,844 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:10:54,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:10:54,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:10:54,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:10:54,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:10:54,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:10:54,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:10:54,844 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:10:55,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:10:55,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:10:55,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:10:55,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:10:55,096 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:10:55,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_tso.i [2025-04-14 00:10:56,455 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33f97bc8/8f393e0c5f044ef2a80a9927352bdf2f/FLAG56f9df361 [2025-04-14 00:10:56,735 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:10:56,736 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_tso.i [2025-04-14 00:10:56,751 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33f97bc8/8f393e0c5f044ef2a80a9927352bdf2f/FLAG56f9df361 [2025-04-14 00:10:57,457 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33f97bc8/8f393e0c5f044ef2a80a9927352bdf2f [2025-04-14 00:10:57,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:10:57,460 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:10:57,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:57,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:10:57,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:10:57,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:57" (1/1) ... [2025-04-14 00:10:57,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db589ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:57, skipping insertion in model container [2025-04-14 00:10:57,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:57" (1/1) ... [2025-04-14 00:10:57,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:10:57,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_tso.i[945,958] [2025-04-14 00:10:57,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:57,936 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:10:57,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_tso.i[945,958] [2025-04-14 00:10:57,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:58,021 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:10:58,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58 WrapperNode [2025-04-14 00:10:58,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:58,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:58,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:10:58,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:10:58,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,056 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-14 00:10:58,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:58,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:10:58,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:10:58,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:10:58,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,074 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:10:58,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:10:58,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:10:58,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:10:58,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:10:58,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:58,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:10:58,117 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-04-14 00:10:58,124 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-04-14 00:10:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:10:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:10:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:10:58,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:10:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:10:58,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:10:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:10:58,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:10:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:10:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:10:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:10:58,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:10:58,141 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:10:58,242 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:10:58,244 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:10:58,363 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:10:58,364 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:10:58,364 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:10:58,479 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:10:58,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:58 BoogieIcfgContainer [2025-04-14 00:10:58,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:10:58,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:10:58,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:10:58,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:10:58,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:10:57" (1/3) ... [2025-04-14 00:10:58,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37968b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:58, skipping insertion in model container [2025-04-14 00:10:58,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (2/3) ... [2025-04-14 00:10:58,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37968b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:58, skipping insertion in model container [2025-04-14 00:10:58,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:58" (3/3) ... [2025-04-14 00:10:58,489 INFO L128 eAbstractionObserver]: Analyzing ICFG safe034_tso.i [2025-04-14 00:10:58,499 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:10:58,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe034_tso.i that has 4 procedures, 37 locations, 33 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:10:58,500 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:10:58,542 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:10:58,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 84 flow [2025-04-14 00:10:58,594 INFO L116 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-04-14 00:10:58,597 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:58,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:10:58,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 36 transitions, 84 flow [2025-04-14 00:10:58,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2025-04-14 00:10:58,607 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:10:58,618 INFO L340 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;@5336e11e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:10:58,619 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:10:58,627 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:10:58,627 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-14 00:10:58,627 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:58,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:58,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:58,628 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:10:58,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash 646113119, now seen corresponding path program 1 times [2025-04-14 00:10:58,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:58,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100297731] [2025-04-14 00:10:58,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:58,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:58,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:10:58,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:10:58,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:59,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:59,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100297731] [2025-04-14 00:10:59,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100297731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:59,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:59,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582142509] [2025-04-14 00:10:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:59,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:59,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:59,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:59,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:59,106 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:59,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-04-14 00:10:59,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:59,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:59,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:59,687 INFO L116 PetriNetUnfolderBase]: 4185/6161 cut-off events. [2025-04-14 00:10:59,687 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-14 00:10:59,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12430 conditions, 6161 events. 4185/6161 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 32408 event pairs, 818 based on Foata normal form. 294/6448 useless extension candidates. Maximal degree in co-relation 12419. Up to 3216 conditions per place. [2025-04-14 00:10:59,725 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 60 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2025-04-14 00:10:59,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 285 flow [2025-04-14 00:10:59,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:10:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:10:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-14 00:10:59,736 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-04-14 00:10:59,737 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 4 states and 92 transitions. [2025-04-14 00:10:59,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 285 flow [2025-04-14 00:10:59,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:10:59,747 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 104 flow [2025-04-14 00:10:59,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-04-14 00:10:59,752 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2025-04-14 00:10:59,752 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 104 flow [2025-04-14 00:10:59,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-04-14 00:10:59,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:59,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:59,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:10:59,754 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:10:59,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:59,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1416853903, now seen corresponding path program 1 times [2025-04-14 00:10:59,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:59,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027301764] [2025-04-14 00:10:59,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:59,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:10:59,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:10:59,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:59,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:59,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:59,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027301764] [2025-04-14 00:10:59,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027301764] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:59,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:59,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:59,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260012807] [2025-04-14 00:10:59,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:59,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:59,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:59,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:59,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:59,920 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:59,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-04-14 00:10:59,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:59,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:59,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:00,314 INFO L116 PetriNetUnfolderBase]: 2390/3616 cut-off events. [2025-04-14 00:11:00,315 INFO L117 PetriNetUnfolderBase]: For 715/715 co-relation queries the response was YES. [2025-04-14 00:11:00,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8433 conditions, 3616 events. 2390/3616 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 17434 event pairs, 536 based on Foata normal form. 194/3803 useless extension candidates. Maximal degree in co-relation 8421. Up to 1317 conditions per place. [2025-04-14 00:11:00,337 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 77 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2025-04-14 00:11:00,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 89 transitions, 405 flow [2025-04-14 00:11:00,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-04-14 00:11:00,339 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2025-04-14 00:11:00,339 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 104 flow. Second operand 5 states and 118 transitions. [2025-04-14 00:11:00,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 89 transitions, 405 flow [2025-04-14 00:11:00,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 89 transitions, 395 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:00,345 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 144 flow [2025-04-14 00:11:00,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-04-14 00:11:00,346 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2025-04-14 00:11:00,346 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 144 flow [2025-04-14 00:11:00,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-04-14 00:11:00,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:00,346 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] [2025-04-14 00:11:00,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:11:00,346 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:11:00,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 783835356, now seen corresponding path program 1 times [2025-04-14 00:11:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:00,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146390921] [2025-04-14 00:11:00,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:00,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:11:00,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:11:00,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:00,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:00,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:00,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146390921] [2025-04-14 00:11:00,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146390921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:00,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:00,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966731201] [2025-04-14 00:11:00,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:00,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:11:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:00,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:11:00,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:11:00,552 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:11:00,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-04-14 00:11:00,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:00,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:11:00,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:00,822 INFO L116 PetriNetUnfolderBase]: 1561/2377 cut-off events. [2025-04-14 00:11:00,822 INFO L117 PetriNetUnfolderBase]: For 1362/1362 co-relation queries the response was YES. [2025-04-14 00:11:00,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5905 conditions, 2377 events. 1561/2377 cut-off events. For 1362/1362 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10791 event pairs, 487 based on Foata normal form. 64/2434 useless extension candidates. Maximal degree in co-relation 5891. Up to 918 conditions per place. [2025-04-14 00:11:00,837 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 64 selfloop transitions, 11 changer transitions 1/79 dead transitions. [2025-04-14 00:11:00,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 388 flow [2025-04-14 00:11:00,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-04-14 00:11:00,841 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-04-14 00:11:00,842 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 144 flow. Second operand 6 states and 114 transitions. [2025-04-14 00:11:00,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 388 flow [2025-04-14 00:11:00,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 363 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:11:00,854 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 158 flow [2025-04-14 00:11:00,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-04-14 00:11:00,855 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2025-04-14 00:11:00,855 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 158 flow [2025-04-14 00:11:00,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-04-14 00:11:00,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:00,855 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] [2025-04-14 00:11:00,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:11:00,855 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:11:00,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash 407850095, now seen corresponding path program 1 times [2025-04-14 00:11:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:00,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973838416] [2025-04-14 00:11:00,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:00,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:00,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:11:00,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:11:00,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:00,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:00,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:00,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973838416] [2025-04-14 00:11:01,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973838416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:01,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:01,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:01,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031735156] [2025-04-14 00:11:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:01,000 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:11:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:01,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:11:01,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:11:01,001 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:11:01,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-04-14 00:11:01,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:01,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:11:01,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:01,393 INFO L116 PetriNetUnfolderBase]: 2885/4397 cut-off events. [2025-04-14 00:11:01,393 INFO L117 PetriNetUnfolderBase]: For 3256/3256 co-relation queries the response was YES. [2025-04-14 00:11:01,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11242 conditions, 4397 events. 2885/4397 cut-off events. For 3256/3256 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 22650 event pairs, 121 based on Foata normal form. 16/4413 useless extension candidates. Maximal degree in co-relation 11227. Up to 1800 conditions per place. [2025-04-14 00:11:01,408 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 69 selfloop transitions, 8 changer transitions 53/133 dead transitions. [2025-04-14 00:11:01,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 133 transitions, 810 flow [2025-04-14 00:11:01,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:11:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:11:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2025-04-14 00:11:01,411 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2025-04-14 00:11:01,411 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 158 flow. Second operand 8 states and 158 transitions. [2025-04-14 00:11:01,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 133 transitions, 810 flow [2025-04-14 00:11:01,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 133 transitions, 616 flow, removed 30 selfloop flow, removed 8 redundant places. [2025-04-14 00:11:01,429 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 157 flow [2025-04-14 00:11:01,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=157, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2025-04-14 00:11:01,429 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2025-04-14 00:11:01,429 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 157 flow [2025-04-14 00:11:01,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-04-14 00:11:01,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:01,430 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] [2025-04-14 00:11:01,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:11:01,430 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:11:01,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash -376901671, now seen corresponding path program 2 times [2025-04-14 00:11:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:01,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394905490] [2025-04-14 00:11:01,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:01,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:11:01,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:11:01,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:01,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:01,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:01,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394905490] [2025-04-14 00:11:01,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394905490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:01,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:01,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:11:01,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521808461] [2025-04-14 00:11:01,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:01,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:01,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:01,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:01,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:01,585 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:11:01,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-04-14 00:11:01,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:01,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:11:01,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:01,822 INFO L116 PetriNetUnfolderBase]: 2035/3220 cut-off events. [2025-04-14 00:11:01,822 INFO L117 PetriNetUnfolderBase]: For 1102/1102 co-relation queries the response was YES. [2025-04-14 00:11:01,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7897 conditions, 3220 events. 2035/3220 cut-off events. For 1102/1102 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16088 event pairs, 346 based on Foata normal form. 8/3227 useless extension candidates. Maximal degree in co-relation 7888. Up to 2073 conditions per place. [2025-04-14 00:11:01,834 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 0 selfloop transitions, 0 changer transitions 85/85 dead transitions. [2025-04-14 00:11:01,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 451 flow [2025-04-14 00:11:01,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2025-04-14 00:11:01,835 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2025-04-14 00:11:01,835 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 157 flow. Second operand 6 states and 106 transitions. [2025-04-14 00:11:01,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 451 flow [2025-04-14 00:11:01,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 449 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:11:01,839 INFO L231 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2025-04-14 00:11:01,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2025-04-14 00:11:01,840 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2025-04-14 00:11:01,840 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2025-04-14 00:11:01,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-04-14 00:11:01,845 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:11:01,846 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:11:01,846 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:11:01,846 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:11:01,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:11:01,846 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-04-14 00:11:01,852 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:11:01,852 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:11:01,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:11:01 BasicIcfg [2025-04-14 00:11:01,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:11:01,859 INFO L158 Benchmark]: Toolchain (without parser) took 4400.00ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 98.7MB in the beginning and 208.6MB in the end (delta: -109.9MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2025-04-14 00:11:01,860 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:01,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.88ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 75.1MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:01,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.00ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 73.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:01,860 INFO L158 Benchmark]: Boogie Preprocessor took 26.25ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 70.9MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:01,860 INFO L158 Benchmark]: IcfgBuilder took 394.59ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 47.9MB in the end (delta: 23.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 00:11:01,860 INFO L158 Benchmark]: TraceAbstraction took 3377.94ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 47.2MB in the beginning and 208.6MB in the end (delta: -161.4MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2025-04-14 00:11:01,861 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 561.88ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 75.1MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.00ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 73.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.25ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 70.9MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 394.59ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 47.9MB in the end (delta: 23.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3377.94ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 47.2MB in the beginning and 208.6MB in the end (delta: -161.4MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 63 locations, 59 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 692 IncrementalHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 0 mSDtfsCounter, 692 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=3, 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.9s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:11:01,877 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...