./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/loop-simple/nested_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d0f32d2f39934bb8fd732fa206acfa5d2fb4cacaee37919c0e4326d55891c86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:59:20,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:59:20,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:59:20,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:59:20,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:59:20,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:59:20,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:59:20,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:59:20,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:59:20,167 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:59:20,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:59:20,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:59:20,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:59:20,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:59:20,168 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:59:20,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:59:20,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:59:20,168 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:59:20,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:59:20,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:59:20,169 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:59:20,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:59:20,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:59:20,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:59:20,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:59:20,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:59:20,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:59:20,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:59:20,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:59:20,170 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 ! call(reach_error())) ) 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 -> 3d0f32d2f39934bb8fd732fa206acfa5d2fb4cacaee37919c0e4326d55891c86 [2025-03-16 17:59:20,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:59:20,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:59:20,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:59:20,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:59:20,376 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:59:20,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_5.c [2025-03-16 17:59:21,440 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efcd511a8/648b9b370ecd4e1d93301a70a39b7682/FLAG785163ec5 [2025-03-16 17:59:21,621 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:59:21,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c [2025-03-16 17:59:21,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efcd511a8/648b9b370ecd4e1d93301a70a39b7682/FLAG785163ec5 [2025-03-16 17:59:22,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efcd511a8/648b9b370ecd4e1d93301a70a39b7682 [2025-03-16 17:59:22,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:59:22,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:59:22,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:59:22,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:59:22,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:59:22,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6174b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22, skipping insertion in model container [2025-03-16 17:59:22,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:59:22,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c[899,912] [2025-03-16 17:59:22,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:59:22,136 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:59:22,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c[899,912] [2025-03-16 17:59:22,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:59:22,155 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:59:22,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22 WrapperNode [2025-03-16 17:59:22,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:59:22,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:59:22,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:59:22,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:59:22,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,176 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-03-16 17:59:22,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:59:22,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:59:22,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:59:22,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:59:22,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,191 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-03-16 17:59:22,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:59:22,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:59:22,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:59:22,199 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:59:22,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (1/1) ... [2025-03-16 17:59:22,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:59:22,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:22,222 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-16 17:59:22,225 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-16 17:59:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:59:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:59:22,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:59:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:59:22,281 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:59:22,282 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:59:22,386 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 17:59:22,387 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:59:22,395 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:59:22,396 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:59:22,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:59:22 BoogieIcfgContainer [2025-03-16 17:59:22,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:59:22,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:59:22,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:59:22,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:59:22,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:59:22" (1/3) ... [2025-03-16 17:59:22,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182bb605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:59:22, skipping insertion in model container [2025-03-16 17:59:22,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:22" (2/3) ... [2025-03-16 17:59:22,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182bb605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:59:22, skipping insertion in model container [2025-03-16 17:59:22,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:59:22" (3/3) ... [2025-03-16 17:59:22,405 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_5.c [2025-03-16 17:59:22,417 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:59:22,418 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_5.c that has 1 procedures, 12 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-16 17:59:22,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:59:22,467 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;@68820850, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:59:22,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:59:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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-16 17:59:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 17:59:22,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:22,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 17:59:22,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:22,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1383935, now seen corresponding path program 1 times [2025-03-16 17:59:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:22,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551908838] [2025-03-16 17:59:22,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:59:22,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:22,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 17:59:22,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 17:59:22,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:22,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:22,596 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-16 17:59:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551908838] [2025-03-16 17:59:22,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551908838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:59:22,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:59:22,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:59:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637076755] [2025-03-16 17:59:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:59:22,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:59:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:22,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:59:22,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:22,613 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 17:59:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:22,640 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2025-03-16 17:59:22,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:59:22,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2025-03-16 17:59:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:22,645 INFO L225 Difference]: With dead ends: 23 [2025-03-16 17:59:22,645 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 17:59:22,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:22,648 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:22,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 23 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 17:59:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2025-03-16 17:59:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-16 17:59:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-16 17:59:22,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 4 [2025-03-16 17:59:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:22,664 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-16 17:59:22,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 17:59:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2025-03-16 17:59:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 17:59:22,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:22,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 17:59:22,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:59:22,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:22,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1329109223, now seen corresponding path program 1 times [2025-03-16 17:59:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:22,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16517227] [2025-03-16 17:59:22,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:59:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:22,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:59:22,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:59:22,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:22,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16517227] [2025-03-16 17:59:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16517227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:59:22,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:59:22,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:59:22,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522433333] [2025-03-16 17:59:22,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:59:22,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:59:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:22,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:59:22,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:22,711 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-16 17:59:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:22,724 INFO L93 Difference]: Finished difference Result 22 states and 34 transitions. [2025-03-16 17:59:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:59:22,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-03-16 17:59:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:22,726 INFO L225 Difference]: With dead ends: 22 [2025-03-16 17:59:22,726 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 17:59:22,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:22,727 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:22,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 17:59:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2025-03-16 17:59:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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-16 17:59:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-03-16 17:59:22,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 6 [2025-03-16 17:59:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:22,729 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-16 17:59:22,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-16 17:59:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2025-03-16 17:59:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 17:59:22,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:22,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:59:22,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:59:22,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:22,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1861763489, now seen corresponding path program 1 times [2025-03-16 17:59:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:22,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379851436] [2025-03-16 17:59:22,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:59:22,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:22,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 17:59:22,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 17:59:22,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:22,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379851436] [2025-03-16 17:59:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379851436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:59:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:59:22,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:59:22,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534740137] [2025-03-16 17:59:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:59:22,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:59:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:22,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:59:22,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:22,772 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-16 17:59:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:22,783 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2025-03-16 17:59:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:59:22,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-03-16 17:59:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:22,784 INFO L225 Difference]: With dead ends: 23 [2025-03-16 17:59:22,784 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 17:59:22,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:22,784 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:22,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:22,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 17:59:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2025-03-16 17:59:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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-16 17:59:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-03-16 17:59:22,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2025-03-16 17:59:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:22,787 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-16 17:59:22,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-16 17:59:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2025-03-16 17:59:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 17:59:22,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:22,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:59:22,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:59:22,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:22,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1654157051, now seen corresponding path program 1 times [2025-03-16 17:59:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:22,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212613385] [2025-03-16 17:59:22,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:59:22,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:22,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 17:59:22,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 17:59:22,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:22,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:22,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:22,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212613385] [2025-03-16 17:59:22,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212613385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:59:22,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:59:22,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:59:22,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767741547] [2025-03-16 17:59:22,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:59:22,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:59:22,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:22,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:59:22,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:22,819 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-16 17:59:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:22,833 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2025-03-16 17:59:22,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:59:22,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2025-03-16 17:59:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:22,833 INFO L225 Difference]: With dead ends: 24 [2025-03-16 17:59:22,833 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 17:59:22,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:22,834 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:22,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 17:59:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-16 17:59:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-16 17:59:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-03-16 17:59:22,838 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2025-03-16 17:59:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:22,838 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-16 17:59:22,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-16 17:59:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-03-16 17:59:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 17:59:22,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:22,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:59:22,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:59:22,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:22,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2043581373, now seen corresponding path program 1 times [2025-03-16 17:59:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:22,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169378056] [2025-03-16 17:59:22,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:59:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:22,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 17:59:22,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 17:59:22,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:22,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169378056] [2025-03-16 17:59:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169378056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:59:22,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:59:22,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:59:22,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148478473] [2025-03-16 17:59:22,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:59:22,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:59:22,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:22,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:59:22,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:22,881 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 17:59:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:22,889 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2025-03-16 17:59:22,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:59:22,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2025-03-16 17:59:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:22,890 INFO L225 Difference]: With dead ends: 25 [2025-03-16 17:59:22,890 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 17:59:22,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:22,891 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:22,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 17:59:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-16 17:59:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-16 17:59:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-03-16 17:59:22,893 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 12 [2025-03-16 17:59:22,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:22,893 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-16 17:59:22,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 17:59:22,893 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2025-03-16 17:59:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 17:59:22,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:22,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:59:22,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:59:22,894 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:22,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash -561871246, now seen corresponding path program 1 times [2025-03-16 17:59:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:22,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775177894] [2025-03-16 17:59:22,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:59:22,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:22,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 17:59:22,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 17:59:22,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:22,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775177894] [2025-03-16 17:59:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775177894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:59:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274024971] [2025-03-16 17:59:22,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:59:22,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:22,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:59:22,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:59:22,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 17:59:23,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 17:59:23,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:23,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:23,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 17:59:23,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:59:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:23,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:59:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:23,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274024971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:59:23,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:59:23,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 17:59:23,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527692845] [2025-03-16 17:59:23,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:59:23,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:59:23,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:23,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:59:23,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:59:23,056 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-16 17:59:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:23,068 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2025-03-16 17:59:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:59:23,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) Word has length 13 [2025-03-16 17:59:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:23,069 INFO L225 Difference]: With dead ends: 29 [2025-03-16 17:59:23,069 INFO L226 Difference]: Without dead ends: 17 [2025-03-16 17:59:23,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:59:23,070 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:23,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-16 17:59:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-16 17:59:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-16 17:59:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-16 17:59:23,072 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2025-03-16 17:59:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:23,072 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-16 17:59:23,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-16 17:59:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-03-16 17:59:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 17:59:23,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:23,072 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:59:23,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:59:23,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 17:59:23,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:23,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1631715325, now seen corresponding path program 2 times [2025-03-16 17:59:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:23,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679525303] [2025-03-16 17:59:23,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:59:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:23,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-16 17:59:23,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 17:59:23,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:59:23,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 17:59:23,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:23,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679525303] [2025-03-16 17:59:23,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679525303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:59:23,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964422381] [2025-03-16 17:59:23,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:59:23,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:23,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:23,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:59:23,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:59:23,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-16 17:59:23,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 17:59:23,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:59:23,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:23,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:59:23,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:59:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:23,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:59:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:23,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964422381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:59:23,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:59:23,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2025-03-16 17:59:23,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691835150] [2025-03-16 17:59:23,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:59:23,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:59:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:23,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:59:23,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:59:23,460 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-16 17:59:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:23,581 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2025-03-16 17:59:23,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 17:59:23,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) Word has length 16 [2025-03-16 17:59:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:23,582 INFO L225 Difference]: With dead ends: 49 [2025-03-16 17:59:23,582 INFO L226 Difference]: Without dead ends: 34 [2025-03-16 17:59:23,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2025-03-16 17:59:23,584 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:23,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 32 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-16 17:59:23,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2025-03-16 17:59:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-16 17:59:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-03-16 17:59:23,589 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2025-03-16 17:59:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:23,589 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-16 17:59:23,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-16 17:59:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-03-16 17:59:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 17:59:23,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:23,591 INFO L218 NwaCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:59:23,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:59:23,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-16 17:59:23,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:23,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2013486273, now seen corresponding path program 3 times [2025-03-16 17:59:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:23,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153850034] [2025-03-16 17:59:23,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:59:23,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:23,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 12 equivalence classes. [2025-03-16 17:59:23,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 6 of 26 statements. [2025-03-16 17:59:23,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 17:59:23,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 17:59:23,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153850034] [2025-03-16 17:59:23,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153850034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:59:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764872441] [2025-03-16 17:59:23,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:59:23,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:23,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:23,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:59:23,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:59:23,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 12 equivalence classes. [2025-03-16 17:59:23,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 6 of 26 statements. [2025-03-16 17:59:23,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 17:59:23,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:23,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 17:59:23,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:59:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 17:59:23,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:59:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 17:59:23,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764872441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:59:23,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:59:23,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-16 17:59:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126355725] [2025-03-16 17:59:23,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:59:23,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:59:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:23,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:59:23,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:59:23,944 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-16 17:59:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:23,973 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2025-03-16 17:59:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:59:23,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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) Word has length 26 [2025-03-16 17:59:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:23,974 INFO L225 Difference]: With dead ends: 96 [2025-03-16 17:59:23,974 INFO L226 Difference]: Without dead ends: 93 [2025-03-16 17:59:23,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:59:23,976 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:23,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 35 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-16 17:59:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-16 17:59:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 92 states have internal predecessors, (113), 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-16 17:59:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2025-03-16 17:59:23,987 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 26 [2025-03-16 17:59:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:23,987 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2025-03-16 17:59:23,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-16 17:59:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2025-03-16 17:59:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 17:59:23,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:23,989 INFO L218 NwaCegarLoop]: trace histogram [48, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-16 17:59:23,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 17:59:24,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:24,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:24,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1997039623, now seen corresponding path program 4 times [2025-03-16 17:59:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:24,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705580844] [2025-03-16 17:59:24,190 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:59:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:24,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 92 statements into 2 equivalence classes. [2025-03-16 17:59:24,202 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 91 of 92 statements. [2025-03-16 17:59:24,202 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 17:59:24,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 638 proven. 1 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2025-03-16 17:59:24,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705580844] [2025-03-16 17:59:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705580844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:59:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434773347] [2025-03-16 17:59:24,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:59:24,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:24,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:24,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:59:24,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:59:24,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 92 statements into 2 equivalence classes. [2025-03-16 17:59:24,326 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 91 of 92 statements. [2025-03-16 17:59:24,326 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 17:59:24,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:24,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:59:24,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:59:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 633 proven. 52 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2025-03-16 17:59:24,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:59:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 633 proven. 52 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2025-03-16 17:59:24,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434773347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:59:24,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:59:24,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-16 17:59:24,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715894784] [2025-03-16 17:59:24,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:59:24,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:59:24,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:24,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:59:24,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:59:24,419 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-16 17:59:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:24,596 INFO L93 Difference]: Finished difference Result 707 states and 871 transitions. [2025-03-16 17:59:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 17:59:24,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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) Word has length 92 [2025-03-16 17:59:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:24,599 INFO L225 Difference]: With dead ends: 707 [2025-03-16 17:59:24,599 INFO L226 Difference]: Without dead ends: 617 [2025-03-16 17:59:24,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2025-03-16 17:59:24,600 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:24,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 36 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-16 17:59:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 421. [2025-03-16 17:59:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.1547619047619047) internal successors, (485), 420 states have internal predecessors, (485), 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-16 17:59:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 485 transitions. [2025-03-16 17:59:24,648 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 485 transitions. Word has length 92 [2025-03-16 17:59:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:24,648 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 485 transitions. [2025-03-16 17:59:24,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-16 17:59:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 485 transitions. [2025-03-16 17:59:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-16 17:59:24,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:24,659 INFO L218 NwaCegarLoop]: trace histogram [288, 48, 48, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-16 17:59:24,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 17:59:24,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:24,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:24,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1507781959, now seen corresponding path program 5 times [2025-03-16 17:59:24,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:24,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767814885] [2025-03-16 17:59:24,861 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:59:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:24,892 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 420 statements into 209 equivalence classes. [2025-03-16 17:59:24,956 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 103 check-sat command(s) and asserted 206 of 420 statements. [2025-03-16 17:59:24,957 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 103 check-sat command(s) [2025-03-16 17:59:24,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 57924 backedges. 36326 proven. 1816 refuted. 0 times theorem prover too weak. 19782 trivial. 0 not checked. [2025-03-16 17:59:25,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:25,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767814885] [2025-03-16 17:59:25,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767814885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:59:25,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583792824] [2025-03-16 17:59:25,143 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:59:25,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:25,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:25,145 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:59:25,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:59:25,211 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 420 statements into 209 equivalence classes. [2025-03-16 17:59:25,333 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 103 check-sat command(s) and asserted 206 of 420 statements. [2025-03-16 17:59:25,333 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 103 check-sat command(s) [2025-03-16 17:59:25,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:25,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:59:25,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:59:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 57924 backedges. 36326 proven. 1816 refuted. 0 times theorem prover too weak. 19782 trivial. 0 not checked. [2025-03-16 17:59:25,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:59:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 57924 backedges. 36326 proven. 1816 refuted. 0 times theorem prover too weak. 19782 trivial. 0 not checked. [2025-03-16 17:59:25,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583792824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:59:25,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:59:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-16 17:59:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752170735] [2025-03-16 17:59:25,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:59:25,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 17:59:25,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:25,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 17:59:25,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:59:25,600 INFO L87 Difference]: Start difference. First operand 421 states and 485 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-03-16 17:59:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:25,711 INFO L93 Difference]: Finished difference Result 1639 states and 1895 transitions. [2025-03-16 17:59:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:59:25,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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) Word has length 420 [2025-03-16 17:59:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:25,716 INFO L225 Difference]: With dead ends: 1639 [2025-03-16 17:59:25,716 INFO L226 Difference]: Without dead ends: 1221 [2025-03-16 17:59:25,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:59:25,717 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:25,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:25,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-16 17:59:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1221. [2025-03-16 17:59:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.1450819672131147) internal successors, (1397), 1220 states have internal predecessors, (1397), 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-16 17:59:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1397 transitions. [2025-03-16 17:59:25,824 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1397 transitions. Word has length 420 [2025-03-16 17:59:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:25,825 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1397 transitions. [2025-03-16 17:59:25,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-03-16 17:59:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1397 transitions. [2025-03-16 17:59:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2025-03-16 17:59:25,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:25,853 INFO L218 NwaCegarLoop]: trace histogram [864, 144, 144, 24, 24, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-16 17:59:25,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 17:59:26,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 17:59:26,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:26,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:26,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1799259449, now seen corresponding path program 6 times [2025-03-16 17:59:26,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:26,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483897923] [2025-03-16 17:59:26,057 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 17:59:26,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:26,120 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1220 statements into 609 equivalence classes. [2025-03-16 17:59:27,021 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 608 check-sat command(s) and asserted 1218 of 1220 statements. [2025-03-16 17:59:27,021 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 608 check-sat command(s) [2025-03-16 17:59:27,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 521972 backedges. 326611 proven. 1 refuted. 0 times theorem prover too weak. 195360 trivial. 0 not checked. [2025-03-16 17:59:27,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:27,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483897923] [2025-03-16 17:59:27,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483897923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:59:27,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291692848] [2025-03-16 17:59:27,912 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 17:59:27,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:27,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:27,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:59:27,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 17:59:28,079 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1220 statements into 609 equivalence classes. [2025-03-16 17:59:29,706 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 608 check-sat command(s) and asserted 1218 of 1220 statements. [2025-03-16 17:59:29,706 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 608 check-sat command(s) [2025-03-16 17:59:29,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:29,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 3676 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 17:59:29,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:59:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 521972 backedges. 326611 proven. 1 refuted. 0 times theorem prover too weak. 195360 trivial. 0 not checked. [2025-03-16 17:59:30,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:59:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 521972 backedges. 326611 proven. 1 refuted. 0 times theorem prover too weak. 195360 trivial. 0 not checked. [2025-03-16 17:59:30,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291692848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:59:30,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:59:30,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 17:59:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964739252] [2025-03-16 17:59:30,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:59:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:59:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:30,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:59:30,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:59:30,305 INFO L87 Difference]: Start difference. First operand 1221 states and 1397 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-16 17:59:30,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:30,567 INFO L93 Difference]: Finished difference Result 5761 states and 6597 transitions. [2025-03-16 17:59:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:59:30,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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) Word has length 1220 [2025-03-16 17:59:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:30,583 INFO L225 Difference]: With dead ends: 5761 [2025-03-16 17:59:30,583 INFO L226 Difference]: Without dead ends: 4845 [2025-03-16 17:59:30,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2442 GetRequests, 2437 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:59:30,585 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:30,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2025-03-16 17:59:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 4845. [2025-03-16 17:59:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4845 states, 4844 states have (on average 1.143063583815029) internal successors, (5537), 4844 states have internal predecessors, (5537), 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-16 17:59:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 5537 transitions. [2025-03-16 17:59:30,877 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 5537 transitions. Word has length 1220 [2025-03-16 17:59:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:30,879 INFO L471 AbstractCegarLoop]: Abstraction has 4845 states and 5537 transitions. [2025-03-16 17:59:30,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-16 17:59:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 5537 transitions. [2025-03-16 17:59:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4845 [2025-03-16 17:59:31,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:31,007 INFO L218 NwaCegarLoop]: trace histogram [3456, 576, 576, 96, 96, 16, 16, 4, 4, 1, 1, 1, 1] [2025-03-16 17:59:31,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 17:59:31,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:31,208 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:31,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:31,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1800498625, now seen corresponding path program 7 times [2025-03-16 17:59:31,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:31,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089501608] [2025-03-16 17:59:31,210 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 17:59:31,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:31,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4844 statements into 1 equivalence classes. [2025-03-16 17:59:33,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4844 of 4844 statements. [2025-03-16 17:59:33,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:33,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8358368 backedges. 3135295 proven. 391912 refuted. 0 times theorem prover too weak. 4831161 trivial. 0 not checked. [2025-03-16 17:59:39,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:39,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089501608] [2025-03-16 17:59:39,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089501608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:59:39,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111009213] [2025-03-16 17:59:39,415 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 17:59:39,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:39,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:39,417 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:59:39,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 17:59:39,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4844 statements into 1 equivalence classes. [2025-03-16 17:59:40,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4844 of 4844 statements. [2025-03-16 17:59:40,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:40,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:40,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 14554 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:59:40,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:59:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8358368 backedges. 3135295 proven. 391912 refuted. 0 times theorem prover too weak. 4831161 trivial. 0 not checked. [2025-03-16 17:59:42,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:59:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8358368 backedges. 3135295 proven. 391912 refuted. 0 times theorem prover too weak. 4831161 trivial. 0 not checked. [2025-03-16 17:59:43,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111009213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:59:43,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:59:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-16 17:59:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032214271] [2025-03-16 17:59:43,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:59:43,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 17:59:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:43,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 17:59:43,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:59:43,177 INFO L87 Difference]: Start difference. First operand 4845 states and 5537 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-16 17:59:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:43,515 INFO L93 Difference]: Finished difference Result 10895 states and 12458 transitions. [2025-03-16 17:59:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:59:43,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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) Word has length 4844 [2025-03-16 17:59:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:43,544 INFO L225 Difference]: With dead ends: 10895 [2025-03-16 17:59:43,544 INFO L226 Difference]: Without dead ends: 7261 [2025-03-16 17:59:43,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9693 GetRequests, 9682 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:59:43,552 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:43,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7261 states. [2025-03-16 17:59:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7261 to 7261. [2025-03-16 17:59:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7261 states, 7260 states have (on average 1.1428374655647382) internal successors, (8297), 7260 states have internal predecessors, (8297), 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-16 17:59:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7261 states to 7261 states and 8297 transitions. [2025-03-16 17:59:44,017 INFO L78 Accepts]: Start accepts. Automaton has 7261 states and 8297 transitions. Word has length 4844 [2025-03-16 17:59:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:44,019 INFO L471 AbstractCegarLoop]: Abstraction has 7261 states and 8297 transitions. [2025-03-16 17:59:44,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-16 17:59:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 7261 states and 8297 transitions. [2025-03-16 17:59:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7261 [2025-03-16 17:59:44,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:44,228 INFO L218 NwaCegarLoop]: trace histogram [5184, 864, 864, 144, 144, 24, 24, 4, 4, 1, 1, 1, 1] [2025-03-16 17:59:44,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 17:59:44,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:44,429 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:44,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:44,431 INFO L85 PathProgramCache]: Analyzing trace with hash 964203663, now seen corresponding path program 8 times [2025-03-16 17:59:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:44,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381653883] [2025-03-16 17:59:44,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:59:44,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:44,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7260 statements into 2 equivalence classes. [2025-03-16 18:00:01,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7260 of 7260 statements. [2025-03-16 18:00:01,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:00:01,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18808072 backedges. 0 proven. 14108776 refuted. 0 times theorem prover too weak. 4699296 trivial. 0 not checked. [2025-03-16 18:00:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:00:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381653883] [2025-03-16 18:00:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381653883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:00:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889938964] [2025-03-16 18:00:14,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:00:14,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:14,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:14,185 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:14,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 18:00:15,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7260 statements into 2 equivalence classes. [2025-03-16 18:00:17,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7260 of 7260 statements. [2025-03-16 18:00:17,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:00:17,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:17,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 21802 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 18:00:17,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18808072 backedges. 0 proven. 14108776 refuted. 0 times theorem prover too weak. 4699296 trivial. 0 not checked. [2025-03-16 18:00:23,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18808072 backedges. 0 proven. 14108776 refuted. 0 times theorem prover too weak. 4699296 trivial. 0 not checked. [2025-03-16 18:00:28,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889938964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:28,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:00:28,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-16 18:00:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116065705] [2025-03-16 18:00:28,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:28,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:00:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:00:28,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:00:28,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:00:28,472 INFO L87 Difference]: Start difference. First operand 7261 states and 8297 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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-16 18:00:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:29,045 INFO L93 Difference]: Finished difference Result 10892 states and 12447 transitions. [2025-03-16 18:00:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:00:29,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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) Word has length 7260 [2025-03-16 18:00:29,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:29,089 INFO L225 Difference]: With dead ends: 10892 [2025-03-16 18:00:29,090 INFO L226 Difference]: Without dead ends: 10889 [2025-03-16 18:00:29,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14524 GetRequests, 14513 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:00:29,096 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:29,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10889 states. [2025-03-16 18:00:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10889 to 10889. [2025-03-16 18:00:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10889 states, 10888 states have (on average 1.1428177810433504) internal successors, (12443), 10888 states have internal predecessors, (12443), 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-16 18:00:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10889 states to 10889 states and 12443 transitions. [2025-03-16 18:00:29,785 INFO L78 Accepts]: Start accepts. Automaton has 10889 states and 12443 transitions. Word has length 7260 [2025-03-16 18:00:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:29,791 INFO L471 AbstractCegarLoop]: Abstraction has 10889 states and 12443 transitions. [2025-03-16 18:00:29,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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-16 18:00:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 10889 states and 12443 transitions. [2025-03-16 18:00:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10889 [2025-03-16 18:00:30,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:30,329 INFO L218 NwaCegarLoop]: trace histogram [7776, 1296, 1296, 216, 216, 36, 36, 6, 6, 1, 1, 1, 1] [2025-03-16 18:00:30,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 18:00:30,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 18:00:30,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:30,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash 518856151, now seen corresponding path program 9 times [2025-03-16 18:00:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:00:30,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810694739] [2025-03-16 18:00:30,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:00:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:00:30,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 18:00:30,724 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.StackOverflowError at java.base/java.util.HashMap.putVal(HashMap.java:635) at java.base/java.util.HashMap.put(HashMap.java:618) at java.base/java.util.HashSet.add(HashSet.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.addStmtPositionToDepth(AssertOrderUtils.java:112) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:89) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.assertorders.AssertOrderUtils.dfsPartitionStatementsAccordingToDepth(AssertOrderUtils.java:92) [2025-03-16 18:00:30,750 INFO L158 Benchmark]: Toolchain (without parser) took 68741.78ms. Allocated memory was 167.8MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 122.8MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2025-03-16 18:00:30,751 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:00:30,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.80ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 111.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:00:30,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.77ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.9MB in the end (delta: 743.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:00:30,751 INFO L158 Benchmark]: Boogie Preprocessor took 20.38ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:00:30,751 INFO L158 Benchmark]: IcfgBuilder took 197.44ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 98.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:00:30,752 INFO L158 Benchmark]: TraceAbstraction took 68350.53ms. Allocated memory was 167.8MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 97.9MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2025-03-16 18:00:30,753 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.80ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 111.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.77ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.9MB in the end (delta: 743.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.38ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 197.44ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 98.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 68350.53ms. Allocated memory was 167.8MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 97.9MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: StackOverflowError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: StackOverflowError: null: java.base/java.util.HashMap.putVal(HashMap.java:635) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-03-16 18:00:30,768 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/loop-simple/nested_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d0f32d2f39934bb8fd732fa206acfa5d2fb4cacaee37919c0e4326d55891c86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:00:33,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:00:33,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 18:00:33,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:00:33,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:00:33,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:00:33,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:00:33,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:00:33,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:00:33,273 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:00:33,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:00:33,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:00:33,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:00:33,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:00:33,274 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:00:33,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:00:33,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:00:33,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:00:33,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:00:33,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:00:33,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:00:33,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:00:33,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:00:33,275 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 18:00:33,275 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 18:00:33,275 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 18:00:33,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:00:33,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:00:33,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:00:33,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:00:33,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:00:33,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:00:33,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:00:33,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:00:33,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:00:33,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:00:33,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:00:33,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:00:33,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:00:33,277 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 18:00:33,277 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 18:00:33,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:00:33,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:00:33,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:00:33,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:00:33,278 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 ! call(reach_error())) ) 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 -> 3d0f32d2f39934bb8fd732fa206acfa5d2fb4cacaee37919c0e4326d55891c86 [2025-03-16 18:00:33,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:00:33,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:00:33,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:00:33,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:00:33,521 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:00:33,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_5.c [2025-03-16 18:00:34,609 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749b3e6ff/57b1bf4f0e5b4d5fb37fb4861cdf2527/FLAG8abbed143 [2025-03-16 18:00:34,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:00:34,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c [2025-03-16 18:00:34,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749b3e6ff/57b1bf4f0e5b4d5fb37fb4861cdf2527/FLAG8abbed143 [2025-03-16 18:00:35,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749b3e6ff/57b1bf4f0e5b4d5fb37fb4861cdf2527 [2025-03-16 18:00:35,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:00:35,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:00:35,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:00:35,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:00:35,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:00:35,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe9c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35, skipping insertion in model container [2025-03-16 18:00:35,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:00:35,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c[899,912] [2025-03-16 18:00:35,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:00:35,278 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:00:35,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c[899,912] [2025-03-16 18:00:35,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:00:35,297 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:00:35,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35 WrapperNode [2025-03-16 18:00:35,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:00:35,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:00:35,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:00:35,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:00:35,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,320 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-03-16 18:00:35,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:00:35,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:00:35,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:00:35,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:00:35,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,341 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-03-16 18:00:35,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:00:35,348 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:00:35,348 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:00:35,348 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:00:35,349 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (1/1) ... [2025-03-16 18:00:35,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:00:35,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:35,379 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-16 18:00:35,381 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-16 18:00:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:00:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:00:35,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:00:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 18:00:35,449 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:00:35,450 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:00:35,546 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 18:00:35,546 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:00:35,552 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:00:35,552 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:00:35,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:00:35 BoogieIcfgContainer [2025-03-16 18:00:35,553 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:00:35,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:00:35,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:00:35,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:00:35,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:00:35" (1/3) ... [2025-03-16 18:00:35,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d98694b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:00:35, skipping insertion in model container [2025-03-16 18:00:35,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:00:35" (2/3) ... [2025-03-16 18:00:35,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d98694b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:00:35, skipping insertion in model container [2025-03-16 18:00:35,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:00:35" (3/3) ... [2025-03-16 18:00:35,559 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_5.c [2025-03-16 18:00:35,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:00:35,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_5.c that has 1 procedures, 12 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-16 18:00:35,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:00:35,607 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;@59a745c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:00:35,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:00:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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-16 18:00:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 18:00:35,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:35,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 18:00:35,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:35,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1383935, now seen corresponding path program 1 times [2025-03-16 18:00:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:35,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797978229] [2025-03-16 18:00:35,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:00:35,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:35,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:35,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:35,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:00:35,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 18:00:35,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 18:00:35,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:00:35,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:35,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 18:00:35,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:35,698 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-16 18:00:35,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:00:35,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:35,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797978229] [2025-03-16 18:00:35,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797978229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:00:35,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:00:35,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 18:00:35,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28836124] [2025-03-16 18:00:35,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:00:35,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:00:35,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:35,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:00:35,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:00:35,715 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 18:00:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:35,743 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2025-03-16 18:00:35,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:00:35,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2025-03-16 18:00:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:35,750 INFO L225 Difference]: With dead ends: 23 [2025-03-16 18:00:35,750 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 18:00:35,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:00:35,753 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:35,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 23 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 18:00:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2025-03-16 18:00:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-16 18:00:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-16 18:00:35,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 4 [2025-03-16 18:00:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:35,786 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-16 18:00:35,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 18:00:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2025-03-16 18:00:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 18:00:35,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:35,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 18:00:35,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:00:35,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:35,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:35,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:35,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1329109223, now seen corresponding path program 1 times [2025-03-16 18:00:35,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:35,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275716775] [2025-03-16 18:00:35,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:00:35,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:35,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:35,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:35,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:00:36,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 18:00:36,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 18:00:36,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:00:36,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:36,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 18:00:36,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:36,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:00:36,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275716775] [2025-03-16 18:00:36,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275716775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:00:36,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:00:36,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:00:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923629261] [2025-03-16 18:00:36,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:00:36,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:00:36,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:36,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:00:36,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:00:36,037 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-16 18:00:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:36,049 INFO L93 Difference]: Finished difference Result 22 states and 34 transitions. [2025-03-16 18:00:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:00:36,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-03-16 18:00:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:36,050 INFO L225 Difference]: With dead ends: 22 [2025-03-16 18:00:36,050 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 18:00:36,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:00:36,051 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:36,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 18:00:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2025-03-16 18:00:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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-16 18:00:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-03-16 18:00:36,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 6 [2025-03-16 18:00:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:36,053 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-16 18:00:36,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-16 18:00:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2025-03-16 18:00:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 18:00:36,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:36,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:00:36,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 18:00:36,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:36,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:36,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1861763489, now seen corresponding path program 1 times [2025-03-16 18:00:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:36,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148983991] [2025-03-16 18:00:36,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:00:36,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:36,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:36,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:36,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:00:36,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 18:00:36,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 18:00:36,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:00:36,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:36,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 18:00:36,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:36,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:00:36,293 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:36,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148983991] [2025-03-16 18:00:36,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148983991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:00:36,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:00:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:00:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000839778] [2025-03-16 18:00:36,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:00:36,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:00:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:36,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:00:36,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:00:36,294 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-16 18:00:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:36,313 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2025-03-16 18:00:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:00:36,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-03-16 18:00:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:36,314 INFO L225 Difference]: With dead ends: 23 [2025-03-16 18:00:36,314 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 18:00:36,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:00:36,315 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:36,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 18:00:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2025-03-16 18:00:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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-16 18:00:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-03-16 18:00:36,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2025-03-16 18:00:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:36,317 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-16 18:00:36,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-16 18:00:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2025-03-16 18:00:36,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 18:00:36,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:36,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:00:36,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 18:00:36,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:36,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:36,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:36,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1654157051, now seen corresponding path program 1 times [2025-03-16 18:00:36,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:36,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815562045] [2025-03-16 18:00:36,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:00:36,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:36,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:36,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:36,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 18:00:36,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 18:00:36,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 18:00:36,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:00:36,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:36,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 18:00:36,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:36,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:00:36,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:36,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815562045] [2025-03-16 18:00:36,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815562045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:00:36,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:00:36,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:00:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016960195] [2025-03-16 18:00:36,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:00:36,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:00:36,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:36,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:00:36,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:00:36,566 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-16 18:00:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:36,582 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2025-03-16 18:00:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:00:36,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2025-03-16 18:00:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:36,583 INFO L225 Difference]: With dead ends: 24 [2025-03-16 18:00:36,583 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 18:00:36,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:00:36,584 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:36,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 18:00:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-16 18:00:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-16 18:00:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-03-16 18:00:36,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2025-03-16 18:00:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:36,591 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-16 18:00:36,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-16 18:00:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-03-16 18:00:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 18:00:36,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:36,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:00:36,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 18:00:36,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:36,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:36,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2043581373, now seen corresponding path program 1 times [2025-03-16 18:00:36,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:36,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1816570620] [2025-03-16 18:00:36,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:00:36,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:36,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:36,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:36,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 18:00:36,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 18:00:36,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 18:00:36,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:00:36,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:36,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 18:00:36,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:36,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:00:36,835 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816570620] [2025-03-16 18:00:36,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816570620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:00:36,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:00:36,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:00:36,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219274448] [2025-03-16 18:00:36,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:00:36,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:00:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:36,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:00:36,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:00:36,836 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 18:00:36,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:36,844 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2025-03-16 18:00:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:00:36,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2025-03-16 18:00:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:36,846 INFO L225 Difference]: With dead ends: 25 [2025-03-16 18:00:36,846 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 18:00:36,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:00:36,847 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:36,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 18:00:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-16 18:00:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-16 18:00:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-03-16 18:00:36,851 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 12 [2025-03-16 18:00:36,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:36,851 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-16 18:00:36,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 18:00:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2025-03-16 18:00:36,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 18:00:36,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:36,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:00:36,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 18:00:37,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:37,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:37,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash -561871246, now seen corresponding path program 1 times [2025-03-16 18:00:37,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:37,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [208327918] [2025-03-16 18:00:37,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:00:37,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:37,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:37,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:37,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 18:00:37,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 18:00:37,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 18:00:37,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:00:37,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:37,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:00:37,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 18:00:37,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 18:00:37,130 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208327918] [2025-03-16 18:00:37,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208327918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:37,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:00:37,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-16 18:00:37,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545105776] [2025-03-16 18:00:37,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:37,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:00:37,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:37,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:00:37,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:00:37,133 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-16 18:00:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:37,167 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2025-03-16 18:00:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:00:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 13 [2025-03-16 18:00:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:37,168 INFO L225 Difference]: With dead ends: 35 [2025-03-16 18:00:37,168 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 18:00:37,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:00:37,169 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:37,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 18:00:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-16 18:00:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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-16 18:00:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-03-16 18:00:37,172 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 13 [2025-03-16 18:00:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:37,172 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-16 18:00:37,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-16 18:00:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-03-16 18:00:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 18:00:37,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:37,174 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:00:37,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 18:00:37,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:37,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:37,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:37,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1237140165, now seen corresponding path program 2 times [2025-03-16 18:00:37,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:37,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45862371] [2025-03-16 18:00:37,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:00:37,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:37,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:37,377 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:37,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 18:00:37,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-16 18:00:37,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 18:00:37,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:00:37,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:37,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:00:37,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 18:00:37,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 18:00:37,519 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:37,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45862371] [2025-03-16 18:00:37,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45862371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:37,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:00:37,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-16 18:00:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016921986] [2025-03-16 18:00:37,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:37,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:00:37,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:37,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:00:37,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:00:37,520 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-16 18:00:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:37,581 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2025-03-16 18:00:37,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:00:37,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 22 [2025-03-16 18:00:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:37,582 INFO L225 Difference]: With dead ends: 80 [2025-03-16 18:00:37,583 INFO L226 Difference]: Without dead ends: 77 [2025-03-16 18:00:37,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:00:37,583 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:37,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-16 18:00:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-16 18:00:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 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-16 18:00:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2025-03-16 18:00:37,595 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 22 [2025-03-16 18:00:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:37,596 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2025-03-16 18:00:37,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-16 18:00:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2025-03-16 18:00:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 18:00:37,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:37,597 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-16 18:00:37,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 18:00:37,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:37,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:37,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash 855560215, now seen corresponding path program 3 times [2025-03-16 18:00:37,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:37,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210172539] [2025-03-16 18:00:37,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:00:37,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:37,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:37,801 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:37,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 18:00:37,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 37 equivalence classes. [2025-03-16 18:00:37,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 16 of 76 statements. [2025-03-16 18:00:37,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 18:00:37,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:37,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:00:37,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2025-03-16 18:00:37,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2025-03-16 18:00:37,882 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210172539] [2025-03-16 18:00:37,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210172539] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:37,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:00:37,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-16 18:00:37,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274315824] [2025-03-16 18:00:37,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:37,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:00:37,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:37,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:00:37,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:00:37,884 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-16 18:00:37,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:37,921 INFO L93 Difference]: Finished difference Result 199 states and 303 transitions. [2025-03-16 18:00:37,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:00:37,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) Word has length 76 [2025-03-16 18:00:37,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:37,925 INFO L225 Difference]: With dead ends: 199 [2025-03-16 18:00:37,925 INFO L226 Difference]: Without dead ends: 125 [2025-03-16 18:00:37,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:00:37,927 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:37,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-16 18:00:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-16 18:00:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.2338709677419355) internal successors, (153), 124 states have internal predecessors, (153), 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-16 18:00:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2025-03-16 18:00:37,958 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 76 [2025-03-16 18:00:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:37,958 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2025-03-16 18:00:37,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-16 18:00:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2025-03-16 18:00:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 18:00:37,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:37,962 INFO L218 NwaCegarLoop]: trace histogram [64, 16, 16, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-16 18:00:37,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 18:00:38,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:38,166 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:38,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash -901457161, now seen corresponding path program 4 times [2025-03-16 18:00:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289301778] [2025-03-16 18:00:38,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:00:38,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:38,170 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:38,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 18:00:38,207 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 124 statements into 2 equivalence classes. [2025-03-16 18:00:38,247 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 123 of 124 statements. [2025-03-16 18:00:38,247 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 18:00:38,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:38,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:00:38,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 1303 proven. 1 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-16 18:00:38,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 1303 proven. 1 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-16 18:00:38,359 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:38,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289301778] [2025-03-16 18:00:38,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289301778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:38,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:00:38,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-16 18:00:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185193061] [2025-03-16 18:00:38,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:38,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:00:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:38,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:00:38,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:00:38,361 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-16 18:00:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:38,447 INFO L93 Difference]: Finished difference Result 555 states and 688 transitions. [2025-03-16 18:00:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:00:38,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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) Word has length 124 [2025-03-16 18:00:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:38,449 INFO L225 Difference]: With dead ends: 555 [2025-03-16 18:00:38,449 INFO L226 Difference]: Without dead ends: 461 [2025-03-16 18:00:38,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:00:38,450 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:38,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 35 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-16 18:00:38,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2025-03-16 18:00:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.2195652173913043) internal successors, (561), 460 states have internal predecessors, (561), 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-16 18:00:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 561 transitions. [2025-03-16 18:00:38,517 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 561 transitions. Word has length 124 [2025-03-16 18:00:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:38,517 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 561 transitions. [2025-03-16 18:00:38,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-16 18:00:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 561 transitions. [2025-03-16 18:00:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-16 18:00:38,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:38,525 INFO L218 NwaCegarLoop]: trace histogram [256, 64, 64, 16, 16, 16, 16, 4, 4, 1, 1, 1, 1] [2025-03-16 18:00:38,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 18:00:38,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:38,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:38,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash -514833665, now seen corresponding path program 5 times [2025-03-16 18:00:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:38,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514601528] [2025-03-16 18:00:38,728 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 18:00:38,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:38,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:38,731 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:38,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 18:00:38,827 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 460 statements into 229 equivalence classes. [2025-03-16 18:00:38,840 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 18 of 460 statements. [2025-03-16 18:00:38,840 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-16 18:00:38,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:38,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 18:00:38,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 54896 backedges. 28334 proven. 10 refuted. 0 times theorem prover too weak. 26552 trivial. 0 not checked. [2025-03-16 18:00:38,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 54896 backedges. 28334 proven. 10 refuted. 0 times theorem prover too weak. 26552 trivial. 0 not checked. [2025-03-16 18:00:38,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:38,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514601528] [2025-03-16 18:00:38,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514601528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:38,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:00:38,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-16 18:00:38,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677206766] [2025-03-16 18:00:38,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:38,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 18:00:38,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:38,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 18:00:38,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:00:38,980 INFO L87 Difference]: Start difference. First operand 461 states and 561 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-16 18:00:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:39,084 INFO L93 Difference]: Finished difference Result 1046 states and 1374 transitions. [2025-03-16 18:00:39,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:00:39,085 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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) Word has length 460 [2025-03-16 18:00:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:39,087 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 18:00:39,087 INFO L226 Difference]: Without dead ends: 589 [2025-03-16 18:00:39,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 908 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:00:39,090 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:39,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-16 18:00:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-03-16 18:00:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.1717687074829932) internal successors, (689), 588 states have internal predecessors, (689), 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-16 18:00:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 689 transitions. [2025-03-16 18:00:39,162 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 689 transitions. Word has length 460 [2025-03-16 18:00:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:39,162 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 689 transitions. [2025-03-16 18:00:39,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-16 18:00:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 689 transitions. [2025-03-16 18:00:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-03-16 18:00:39,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:39,172 INFO L218 NwaCegarLoop]: trace histogram [384, 64, 64, 16, 16, 16, 16, 4, 4, 1, 1, 1, 1] [2025-03-16 18:00:39,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 18:00:39,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:39,376 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:39,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:39,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2051876097, now seen corresponding path program 6 times [2025-03-16 18:00:39,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:39,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509154082] [2025-03-16 18:00:39,378 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 18:00:39,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:39,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:39,380 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:39,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 18:00:39,478 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 588 statements into 293 equivalence classes. [2025-03-16 18:00:39,720 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 72 check-sat command(s) and asserted 146 of 588 statements. [2025-03-16 18:00:39,720 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 72 check-sat command(s) [2025-03-16 18:00:39,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:39,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 18:00:39,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 103984 backedges. 57799 proven. 304 refuted. 0 times theorem prover too weak. 45881 trivial. 0 not checked. [2025-03-16 18:00:39,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 103984 backedges. 57799 proven. 304 refuted. 0 times theorem prover too weak. 45881 trivial. 0 not checked. [2025-03-16 18:00:39,901 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:39,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509154082] [2025-03-16 18:00:39,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509154082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:39,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:00:39,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-16 18:00:39,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061095833] [2025-03-16 18:00:39,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:39,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 18:00:39,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:39,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 18:00:39,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:00:39,902 INFO L87 Difference]: Start difference. First operand 589 states and 689 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-16 18:00:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:40,024 INFO L93 Difference]: Finished difference Result 1430 states and 1694 transitions. [2025-03-16 18:00:40,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:00:40,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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) Word has length 588 [2025-03-16 18:00:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:40,029 INFO L225 Difference]: With dead ends: 1430 [2025-03-16 18:00:40,029 INFO L226 Difference]: Without dead ends: 845 [2025-03-16 18:00:40,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1174 GetRequests, 1164 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:00:40,030 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:40,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 71 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-16 18:00:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2025-03-16 18:00:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.1575829383886256) internal successors, (977), 844 states have internal predecessors, (977), 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-16 18:00:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 977 transitions. [2025-03-16 18:00:40,115 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 977 transitions. Word has length 588 [2025-03-16 18:00:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:40,116 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 977 transitions. [2025-03-16 18:00:40,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-16 18:00:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 977 transitions. [2025-03-16 18:00:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2025-03-16 18:00:40,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:40,126 INFO L218 NwaCegarLoop]: trace histogram [576, 96, 96, 16, 16, 16, 16, 4, 4, 1, 1, 1, 1] [2025-03-16 18:00:40,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 18:00:40,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:40,327 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:40,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:40,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1052066113, now seen corresponding path program 7 times [2025-03-16 18:00:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:40,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464284988] [2025-03-16 18:00:40,328 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 18:00:40,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:40,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:40,330 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:40,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 18:00:40,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 844 statements into 1 equivalence classes. [2025-03-16 18:00:40,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 844 of 844 statements. [2025-03-16 18:00:40,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:00:40,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:40,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:00:40,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 232368 backedges. 27278 proven. 1 refuted. 0 times theorem prover too weak. 205089 trivial. 0 not checked. [2025-03-16 18:00:40,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 232368 backedges. 27278 proven. 1 refuted. 0 times theorem prover too weak. 205089 trivial. 0 not checked. [2025-03-16 18:00:40,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 18:00:40,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464284988] [2025-03-16 18:00:40,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464284988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:40,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:00:40,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-16 18:00:40,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275755628] [2025-03-16 18:00:40,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:40,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:00:40,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 18:00:40,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:00:40,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:00:40,987 INFO L87 Difference]: Start difference. First operand 845 states and 977 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-16 18:00:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:41,290 INFO L93 Difference]: Finished difference Result 4036 states and 4676 transitions. [2025-03-16 18:00:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:00:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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) Word has length 844 [2025-03-16 18:00:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:41,303 INFO L225 Difference]: With dead ends: 4036 [2025-03-16 18:00:41,303 INFO L226 Difference]: Without dead ends: 3245 [2025-03-16 18:00:41,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1687 GetRequests, 1682 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:00:41,306 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:41,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2025-03-16 18:00:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 3245. [2025-03-16 18:00:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3245 states, 3244 states have (on average 1.1445745992601726) internal successors, (3713), 3244 states have internal predecessors, (3713), 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-16 18:00:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 3245 states and 3713 transitions. [2025-03-16 18:00:41,568 INFO L78 Accepts]: Start accepts. Automaton has 3245 states and 3713 transitions. Word has length 844 [2025-03-16 18:00:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:41,568 INFO L471 AbstractCegarLoop]: Abstraction has 3245 states and 3713 transitions. [2025-03-16 18:00:41,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-16 18:00:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3245 states and 3713 transitions. [2025-03-16 18:00:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3245 [2025-03-16 18:00:41,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:41,639 INFO L218 NwaCegarLoop]: trace histogram [2304, 384, 384, 64, 64, 16, 16, 4, 4, 1, 1, 1, 1] [2025-03-16 18:00:41,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-16 18:00:41,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:41,840 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:41,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1953158975, now seen corresponding path program 8 times [2025-03-16 18:00:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 18:00:41,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236414462] [2025-03-16 18:00:41,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:00:41,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:41,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:41,845 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:00:41,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 18:00:42,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3244 statements into 2 equivalence classes. [2025-03-16 18:00:43,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 3244 of 3244 statements. [2025-03-16 18:00:43,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:00:43,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:43,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 6500 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 18:00:43,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3714816 backedges. 0 proven. 2787328 refuted. 0 times theorem prover too weak. 927488 trivial. 0 not checked. [2025-03-16 18:00:46,428 INFO L312 TraceCheckSpWp]: Computing backward predicates...