./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-?-551b009-m [2025-01-09 03:06:47,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:06:47,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:06:47,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:06:47,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:06:47,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:06:47,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:06:47,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:06:47,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:06:47,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:06:47,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:06:47,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:06:47,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:06:47,894 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:06:47,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:06:47,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:06:47,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:06:47,896 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:06:47,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:06:47,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:06:47,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:06:47,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:06:47,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:06:47,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:06:47,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:06:47,897 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-01-09 03:06:48,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:06:48,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:06:48,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:06:48,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:06:48,128 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:06:48,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_5.c [2025-01-09 03:06:49,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f849da2e8/3e88818170544ef79556d93276dfb3e3/FLAG5100e95c1 [2025-01-09 03:06:49,504 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:06:49,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c [2025-01-09 03:06:49,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f849da2e8/3e88818170544ef79556d93276dfb3e3/FLAG5100e95c1 [2025-01-09 03:06:49,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f849da2e8/3e88818170544ef79556d93276dfb3e3 [2025-01-09 03:06:49,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:06:49,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:06:49,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:06:49,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:06:49,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:06:49,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49, skipping insertion in model container [2025-01-09 03:06:49,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:06:49,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c[899,912] [2025-01-09 03:06:49,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:06:49,667 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:06:49,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c[899,912] [2025-01-09 03:06:49,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:06:49,688 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:06:49,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49 WrapperNode [2025-01-09 03:06:49,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:06:49,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:06:49,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:06:49,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:06:49,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,712 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-01-09 03:06:49,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:06:49,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:06:49,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:06:49,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:06:49,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,730 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-01-09 03:06:49,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:06:49,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:06:49,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:06:49,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:06:49,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:06:49,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:49,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:06:49,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:06:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:06:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:06:49,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:06:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:06:49,839 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:06:49,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:06:49,922 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 03:06:49,923 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:06:49,932 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:06:49,932 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 03:06:49,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:06:49 BoogieIcfgContainer [2025-01-09 03:06:49,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:06:49,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:06:49,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:06:49,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:06:49,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:06:49" (1/3) ... [2025-01-09 03:06:49,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5340f2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:06:49, skipping insertion in model container [2025-01-09 03:06:49,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (2/3) ... [2025-01-09 03:06:49,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5340f2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:06:49, skipping insertion in model container [2025-01-09 03:06:49,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:06:49" (3/3) ... [2025-01-09 03:06:49,941 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_5.c [2025-01-09 03:06:49,954 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:06:49,955 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_5.c that has 1 procedures, 14 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-09 03:06:49,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:06:50,008 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;@de99b7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:06:50,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:06:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 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-01-09 03:06:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 03:06:50,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 03:06:50,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash 28720606, now seen corresponding path program 1 times [2025-01-09 03:06:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905732062] [2025-01-09 03:06:50,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 03:06:50,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 03:06:50,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905732062] [2025-01-09 03:06:50,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905732062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:06:50,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:06:50,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:06:50,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393936727] [2025-01-09 03:06:50,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:06:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:06:50,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,188 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 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.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-09 03:06:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,216 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2025-01-09 03:06:50,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:06:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-09 03:06:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,222 INFO L225 Difference]: With dead ends: 26 [2025-01-09 03:06:50,222 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:06:50,223 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-01-09 03:06:50,225 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 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-01-09 03:06:50,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:06:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2025-01-09 03:06:50,246 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-01-09 03:06:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-01-09 03:06:50,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 5 [2025-01-09 03:06:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,253 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-01-09 03:06:50,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-09 03:06:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2025-01-09 03:06:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 03:06:50,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:06:50,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1806535366, now seen corresponding path program 1 times [2025-01-09 03:06:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969228022] [2025-01-09 03:06:50,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 03:06:50,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 03:06:50,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969228022] [2025-01-09 03:06:50,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969228022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:06:50,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:06:50,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:06:50,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536409054] [2025-01-09 03:06:50,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:06:50,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:06:50,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,309 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-09 03:06:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,323 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2025-01-09 03:06:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:06:50,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-01-09 03:06:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,324 INFO L225 Difference]: With dead ends: 23 [2025-01-09 03:06:50,324 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:06:50,324 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-01-09 03:06:50,325 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 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-01-09 03:06:50,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:06:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2025-01-09 03:06:50,327 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-01-09 03:06:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-01-09 03:06:50,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2025-01-09 03:06:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,328 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-09 03:06:50,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-09 03:06:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2025-01-09 03:06:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:06:50,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:06:50,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,329 INFO L85 PathProgramCache]: Analyzing trace with hash 337270360, now seen corresponding path program 1 times [2025-01-09 03:06:50,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542513544] [2025-01-09 03:06:50,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:06:50,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:06:50,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542513544] [2025-01-09 03:06:50,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542513544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:06:50,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:06:50,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:06:50,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101084721] [2025-01-09 03:06:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:06:50,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:06:50,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,381 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-01-09 03:06:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,391 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2025-01-09 03:06:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:06:50,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-01-09 03:06:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,392 INFO L225 Difference]: With dead ends: 24 [2025-01-09 03:06:50,392 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:06:50,392 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-01-09 03:06:50,392 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 20 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-01-09 03:06:50,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:06:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-01-09 03:06:50,394 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-01-09 03:06:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-01-09 03:06:50,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 9 [2025-01-09 03:06:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,395 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-09 03:06:50,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-01-09 03:06:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-01-09 03:06:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 03:06:50,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:06:50,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1959210548, now seen corresponding path program 1 times [2025-01-09 03:06:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313413411] [2025-01-09 03:06:50,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 03:06:50,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 03:06:50,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313413411] [2025-01-09 03:06:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313413411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:06:50,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:06:50,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:06:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94555906] [2025-01-09 03:06:50,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:06:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:06:50,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,433 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-01-09 03:06:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,449 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2025-01-09 03:06:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:06:50,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-01-09 03:06:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,450 INFO L225 Difference]: With dead ends: 25 [2025-01-09 03:06:50,450 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:06:50,450 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-01-09 03:06:50,450 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 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-01-09 03:06:50,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:06:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-01-09 03:06:50,453 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-01-09 03:06:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-01-09 03:06:50,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 11 [2025-01-09 03:06:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,453 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-01-09 03:06:50,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-01-09 03:06:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2025-01-09 03:06:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 03:06:50,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:06:50,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2036651566, now seen corresponding path program 1 times [2025-01-09 03:06:50,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33945114] [2025-01-09 03:06:50,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 03:06:50,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 03:06:50,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33945114] [2025-01-09 03:06:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33945114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:06:50,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:06:50,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:06:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882151542] [2025-01-09 03:06:50,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:06:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:06:50,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,509 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 03:06:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,523 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2025-01-09 03:06:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:06:50,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 03:06:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,524 INFO L225 Difference]: With dead ends: 26 [2025-01-09 03:06:50,524 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:06:50,524 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-01-09 03:06:50,524 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 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-01-09 03:06:50,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:06:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 03:06:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-01-09 03:06:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-01-09 03:06:50,531 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 13 [2025-01-09 03:06:50,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,531 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-01-09 03:06:50,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 03:06:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-01-09 03:06:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 03:06:50,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:06:50,532 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,532 INFO L85 PathProgramCache]: Analyzing trace with hash 263482354, now seen corresponding path program 1 times [2025-01-09 03:06:50,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16135217] [2025-01-09 03:06:50,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 03:06:50,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 03:06:50,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16135217] [2025-01-09 03:06:50,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16135217] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826333519] [2025-01-09 03:06:50,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:50,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:50,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:50,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:06:50,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 03:06:50,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 03:06:50,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:06:50,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826333519] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:50,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:50,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:06:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515973198] [2025-01-09 03:06:50,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:06:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:06:50,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:06:50,718 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-01-09 03:06:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,737 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2025-01-09 03:06:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:06:50,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 14 [2025-01-09 03:06:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,738 INFO L225 Difference]: With dead ends: 30 [2025-01-09 03:06:50,738 INFO L226 Difference]: Without dead ends: 18 [2025-01-09 03:06:50,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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-01-09 03:06:50,740 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 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-01-09 03:06:50,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-09 03:06:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-09 03:06:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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-01-09 03:06:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-01-09 03:06:50,742 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2025-01-09 03:06:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,742 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-01-09 03:06:50,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-01-09 03:06:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-01-09 03:06:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 03:06:50,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,743 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:06:50,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:50,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1544900142, now seen corresponding path program 2 times [2025-01-09 03:06:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907296425] [2025-01-09 03:06:50,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:06:50,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-09 03:06:50,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 03:06:50,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:06:50,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:06:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907296425] [2025-01-09 03:06:50,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907296425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314330991] [2025-01-09 03:06:50,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:06:50,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:50,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:50,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:50,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:06:51,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-09 03:06:51,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 03:06:51,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:06:51,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:51,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:06:51,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:51,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314330991] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:51,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2025-01-09 03:06:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896076481] [2025-01-09 03:06:51,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:51,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:06:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:51,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:06:51,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:06:51,115 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-01-09 03:06:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:51,247 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2025-01-09 03:06:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 03:06:51,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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 17 [2025-01-09 03:06:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:51,247 INFO L225 Difference]: With dead ends: 50 [2025-01-09 03:06:51,247 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 03:06:51,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:06:51,252 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:51,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 03:06:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2025-01-09 03:06:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-01-09 03:06:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-01-09 03:06:51,257 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2025-01-09 03:06:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:51,257 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-01-09 03:06:51,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-01-09 03:06:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-01-09 03:06:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 03:06:51,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:51,258 INFO L218 NwaCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:51,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:06:51,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:51,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:51,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1486861272, now seen corresponding path program 3 times [2025-01-09 03:06:51,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:51,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100328078] [2025-01-09 03:06:51,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:06:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:51,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 12 equivalence classes. [2025-01-09 03:06:51,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 27 statements. [2025-01-09 03:06:51,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:06:51,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 03:06:51,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:51,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100328078] [2025-01-09 03:06:51,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100328078] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:51,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951523529] [2025-01-09 03:06:51,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:06:51,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:51,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:51,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:51,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:06:51,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 12 equivalence classes. [2025-01-09 03:06:51,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 27 statements. [2025-01-09 03:06:51,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:06:51,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:51,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:06:51,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 03:06:51,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 03:06:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951523529] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:51,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:51,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:06:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106483377] [2025-01-09 03:06:51,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:51,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:06:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:51,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:06:51,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:06:51,591 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-01-09 03:06:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:51,615 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2025-01-09 03:06:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:06:51,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 27 [2025-01-09 03:06:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:51,617 INFO L225 Difference]: With dead ends: 97 [2025-01-09 03:06:51,617 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 03:06:51,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 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-01-09 03:06:51,618 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:51,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 03:06:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 03:06:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 93 states have internal predecessors, (114), 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-01-09 03:06:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2025-01-09 03:06:51,632 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 27 [2025-01-09 03:06:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:51,633 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2025-01-09 03:06:51,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-01-09 03:06:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2025-01-09 03:06:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 03:06:51,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:51,636 INFO L218 NwaCegarLoop]: trace histogram [48, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:06:51,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:06:51,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:51,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:51,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash 582617286, now seen corresponding path program 4 times [2025-01-09 03:06:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164021564] [2025-01-09 03:06:51,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:06:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:51,851 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-01-09 03:06:51,855 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 92 of 93 statements. [2025-01-09 03:06:51,855 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 03:06:51,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 638 proven. 1 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2025-01-09 03:06:51,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:51,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164021564] [2025-01-09 03:06:51,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164021564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:51,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182201837] [2025-01-09 03:06:51,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:06:51,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:51,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:51,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:51,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:06:52,004 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-01-09 03:06:52,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 92 of 93 statements. [2025-01-09 03:06:52,035 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 03:06:52,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:52,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:06:52,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 633 proven. 52 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2025-01-09 03:06:52,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 633 proven. 52 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2025-01-09 03:06:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182201837] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:52,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-01-09 03:06:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829029278] [2025-01-09 03:06:52,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:52,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:06:52,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:52,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:06:52,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:06:52,122 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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-01-09 03:06:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:52,308 INFO L93 Difference]: Finished difference Result 708 states and 872 transitions. [2025-01-09 03:06:52,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 03:06:52,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 93 [2025-01-09 03:06:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:52,312 INFO L225 Difference]: With dead ends: 708 [2025-01-09 03:06:52,312 INFO L226 Difference]: Without dead ends: 618 [2025-01-09 03:06:52,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 180 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-01-09 03:06:52,316 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 41 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-01-09 03:06:52,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 41 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-01-09 03:06:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 422. [2025-01-09 03:06:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.154394299287411) internal successors, (486), 421 states have internal predecessors, (486), 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-01-09 03:06:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 486 transitions. [2025-01-09 03:06:52,405 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 486 transitions. Word has length 93 [2025-01-09 03:06:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:52,405 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 486 transitions. [2025-01-09 03:06:52,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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-01-09 03:06:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 486 transitions. [2025-01-09 03:06:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-01-09 03:06:52,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:52,409 INFO L218 NwaCegarLoop]: trace histogram [288, 48, 48, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:06:52,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:06:52,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 03:06:52,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:52,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1129412474, now seen corresponding path program 5 times [2025-01-09 03:06:52,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:52,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640834608] [2025-01-09 03:06:52,611 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 03:06:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:52,644 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 421 statements into 209 equivalence classes. [2025-01-09 03:06:52,723 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 103 check-sat command(s) and asserted 206 of 421 statements. [2025-01-09 03:06:52,724 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 103 check-sat command(s) [2025-01-09 03:06:52,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 57924 backedges. 36326 proven. 1816 refuted. 0 times theorem prover too weak. 19782 trivial. 0 not checked. [2025-01-09 03:06:52,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:52,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640834608] [2025-01-09 03:06:52,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640834608] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:52,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003288592] [2025-01-09 03:06:52,899 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 03:06:52,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:52,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:52,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:52,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:06:52,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 421 statements into 209 equivalence classes. [2025-01-09 03:06:53,097 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 103 check-sat command(s) and asserted 206 of 421 statements. [2025-01-09 03:06:53,097 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 103 check-sat command(s) [2025-01-09 03:06:53,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:53,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:06:53,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 57924 backedges. 36326 proven. 1816 refuted. 0 times theorem prover too weak. 19782 trivial. 0 not checked. [2025-01-09 03:06:53,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 57924 backedges. 36326 proven. 1816 refuted. 0 times theorem prover too weak. 19782 trivial. 0 not checked. [2025-01-09 03:06:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003288592] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:53,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:53,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 03:06:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793824621] [2025-01-09 03:06:53,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:53,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:06:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:53,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:06:53,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:06:53,357 INFO L87 Difference]: Start difference. First operand 422 states and 486 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-01-09 03:06:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:53,509 INFO L93 Difference]: Finished difference Result 1640 states and 1896 transitions. [2025-01-09 03:06:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:06:53,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 421 [2025-01-09 03:06:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:53,515 INFO L225 Difference]: With dead ends: 1640 [2025-01-09 03:06:53,515 INFO L226 Difference]: Without dead ends: 1222 [2025-01-09 03:06:53,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 839 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-01-09 03:06:53,520 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:53,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 32 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-01-09 03:06:53,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2025-01-09 03:06:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1221 states have (on average 1.144963144963145) internal successors, (1398), 1221 states have internal predecessors, (1398), 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-01-09 03:06:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1398 transitions. [2025-01-09 03:06:53,686 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1398 transitions. Word has length 421 [2025-01-09 03:06:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:53,687 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1398 transitions. [2025-01-09 03:06:53,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-01-09 03:06:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1398 transitions. [2025-01-09 03:06:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1222 [2025-01-09 03:06:53,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:53,707 INFO L218 NwaCegarLoop]: trace histogram [864, 144, 144, 24, 24, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:06:53,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:06:53,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:06:53,913 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:53,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash 118257158, now seen corresponding path program 6 times [2025-01-09 03:06:53,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:53,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47129020] [2025-01-09 03:06:53,914 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 03:06:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:53,959 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1221 statements into 609 equivalence classes. [2025-01-09 03:06:54,903 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 608 check-sat command(s) and asserted 1219 of 1221 statements. [2025-01-09 03:06:54,903 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 608 check-sat command(s) [2025-01-09 03:06:54,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 521972 backedges. 326611 proven. 1 refuted. 0 times theorem prover too weak. 195360 trivial. 0 not checked. [2025-01-09 03:06:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47129020] [2025-01-09 03:06:55,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47129020] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649435430] [2025-01-09 03:06:55,607 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 03:06:55,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:55,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:55,609 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:55,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:06:55,758 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1221 statements into 609 equivalence classes. [2025-01-09 03:06:57,761 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 608 check-sat command(s) and asserted 1219 of 1221 statements. [2025-01-09 03:06:57,761 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 608 check-sat command(s) [2025-01-09 03:06:57,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:57,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 3676 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:06:57,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 521972 backedges. 326611 proven. 1 refuted. 0 times theorem prover too weak. 195360 trivial. 0 not checked. [2025-01-09 03:06:58,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 521972 backedges. 326611 proven. 1 refuted. 0 times theorem prover too weak. 195360 trivial. 0 not checked. [2025-01-09 03:06:58,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649435430] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:58,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:58,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:06:58,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433441623] [2025-01-09 03:06:58,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:58,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:06:58,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:58,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:06:58,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:06:58,406 INFO L87 Difference]: Start difference. First operand 1222 states and 1398 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-01-09 03:06:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:58,763 INFO L93 Difference]: Finished difference Result 5762 states and 6598 transitions. [2025-01-09 03:06:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:06:58,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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 1221 [2025-01-09 03:06:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:58,781 INFO L225 Difference]: With dead ends: 5762 [2025-01-09 03:06:58,781 INFO L226 Difference]: Without dead ends: 4846 [2025-01-09 03:06:58,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2444 GetRequests, 2439 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-01-09 03:06:58,786 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:58,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4846 states. [2025-01-09 03:06:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4846 to 4846. [2025-01-09 03:06:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4846 states, 4845 states have (on average 1.1430340557275542) internal successors, (5538), 4845 states have internal predecessors, (5538), 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-01-09 03:06:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4846 states to 4846 states and 5538 transitions. [2025-01-09 03:06:59,082 INFO L78 Accepts]: Start accepts. Automaton has 4846 states and 5538 transitions. Word has length 1221 [2025-01-09 03:06:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:59,102 INFO L471 AbstractCegarLoop]: Abstraction has 4846 states and 5538 transitions. [2025-01-09 03:06:59,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-01-09 03:06:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4846 states and 5538 transitions. [2025-01-09 03:06:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4846 [2025-01-09 03:06:59,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:59,288 INFO L218 NwaCegarLoop]: trace histogram [3456, 576, 576, 96, 96, 16, 16, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:06:59,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:06:59,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:06:59,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:59,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1096644706, now seen corresponding path program 7 times [2025-01-09 03:06:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:59,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794686118] [2025-01-09 03:06:59,491 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 03:06:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:59,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4845 statements into 1 equivalence classes. [2025-01-09 03:07:02,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4845 of 4845 statements. [2025-01-09 03:07:02,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:07:02,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:07:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8358368 backedges. 3135295 proven. 391912 refuted. 0 times theorem prover too weak. 4831161 trivial. 0 not checked. [2025-01-09 03:07:08,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:07:08,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794686118] [2025-01-09 03:07:08,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794686118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:07:08,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550704074] [2025-01-09 03:07:08,621 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 03:07:08,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:07:08,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:07:08,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:07:08,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:07:09,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4845 statements into 1 equivalence classes. [2025-01-09 03:07:10,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4845 of 4845 statements. [2025-01-09 03:07:10,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:07:10,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:07:10,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 14554 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:07:10,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:07:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8358368 backedges. 3135295 proven. 391912 refuted. 0 times theorem prover too weak. 4831161 trivial. 0 not checked. [2025-01-09 03:07:11,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:07:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8358368 backedges. 3135295 proven. 391912 refuted. 0 times theorem prover too weak. 4831161 trivial. 0 not checked. [2025-01-09 03:07:12,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550704074] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:07:12,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:07:12,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-01-09 03:07:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675987889] [2025-01-09 03:07:12,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:07:12,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:07:12,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:07:12,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:07:12,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:07:12,579 INFO L87 Difference]: Start difference. First operand 4846 states and 5538 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 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-01-09 03:07:12,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:07:12,943 INFO L93 Difference]: Finished difference Result 10896 states and 12459 transitions. [2025-01-09 03:07:12,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:07:12,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 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 4845 [2025-01-09 03:07:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:07:12,976 INFO L225 Difference]: With dead ends: 10896 [2025-01-09 03:07:12,976 INFO L226 Difference]: Without dead ends: 7262 [2025-01-09 03:07:12,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9695 GetRequests, 9684 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-01-09 03:07:12,983 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:07:12,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:07:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7262 states. [2025-01-09 03:07:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7262 to 7262. [2025-01-09 03:07:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7262 states, 7261 states have (on average 1.142817793692329) internal successors, (8298), 7261 states have internal predecessors, (8298), 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-01-09 03:07:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7262 states to 7262 states and 8298 transitions. [2025-01-09 03:07:13,448 INFO L78 Accepts]: Start accepts. Automaton has 7262 states and 8298 transitions. Word has length 4845 [2025-01-09 03:07:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:07:13,450 INFO L471 AbstractCegarLoop]: Abstraction has 7262 states and 8298 transitions. [2025-01-09 03:07:13,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 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-01-09 03:07:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 7262 states and 8298 transitions. [2025-01-09 03:07:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7262 [2025-01-09 03:07:13,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:07:13,661 INFO L218 NwaCegarLoop]: trace histogram [5184, 864, 864, 144, 144, 24, 24, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:07:13,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 03:07:13,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:07:13,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:07:13,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:07:13,864 INFO L85 PathProgramCache]: Analyzing trace with hash 543953070, now seen corresponding path program 8 times [2025-01-09 03:07:13,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:07:13,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540154756] [2025-01-09 03:07:13,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:07:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:07:14,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7261 statements into 2 equivalence classes. [2025-01-09 03:07:29,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7261 of 7261 statements. [2025-01-09 03:07:29,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:07:29,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:07:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18808072 backedges. 0 proven. 14108776 refuted. 0 times theorem prover too weak. 4699296 trivial. 0 not checked. [2025-01-09 03:07:39,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:07:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540154756] [2025-01-09 03:07:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540154756] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:07:39,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748979233] [2025-01-09 03:07:39,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:07:39,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:07:39,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:07:39,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:07:39,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 03:07:39,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7261 statements into 2 equivalence classes. [2025-01-09 03:07:42,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7261 of 7261 statements. [2025-01-09 03:07:42,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:07:42,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:07:42,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 21802 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:07:42,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:07:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18808072 backedges. 0 proven. 14108776 refuted. 0 times theorem prover too weak. 4699296 trivial. 0 not checked. [2025-01-09 03:07:47,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:07:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18808072 backedges. 0 proven. 14108776 refuted. 0 times theorem prover too weak. 4699296 trivial. 0 not checked. [2025-01-09 03:07:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748979233] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:07:53,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:07:53,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-01-09 03:07:53,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909440176] [2025-01-09 03:07:53,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:07:53,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:07:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:07:53,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:07:53,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:07:53,334 INFO L87 Difference]: Start difference. First operand 7262 states and 8298 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:07:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:07:53,831 INFO L93 Difference]: Finished difference Result 10893 states and 12448 transitions. [2025-01-09 03:07:53,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:07:53,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7261 [2025-01-09 03:07:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:07:53,874 INFO L225 Difference]: With dead ends: 10893 [2025-01-09 03:07:53,874 INFO L226 Difference]: Without dead ends: 10890 [2025-01-09 03:07:53,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14527 GetRequests, 14516 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-01-09 03:07:53,880 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:07:53,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:07:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2025-01-09 03:07:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 10890. [2025-01-09 03:07:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10890 states, 10889 states have (on average 1.1428046652585178) internal successors, (12444), 10889 states have internal predecessors, (12444), 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-01-09 03:07:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10890 states to 10890 states and 12444 transitions. [2025-01-09 03:07:54,502 INFO L78 Accepts]: Start accepts. Automaton has 10890 states and 12444 transitions. Word has length 7261 [2025-01-09 03:07:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:07:54,508 INFO L471 AbstractCegarLoop]: Abstraction has 10890 states and 12444 transitions. [2025-01-09 03:07:54,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:07:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 10890 states and 12444 transitions. [2025-01-09 03:07:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10890 [2025-01-09 03:07:54,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:07:54,934 INFO L218 NwaCegarLoop]: trace histogram [7776, 1296, 1296, 216, 216, 36, 36, 6, 6, 1, 1, 1, 1, 1] [2025-01-09 03:07:54,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 03:07:55,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:07:55,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:07:55,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:07:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1377353750, now seen corresponding path program 9 times [2025-01-09 03:07:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:07:55,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448447529] [2025-01-09 03:07:55,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:07:55,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:07:55,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:07:55,329 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-01-09 03:07:55,355 INFO L158 Benchmark]: Toolchain (without parser) took 65816.76ms. Allocated memory was 142.6MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 105.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2025-01-09 03:07:55,355 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:07:55,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.21ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 94.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:07:55,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.35ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 94.0MB in the end (delta: 518.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:07:55,355 INFO L158 Benchmark]: Boogie Preprocessor took 28.03ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:07:55,355 INFO L158 Benchmark]: RCFGBuilder took 190.82ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 82.3MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:07:55,355 INFO L158 Benchmark]: TraceAbstraction took 65419.21ms. Allocated memory was 142.6MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 81.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2025-01-09 03:07:55,356 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.16ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.21ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 94.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.35ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 94.0MB in the end (delta: 518.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.03ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 190.82ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 82.3MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 65419.21ms. Allocated memory was 142.6MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 81.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 3.3GB. 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-01-09 03:07:55,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-?-551b009-m [2025-01-09 03:07:57,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:07:57,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 03:07:57,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:07:57,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:07:57,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:07:57,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:07:57,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:07:57,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:07:57,742 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:07:57,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:07:57,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:07:57,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:07:57,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:07:57,743 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:07:57,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:07:57,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:07:57,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:07:57,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:07:57,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:07:57,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:07:57,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:07:57,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:07:57,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:07:57,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:07:57,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:07:57,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:07:57,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:07:57,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:07:57,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:07:57,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:07:57,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:07:57,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:07:57,747 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 03:07:57,747 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 03:07:57,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:07:57,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:07:57,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:07:57,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:07:57,747 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-01-09 03:07:57,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:07:57,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:07:57,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:07:57,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:07:57,994 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:07:57,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_5.c [2025-01-09 03:07:59,119 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ad54d8a7/cba1ad1db3204168ba5794998316666b/FLAG4610544dd [2025-01-09 03:07:59,324 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:07:59,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c [2025-01-09 03:07:59,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ad54d8a7/cba1ad1db3204168ba5794998316666b/FLAG4610544dd [2025-01-09 03:07:59,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ad54d8a7/cba1ad1db3204168ba5794998316666b [2025-01-09 03:07:59,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:07:59,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:07:59,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:07:59,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:07:59,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:07:59,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c310493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59, skipping insertion in model container [2025-01-09 03:07:59,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:07:59,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c[899,912] [2025-01-09 03:07:59,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:07:59,494 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:07:59,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c[899,912] [2025-01-09 03:07:59,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:07:59,519 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:07:59,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59 WrapperNode [2025-01-09 03:07:59,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:07:59,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:07:59,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:07:59,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:07:59,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,543 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-01-09 03:07:59,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:07:59,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:07:59,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:07:59,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:07:59,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,562 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-01-09 03:07:59,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:07:59,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:07:59,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:07:59,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:07:59,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (1/1) ... [2025-01-09 03:07:59,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:07:59,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:07:59,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:07:59,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:07:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:07:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:07:59,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:07:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 03:07:59,672 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:07:59,673 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:07:59,785 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 03:07:59,785 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:07:59,790 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:07:59,791 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 03:07:59,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:07:59 BoogieIcfgContainer [2025-01-09 03:07:59,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:07:59,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:07:59,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:07:59,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:07:59,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:07:59" (1/3) ... [2025-01-09 03:07:59,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b54cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:07:59, skipping insertion in model container [2025-01-09 03:07:59,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:59" (2/3) ... [2025-01-09 03:07:59,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b54cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:07:59, skipping insertion in model container [2025-01-09 03:07:59,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:07:59" (3/3) ... [2025-01-09 03:07:59,801 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_5.c [2025-01-09 03:07:59,811 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:07:59,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_5.c that has 1 procedures, 14 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-09 03:07:59,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:07:59,863 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;@14dc3c15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:07:59,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:07:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 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-01-09 03:07:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 03:07:59,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:07:59,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 03:07:59,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:07:59,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:07:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash 28720606, now seen corresponding path program 1 times [2025-01-09 03:07:59,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:07:59,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107498198] [2025-01-09 03:07:59,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:07:59,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:07:59,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:07:59,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:07:59,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:07:59,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 03:07:59,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 03:07:59,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:07:59,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:07:59,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:07:59,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:07:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:07:59,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:07:59,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:07:59,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107498198] [2025-01-09 03:07:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107498198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:07:59,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:07:59,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:07:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603898210] [2025-01-09 03:07:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:07:59,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:07:59,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:07:59,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:08:00,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:08:00,003 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 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.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-09 03:08:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:00,033 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2025-01-09 03:08:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:08:00,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-09 03:08:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:00,048 INFO L225 Difference]: With dead ends: 26 [2025-01-09 03:08:00,049 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:08:00,051 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-01-09 03:08:00,055 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 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-01-09 03:08:00,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:08:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2025-01-09 03:08:00,073 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-01-09 03:08:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-01-09 03:08:00,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 5 [2025-01-09 03:08:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:00,079 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-01-09 03:08:00,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-09 03:08:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2025-01-09 03:08:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 03:08:00,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:00,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:08:00,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:08:00,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:00,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:00,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1806535366, now seen corresponding path program 1 times [2025-01-09 03:08:00,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:00,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028695513] [2025-01-09 03:08:00,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:08:00,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:00,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:00,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:00,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:08:00,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 03:08:00,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 03:08:00,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:08:00,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:00,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:08:00,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:08:00,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:08:00,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028695513] [2025-01-09 03:08:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028695513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:08:00,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:08:00,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:08:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159819771] [2025-01-09 03:08:00,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:08:00,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:08:00,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:00,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:08:00,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:08:00,334 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-09 03:08:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:00,353 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2025-01-09 03:08:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:08:00,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-01-09 03:08:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:00,355 INFO L225 Difference]: With dead ends: 23 [2025-01-09 03:08:00,355 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:08:00,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-01-09 03:08:00,355 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 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-01-09 03:08:00,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:08:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2025-01-09 03:08:00,358 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-01-09 03:08:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-01-09 03:08:00,359 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2025-01-09 03:08:00,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:00,359 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-09 03:08:00,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-09 03:08:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2025-01-09 03:08:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:08:00,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:00,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:08:00,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:08:00,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:00,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:00,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:00,562 INFO L85 PathProgramCache]: Analyzing trace with hash 337270360, now seen corresponding path program 1 times [2025-01-09 03:08:00,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:00,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067174757] [2025-01-09 03:08:00,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:08:00,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:00,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:00,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:00,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:08:00,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:08:00,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:08:00,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:08:00,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:00,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:08:00,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:08:00,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:08:00,614 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:00,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067174757] [2025-01-09 03:08:00,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067174757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:08:00,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:08:00,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:08:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923250718] [2025-01-09 03:08:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:08:00,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:08:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:00,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:08:00,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:08:00,615 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-01-09 03:08:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:00,632 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2025-01-09 03:08:00,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:08:00,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-01-09 03:08:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:00,633 INFO L225 Difference]: With dead ends: 24 [2025-01-09 03:08:00,633 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:08:00,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-01-09 03:08:00,633 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 20 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-01-09 03:08:00,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:08:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-01-09 03:08:00,638 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-01-09 03:08:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-01-09 03:08:00,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 9 [2025-01-09 03:08:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:00,638 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-09 03:08:00,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-01-09 03:08:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-01-09 03:08:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 03:08:00,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:00,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:08:00,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:08:00,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:00,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:00,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1959210548, now seen corresponding path program 1 times [2025-01-09 03:08:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421090223] [2025-01-09 03:08:00,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:08:00,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:00,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:00,843 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:00,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:08:00,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 03:08:00,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 03:08:00,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:08:00,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:00,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:08:00,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:08:00,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:08:00,878 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:00,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421090223] [2025-01-09 03:08:00,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421090223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:08:00,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:08:00,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:08:00,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778552525] [2025-01-09 03:08:00,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:08:00,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:08:00,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:00,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:08:00,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:08:00,879 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-01-09 03:08:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:00,890 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2025-01-09 03:08:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:08:00,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-01-09 03:08:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:00,890 INFO L225 Difference]: With dead ends: 25 [2025-01-09 03:08:00,891 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:08:00,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-01-09 03:08:00,891 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 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-01-09 03:08:00,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:08:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-01-09 03:08:00,894 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-01-09 03:08:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-01-09 03:08:00,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 11 [2025-01-09 03:08:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:00,894 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-01-09 03:08:00,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-01-09 03:08:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2025-01-09 03:08:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 03:08:00,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:00,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:08:00,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:08:01,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:01,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:01,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2036651566, now seen corresponding path program 1 times [2025-01-09 03:08:01,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:01,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937783015] [2025-01-09 03:08:01,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:08:01,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:01,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:01,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:01,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:08:01,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 03:08:01,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 03:08:01,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:08:01,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:01,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:08:01,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:08:01,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:08:01,154 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937783015] [2025-01-09 03:08:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937783015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:08:01,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:08:01,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:08:01,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051036428] [2025-01-09 03:08:01,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:08:01,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:08:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:01,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:08:01,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:08:01,155 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 03:08:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:01,163 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2025-01-09 03:08:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:08:01,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 03:08:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:01,163 INFO L225 Difference]: With dead ends: 26 [2025-01-09 03:08:01,163 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:08:01,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-01-09 03:08:01,167 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 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-01-09 03:08:01,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:08:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 03:08:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-01-09 03:08:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-01-09 03:08:01,170 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 13 [2025-01-09 03:08:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:01,170 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-01-09 03:08:01,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 03:08:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-01-09 03:08:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 03:08:01,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:01,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:08:01,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:08:01,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:01,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:01,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 263482354, now seen corresponding path program 1 times [2025-01-09 03:08:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:01,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165977706] [2025-01-09 03:08:01,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:08:01,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:01,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:01,373 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:01,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:08:01,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 03:08:01,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 03:08:01,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:08:01,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:01,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:08:01,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:08:01,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:08:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:08:01,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:01,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165977706] [2025-01-09 03:08:01,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165977706] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:08:01,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:08:01,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-01-09 03:08:01,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637000610] [2025-01-09 03:08:01,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:08:01,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:08:01,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:01,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:08:01,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:08:01,463 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-01-09 03:08:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:01,502 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2025-01-09 03:08:01,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:08:01,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) Word has length 14 [2025-01-09 03:08:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:01,503 INFO L225 Difference]: With dead ends: 30 [2025-01-09 03:08:01,503 INFO L226 Difference]: Without dead ends: 18 [2025-01-09 03:08:01,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-01-09 03:08:01,504 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 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-01-09 03:08:01,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-09 03:08:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-09 03:08:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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-01-09 03:08:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-01-09 03:08:01,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2025-01-09 03:08:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:01,509 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-01-09 03:08:01,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-01-09 03:08:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-01-09 03:08:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 03:08:01,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:01,509 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:08:01,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:08:01,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:01,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:01,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1544900142, now seen corresponding path program 2 times [2025-01-09 03:08:01,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:01,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942534375] [2025-01-09 03:08:01,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:08:01,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:01,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:01,713 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:01,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:08:01,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-09 03:08:01,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 03:08:01,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:08:01,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:01,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:08:01,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:08:01,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:08:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:08:01,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:01,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942534375] [2025-01-09 03:08:01,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942534375] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:08:01,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:08:01,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-01-09 03:08:01,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515062205] [2025-01-09 03:08:01,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:08:01,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:08:01,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:01,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:08:01,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:08:01,807 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-01-09 03:08:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:01,857 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2025-01-09 03:08:01,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:08:01,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 17 [2025-01-09 03:08:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:01,858 INFO L225 Difference]: With dead ends: 51 [2025-01-09 03:08:01,858 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 03:08:01,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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-01-09 03:08:01,859 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:08:01,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 03:08:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-09 03:08:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 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-01-09 03:08:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-01-09 03:08:01,868 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2025-01-09 03:08:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:01,868 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-01-09 03:08:01,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-01-09 03:08:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-01-09 03:08:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 03:08:01,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:01,869 INFO L218 NwaCegarLoop]: trace histogram [16, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:08:01,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 03:08:02,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:02,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:02,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:02,070 INFO L85 PathProgramCache]: Analyzing trace with hash -821680412, now seen corresponding path program 3 times [2025-01-09 03:08:02,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:02,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [244006095] [2025-01-09 03:08:02,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:08:02,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:02,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:02,072 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:02,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 03:08:02,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 16 equivalence classes. [2025-01-09 03:08:02,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 35 statements. [2025-01-09 03:08:02,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:08:02,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:02,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:08:02,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-01-09 03:08:02,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:08:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-01-09 03:08:02,224 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244006095] [2025-01-09 03:08:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244006095] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:08:02,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:08:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-01-09 03:08:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549534073] [2025-01-09 03:08:02,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:08:02,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:08:02,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:02,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:08:02,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:08:02,225 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-01-09 03:08:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:02,283 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2025-01-09 03:08:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:08:02,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 35 [2025-01-09 03:08:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:02,286 INFO L225 Difference]: With dead ends: 129 [2025-01-09 03:08:02,286 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 03:08:02,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 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-01-09 03:08:02,286 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 46 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-01-09 03:08:02,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 46 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 03:08:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-01-09 03:08:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.232) internal successors, (154), 125 states have internal predecessors, (154), 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-01-09 03:08:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2025-01-09 03:08:02,316 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 35 [2025-01-09 03:08:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:02,316 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2025-01-09 03:08:02,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-01-09 03:08:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2025-01-09 03:08:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:08:02,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:02,321 INFO L218 NwaCegarLoop]: trace histogram [64, 16, 16, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:08:02,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 03:08:02,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:02,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:02,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:02,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1652099830, now seen corresponding path program 4 times [2025-01-09 03:08:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274942814] [2025-01-09 03:08:02,523 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:08:02,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:02,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:02,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:02,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 03:08:02,576 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 125 statements into 2 equivalence classes. [2025-01-09 03:08:02,621 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 124 of 125 statements. [2025-01-09 03:08:02,621 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 03:08:02,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:02,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:08:02,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 1298 proven. 1 refuted. 0 times theorem prover too weak. 2117 trivial. 0 not checked. [2025-01-09 03:08:02,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:08:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 1298 proven. 1 refuted. 0 times theorem prover too weak. 2117 trivial. 0 not checked. [2025-01-09 03:08:02,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274942814] [2025-01-09 03:08:02,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274942814] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:08:02,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:08:02,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-01-09 03:08:02,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428671917] [2025-01-09 03:08:02,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:08:02,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:08:02,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:02,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:08:02,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:08:02,738 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-01-09 03:08:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:02,829 INFO L93 Difference]: Finished difference Result 560 states and 688 transitions. [2025-01-09 03:08:02,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:08:02,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 125 [2025-01-09 03:08:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:02,833 INFO L225 Difference]: With dead ends: 560 [2025-01-09 03:08:02,833 INFO L226 Difference]: Without dead ends: 438 [2025-01-09 03:08:02,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 244 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-01-09 03:08:02,833 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 34 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-01-09 03:08:02,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-09 03:08:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-01-09 03:08:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 1.2036613272311212) internal successors, (526), 437 states have internal predecessors, (526), 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-01-09 03:08:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 526 transitions. [2025-01-09 03:08:02,909 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 526 transitions. Word has length 125 [2025-01-09 03:08:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:02,909 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 526 transitions. [2025-01-09 03:08:02,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-01-09 03:08:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 526 transitions. [2025-01-09 03:08:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 03:08:02,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:02,913 INFO L218 NwaCegarLoop]: trace histogram [256, 64, 64, 16, 16, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:08:02,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 03:08:03,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:03,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:03,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1647405434, now seen corresponding path program 5 times [2025-01-09 03:08:03,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:03,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769794576] [2025-01-09 03:08:03,115 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 03:08:03,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:03,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:03,118 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:03,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 03:08:03,232 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 437 statements into 217 equivalence classes. [2025-01-09 03:08:03,245 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 18 of 437 statements. [2025-01-09 03:08:03,246 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-01-09 03:08:03,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:03,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:08:03,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 54428 backedges. 28094 proven. 10 refuted. 0 times theorem prover too weak. 26324 trivial. 0 not checked. [2025-01-09 03:08:03,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:08:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 54428 backedges. 28094 proven. 10 refuted. 0 times theorem prover too weak. 26324 trivial. 0 not checked. [2025-01-09 03:08:03,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:03,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769794576] [2025-01-09 03:08:03,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769794576] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:08:03,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:08:03,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-01-09 03:08:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890109776] [2025-01-09 03:08:03,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:08:03,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:08:03,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:03,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:08:03,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:08:03,399 INFO L87 Difference]: Start difference. First operand 438 states and 526 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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-01-09 03:08:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:03,542 INFO L93 Difference]: Finished difference Result 1000 states and 1304 transitions. [2025-01-09 03:08:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:08:03,542 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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 437 [2025-01-09 03:08:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:03,545 INFO L225 Difference]: With dead ends: 1000 [2025-01-09 03:08:03,545 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:08:03,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 872 GetRequests, 862 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-01-09 03:08:03,548 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:08:03,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:08:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-01-09 03:08:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.1575221238938054) internal successors, (654), 565 states have internal predecessors, (654), 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-01-09 03:08:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 654 transitions. [2025-01-09 03:08:03,628 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 654 transitions. Word has length 437 [2025-01-09 03:08:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:03,628 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 654 transitions. [2025-01-09 03:08:03,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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-01-09 03:08:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 654 transitions. [2025-01-09 03:08:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-01-09 03:08:03,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:03,634 INFO L218 NwaCegarLoop]: trace histogram [384, 64, 64, 16, 16, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:08:03,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 03:08:03,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:03,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:03,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1525680506, now seen corresponding path program 6 times [2025-01-09 03:08:03,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:03,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227622776] [2025-01-09 03:08:03,836 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 03:08:03,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:03,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:03,838 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:03,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 03:08:03,939 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 565 statements into 281 equivalence classes. [2025-01-09 03:08:04,286 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 72 check-sat command(s) and asserted 147 of 565 statements. [2025-01-09 03:08:04,286 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 72 check-sat command(s) [2025-01-09 03:08:04,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:04,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:08:04,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 103516 backedges. 57559 proven. 304 refuted. 0 times theorem prover too weak. 45653 trivial. 0 not checked. [2025-01-09 03:08:04,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:08:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 103516 backedges. 57559 proven. 304 refuted. 0 times theorem prover too weak. 45653 trivial. 0 not checked. [2025-01-09 03:08:04,559 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:04,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227622776] [2025-01-09 03:08:04,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227622776] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:08:04,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:08:04,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2025-01-09 03:08:04,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683541934] [2025-01-09 03:08:04,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:08:04,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:08:04,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:04,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:08:04,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:08:04,562 INFO L87 Difference]: Start difference. First operand 566 states and 654 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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-01-09 03:08:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:04,901 INFO L93 Difference]: Finished difference Result 1896 states and 2264 transitions. [2025-01-09 03:08:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:08:04,902 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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 565 [2025-01-09 03:08:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:04,906 INFO L225 Difference]: With dead ends: 1896 [2025-01-09 03:08:04,907 INFO L226 Difference]: Without dead ends: 1334 [2025-01-09 03:08:04,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1135 GetRequests, 1118 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:08:04,908 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:08:04,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 89 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:08:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-01-09 03:08:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2025-01-09 03:08:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1333 states have (on average 1.150787696924231) internal successors, (1534), 1333 states have internal predecessors, (1534), 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-01-09 03:08:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1534 transitions. [2025-01-09 03:08:05,022 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1534 transitions. Word has length 565 [2025-01-09 03:08:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:05,022 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1534 transitions. [2025-01-09 03:08:05,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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-01-09 03:08:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1534 transitions. [2025-01-09 03:08:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-01-09 03:08:05,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:05,035 INFO L218 NwaCegarLoop]: trace histogram [576, 96, 96, 16, 16, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:08:05,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 03:08:05,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:05,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:05,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:05,236 INFO L85 PathProgramCache]: Analyzing trace with hash 4636486, now seen corresponding path program 7 times [2025-01-09 03:08:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:05,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406545076] [2025-01-09 03:08:05,237 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 03:08:05,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:05,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:05,240 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:05,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 03:08:05,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-01-09 03:08:05,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-01-09 03:08:05,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:08:05,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:05,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:08:05,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 231900 backedges. 87115 proven. 1 refuted. 0 times theorem prover too weak. 144784 trivial. 0 not checked. [2025-01-09 03:08:06,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:08:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 231900 backedges. 87115 proven. 1 refuted. 0 times theorem prover too weak. 144784 trivial. 0 not checked. [2025-01-09 03:08:06,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:06,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406545076] [2025-01-09 03:08:06,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406545076] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:08:06,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:08:06,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-01-09 03:08:06,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702968757] [2025-01-09 03:08:06,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:08:06,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:08:06,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:06,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:08:06,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:08:06,301 INFO L87 Difference]: Start difference. First operand 1334 states and 1534 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-01-09 03:08:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:06,772 INFO L93 Difference]: Finished difference Result 6294 states and 7244 transitions. [2025-01-09 03:08:06,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:08:06,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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) Word has length 821 [2025-01-09 03:08:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:06,791 INFO L225 Difference]: With dead ends: 6294 [2025-01-09 03:08:06,791 INFO L226 Difference]: Without dead ends: 5294 [2025-01-09 03:08:06,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1641 GetRequests, 1636 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-01-09 03:08:06,796 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 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-01-09 03:08:06,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2025-01-09 03:08:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 5294. [2025-01-09 03:08:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5294 states, 5293 states have (on average 1.1490648025694312) internal successors, (6082), 5293 states have internal predecessors, (6082), 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-01-09 03:08:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 6082 transitions. [2025-01-09 03:08:07,359 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 6082 transitions. Word has length 821 [2025-01-09 03:08:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:08:07,360 INFO L471 AbstractCegarLoop]: Abstraction has 5294 states and 6082 transitions. [2025-01-09 03:08:07,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-01-09 03:08:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 6082 transitions. [2025-01-09 03:08:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3246 [2025-01-09 03:08:07,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:08:07,425 INFO L218 NwaCegarLoop]: trace histogram [2304, 384, 384, 64, 64, 16, 16, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:08:07,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 03:08:07,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:07,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:08:07,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:08:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2110295198, now seen corresponding path program 8 times [2025-01-09 03:08:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 03:08:07,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273874296] [2025-01-09 03:08:07,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:08:07,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:08:07,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:08:07,634 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:08:07,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 03:08:08,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3245 statements into 2 equivalence classes. [2025-01-09 03:08:09,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 3245 of 3245 statements. [2025-01-09 03:08:09,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:08:09,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:08:09,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 6500 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:08:09,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:08:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3714816 backedges. 435518 proven. 10888 refuted. 0 times theorem prover too weak. 3268410 trivial. 0 not checked. [2025-01-09 03:08:10,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:08:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3714816 backedges. 435518 proven. 10888 refuted. 0 times theorem prover too weak. 3268410 trivial. 0 not checked. [2025-01-09 03:08:10,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 03:08:10,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273874296] [2025-01-09 03:08:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273874296] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:08:10,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:08:10,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-01-09 03:08:10,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019442635] [2025-01-09 03:08:10,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:08:10,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:08:10,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 03:08:10,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:08:10,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:08:10,463 INFO L87 Difference]: Start difference. First operand 5294 states and 6082 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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-01-09 03:08:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:08:11,266 INFO L93 Difference]: Finished difference Result 12879 states and 14822 transitions. [2025-01-09 03:08:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:08:11,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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 3245 [2025-01-09 03:08:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:08:11,299 INFO L225 Difference]: With dead ends: 12879 [2025-01-09 03:08:11,299 INFO L226 Difference]: Without dead ends: 7918 [2025-01-09 03:08:11,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6488 GetRequests, 6478 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:08:11,310 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:08:11,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 136 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:08:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7918 states.