./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.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/loops-crafted-1/nested_delay_notd2.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 a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:05:01,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:05:02,039 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:05:02,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:05:02,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:05:02,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:05:02,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:05:02,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:05:02,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:05:02,060 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:05:02,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:05:02,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:05:02,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:05:02,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:05:02,060 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:05:02,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:05:02,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:05:02,061 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:05:02,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:05:02,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:05:02,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:05:02,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:05:02,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:05:02,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:05:02,061 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:05:02,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:05:02,062 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:05:02,062 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:05:02,062 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:05:02,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:05:02,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:05:02,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:05:02,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:05:02,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:05:02,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:05:02,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:05:02,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:05:02,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:05:02,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:05:02,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:05:02,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:05:02,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:05:02,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:05:02,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:05:02,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:05:02,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:05:02,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:05:02,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:05:02,064 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 -> a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a [2025-01-09 03:05:02,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:05:02,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:05:02,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:05:02,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:05:02,307 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:05:02,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2025-01-09 03:05:03,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69c2b5d73/eda791acfeca49b18f20a5c22fe96c5c/FLAG3c18702f1 [2025-01-09 03:05:03,660 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:05:03,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2025-01-09 03:05:03,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69c2b5d73/eda791acfeca49b18f20a5c22fe96c5c/FLAG3c18702f1 [2025-01-09 03:05:03,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69c2b5d73/eda791acfeca49b18f20a5c22fe96c5c [2025-01-09 03:05:03,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:05:03,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:05:03,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:05:03,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:05:03,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:05:03,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b8559a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03, skipping insertion in model container [2025-01-09 03:05:03,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:05:03,794 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/loops-crafted-1/nested_delay_notd2.c[468,481] [2025-01-09 03:05:03,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:05:03,809 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:05:03,816 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/loops-crafted-1/nested_delay_notd2.c[468,481] [2025-01-09 03:05:03,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:05:03,828 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:05:03,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03 WrapperNode [2025-01-09 03:05:03,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:05:03,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:05:03,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:05:03,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:05:03,834 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:05:03" (1/1) ... [2025-01-09 03:05:03,838 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:05:03" (1/1) ... [2025-01-09 03:05:03,847 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-01-09 03:05:03,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:05:03,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:05:03,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:05:03,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:05:03,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,859 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:05:03,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:05:03,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:05:03,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:05:03,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:05:03,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (1/1) ... [2025-01-09 03:05:03,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:05:03,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:03,887 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:05:03,889 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:05:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:05:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:05:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:05:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:05:03,940 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:05:03,941 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:05:04,015 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 03:05:04,015 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:05:04,020 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:05:04,021 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:05:04,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:04 BoogieIcfgContainer [2025-01-09 03:05:04,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:05:04,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:05:04,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:05:04,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:05:04,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:05:03" (1/3) ... [2025-01-09 03:05:04,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42574afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:05:04, skipping insertion in model container [2025-01-09 03:05:04,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:05:03" (2/3) ... [2025-01-09 03:05:04,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42574afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:05:04, skipping insertion in model container [2025-01-09 03:05:04,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:04" (3/3) ... [2025-01-09 03:05:04,027 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2025-01-09 03:05:04,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:05:04,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_delay_notd2.c that has 1 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:05:04,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:05:04,074 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;@72eeec65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:05:04,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:05:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:05:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 03:05:04,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:04,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:04,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:04,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash -311088802, now seen corresponding path program 1 times [2025-01-09 03:05:04,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:04,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753114286] [2025-01-09 03:05:04,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:04,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:04,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 03:05:04,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 03:05:04,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:04,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:04,171 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:05:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753114286] [2025-01-09 03:05:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753114286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:04,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:05:04,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:05:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287414556] [2025-01-09 03:05:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:04,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:05:04,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:04,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:05:04,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:05:04,191 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:05:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:04,198 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2025-01-09 03:05:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:05:04,199 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 03:05:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:04,202 INFO L225 Difference]: With dead ends: 34 [2025-01-09 03:05:04,202 INFO L226 Difference]: Without dead ends: 17 [2025-01-09 03:05:04,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:05:04,206 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:04,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-09 03:05:04,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-09 03:05:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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:05:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-01-09 03:05:04,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2025-01-09 03:05:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:04,225 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-01-09 03:05:04,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:05:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2025-01-09 03:05:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 03:05:04,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:04,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:04,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:05:04,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:04,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash -704115812, now seen corresponding path program 1 times [2025-01-09 03:05:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:04,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525759862] [2025-01-09 03:05:04,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:04,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:04,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 03:05:04,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 03:05:04,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:04,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:04,314 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:05:04,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525759862] [2025-01-09 03:05:04,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525759862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:04,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:05:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:05:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528790588] [2025-01-09 03:05:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:04,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:05:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:04,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:05:04,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:05:04,316 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:05:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:04,354 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2025-01-09 03:05:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:05:04,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 03:05:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:04,355 INFO L225 Difference]: With dead ends: 33 [2025-01-09 03:05:04,355 INFO L226 Difference]: Without dead ends: 20 [2025-01-09 03:05:04,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:05:04,356 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:04,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-09 03:05:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-01-09 03:05:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:05:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-01-09 03:05:04,359 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2025-01-09 03:05:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:04,359 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-01-09 03:05:04,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:05:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-01-09 03:05:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 03:05:04,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:04,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:04,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:05:04,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:04,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 502677559, now seen corresponding path program 1 times [2025-01-09 03:05:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:04,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411817220] [2025-01-09 03:05:04,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:04,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 03:05:04,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 03:05:04,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:04,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:05:04,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:04,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411817220] [2025-01-09 03:05:04,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411817220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:04,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:05:04,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:05:04,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382840234] [2025-01-09 03:05:04,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:04,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:05:04,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:04,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:05:04,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:05:04,404 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:05:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:04,439 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2025-01-09 03:05:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:05:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) Word has length 15 [2025-01-09 03:05:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:04,440 INFO L225 Difference]: With dead ends: 36 [2025-01-09 03:05:04,440 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 03:05:04,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:05:04,441 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:04,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 03:05:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2025-01-09 03:05:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 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:05:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-01-09 03:05:04,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2025-01-09 03:05:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:04,445 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-01-09 03:05:04,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:05:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-01-09 03:05:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 03:05:04,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:04,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:04,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:05:04,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:04,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash 559935861, now seen corresponding path program 1 times [2025-01-09 03:05:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:04,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583551554] [2025-01-09 03:05:04,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:04,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:04,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 03:05:04,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 03:05:04,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:04,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:04,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583551554] [2025-01-09 03:05:04,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583551554] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:04,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465974341] [2025-01-09 03:05:04,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:04,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:04,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:04,556 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:05:04,557 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:05:04,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 03:05:04,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 03:05:04,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:04,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:04,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:05:04,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:04,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:04,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465974341] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:04,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:04,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-09 03:05:04,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433092] [2025-01-09 03:05:04,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:04,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:05:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:04,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:05:04,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:05:04,753 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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:05:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:04,820 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2025-01-09 03:05:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:05:04,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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 15 [2025-01-09 03:05:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:04,821 INFO L225 Difference]: With dead ends: 43 [2025-01-09 03:05:04,821 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 03:05:04,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:05:04,822 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:04,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 25 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 03:05:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 03:05:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 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:05:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-01-09 03:05:04,828 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 15 [2025-01-09 03:05:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:04,828 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-01-09 03:05:04,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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:05:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-01-09 03:05:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 03:05:04,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:04,828 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:04,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:05:05,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:05,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:05,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1119654170, now seen corresponding path program 2 times [2025-01-09 03:05:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:05,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854595105] [2025-01-09 03:05:05,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:05:05,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:05,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 03:05:05,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:05:05,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:05:05,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:05:05,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:05,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854595105] [2025-01-09 03:05:05,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854595105] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:05,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787217480] [2025-01-09 03:05:05,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:05:05,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:05,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:05,162 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:05:05,163 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:05:05,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 03:05:05,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:05:05,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:05:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:05,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 03:05:05,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:05:05,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:05:05,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787217480] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:05,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:05,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-01-09 03:05:05,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133506301] [2025-01-09 03:05:05,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:05,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:05:05,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:05,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:05:05,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:05:05,363 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 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:05:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:05,595 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2025-01-09 03:05:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:05:05,596 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 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 24 [2025-01-09 03:05:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:05,596 INFO L225 Difference]: With dead ends: 102 [2025-01-09 03:05:05,596 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 03:05:05,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-01-09 03:05:05,597 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 88 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:05,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 90 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:05:05,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 03:05:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2025-01-09 03:05:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 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:05:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2025-01-09 03:05:05,611 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 24 [2025-01-09 03:05:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:05,611 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2025-01-09 03:05:05,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 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:05:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2025-01-09 03:05:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 03:05:05,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:05,612 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:05,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:05:05,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:05,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:05,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1216130406, now seen corresponding path program 1 times [2025-01-09 03:05:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351216963] [2025-01-09 03:05:05,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:05,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:05,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 03:05:05,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:05:05,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:05,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:05:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:05,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351216963] [2025-01-09 03:05:05,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351216963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:05,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:05:05,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:05:05,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316942940] [2025-01-09 03:05:05,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:05,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:05:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:05,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:05:05,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:05:05,879 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:05:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:05,906 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2025-01-09 03:05:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:05:05,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) Word has length 24 [2025-01-09 03:05:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:05,921 INFO L225 Difference]: With dead ends: 146 [2025-01-09 03:05:05,921 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 03:05:05,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:05:05,922 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:05,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 03:05:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-01-09 03:05:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 0 states have call successors, (0), 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:05:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2025-01-09 03:05:05,934 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 24 [2025-01-09 03:05:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:05,935 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-01-09 03:05:05,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:05:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2025-01-09 03:05:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 03:05:05,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:05,935 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:05,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:05:05,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:05,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:05,936 INFO L85 PathProgramCache]: Analyzing trace with hash 401195606, now seen corresponding path program 1 times [2025-01-09 03:05:05,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:05,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248148727] [2025-01-09 03:05:05,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:05,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 03:05:05,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 03:05:05,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:05,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:06,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248148727] [2025-01-09 03:05:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248148727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324095140] [2025-01-09 03:05:06,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:06,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:06,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:06,058 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:05:06,060 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:05:06,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 03:05:06,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 03:05:06,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:06,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:06,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:05:06,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:06,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:06,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324095140] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:06,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:06,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-01-09 03:05:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197311742] [2025-01-09 03:05:06,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:06,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 03:05:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:06,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 03:05:06,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:05:06,291 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:05:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:06,430 INFO L93 Difference]: Finished difference Result 224 states and 308 transitions. [2025-01-09 03:05:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:05:06,430 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 03:05:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:06,431 INFO L225 Difference]: With dead ends: 224 [2025-01-09 03:05:06,431 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 03:05:06,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-01-09 03:05:06,434 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 95 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:06,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 36 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:05:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 03:05:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-01-09 03:05:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.2684563758389262) internal successors, (189), 149 states have internal predecessors, (189), 0 states have call successors, (0), 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:05:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 189 transitions. [2025-01-09 03:05:06,452 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 189 transitions. Word has length 25 [2025-01-09 03:05:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:06,452 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 189 transitions. [2025-01-09 03:05:06,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:05:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2025-01-09 03:05:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 03:05:06,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:06,453 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:06,459 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:05:06,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:06,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:06,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:06,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1363870710, now seen corresponding path program 2 times [2025-01-09 03:05:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:06,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116523541] [2025-01-09 03:05:06,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:05:06,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:06,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-09 03:05:06,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 03:05:06,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:05:06,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:06,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116523541] [2025-01-09 03:05:06,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116523541] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702807160] [2025-01-09 03:05:06,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:05:06,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:06,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:06,875 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:05:06,877 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:05:06,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-09 03:05:06,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 03:05:06,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:05:06,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:06,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:05:06,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:07,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702807160] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:07,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:07,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-01-09 03:05:07,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746668345] [2025-01-09 03:05:07,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:07,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 03:05:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:07,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 03:05:07,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=678, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 03:05:07,315 INFO L87 Difference]: Start difference. First operand 150 states and 189 transitions. Second operand has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 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:05:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:07,596 INFO L93 Difference]: Finished difference Result 416 states and 564 transitions. [2025-01-09 03:05:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 03:05:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 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 43 [2025-01-09 03:05:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:07,599 INFO L225 Difference]: With dead ends: 416 [2025-01-09 03:05:07,599 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 03:05:07,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 03:05:07,600 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 121 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:07,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 42 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:05:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 03:05:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-01-09 03:05:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.2602230483271375) internal successors, (339), 269 states have internal predecessors, (339), 0 states have call successors, (0), 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:05:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 339 transitions. [2025-01-09 03:05:07,617 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 339 transitions. Word has length 43 [2025-01-09 03:05:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:07,617 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 339 transitions. [2025-01-09 03:05:07,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 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:05:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 339 transitions. [2025-01-09 03:05:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:05:07,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:07,619 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:07,627 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:05:07,819 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,SelfDestructingSolverStorable7 [2025-01-09 03:05:07,820 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:07,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash -978562730, now seen corresponding path program 3 times [2025-01-09 03:05:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:07,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152216449] [2025-01-09 03:05:07,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:05:07,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:07,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 21 equivalence classes. [2025-01-09 03:05:07,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 73 statements. [2025-01-09 03:05:07,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 03:05:07,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-01-09 03:05:07,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:07,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152216449] [2025-01-09 03:05:07,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152216449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:07,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:05:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:05:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539901639] [2025-01-09 03:05:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:07,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:05:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:07,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:05:07,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:05:07,878 INFO L87 Difference]: Start difference. First operand 270 states and 339 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:05:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:07,902 INFO L93 Difference]: Finished difference Result 272 states and 340 transitions. [2025-01-09 03:05:07,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:05:07,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 03:05:07,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:07,903 INFO L225 Difference]: With dead ends: 272 [2025-01-09 03:05:07,903 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 03:05:07,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:05:07,904 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:07,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 19 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:07,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 03:05:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-01-09 03:05:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.325) internal successors, (265), 200 states have internal predecessors, (265), 0 states have call successors, (0), 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:05:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 265 transitions. [2025-01-09 03:05:07,913 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 265 transitions. Word has length 73 [2025-01-09 03:05:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:07,913 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 265 transitions. [2025-01-09 03:05:07,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:05:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 265 transitions. [2025-01-09 03:05:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:05:07,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:07,914 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:07,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:05:07,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:07,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash 325243478, now seen corresponding path program 1 times [2025-01-09 03:05:07,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:07,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121910179] [2025-01-09 03:05:07,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:07,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:07,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:05:07,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:05:07,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:07,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 03:05:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121910179] [2025-01-09 03:05:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121910179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:08,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:05:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 03:05:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216100284] [2025-01-09 03:05:08,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:08,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 03:05:08,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:08,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 03:05:08,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:05:08,431 INFO L87 Difference]: Start difference. First operand 201 states and 265 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 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:05:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:08,746 INFO L93 Difference]: Finished difference Result 920 states and 1234 transitions. [2025-01-09 03:05:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 03:05:08,746 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 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 73 [2025-01-09 03:05:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:08,748 INFO L225 Difference]: With dead ends: 920 [2025-01-09 03:05:08,748 INFO L226 Difference]: Without dead ends: 792 [2025-01-09 03:05:08,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:05:08,749 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 265 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:08,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 86 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:05:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-01-09 03:05:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 203. [2025-01-09 03:05:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.2376237623762376) internal successors, (250), 202 states have internal predecessors, (250), 0 states have call successors, (0), 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:05:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2025-01-09 03:05:08,772 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 73 [2025-01-09 03:05:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:08,772 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2025-01-09 03:05:08,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 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:05:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2025-01-09 03:05:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:05:08,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:08,776 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:08,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:05:08,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:08,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2100250840, now seen corresponding path program 1 times [2025-01-09 03:05:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:08,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989154699] [2025-01-09 03:05:08,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:08,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:05:08,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:05:08,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:08,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989154699] [2025-01-09 03:05:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989154699] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081094379] [2025-01-09 03:05:09,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:09,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:09,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:09,484 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:05:09,484 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:05:09,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:05:09,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:05:09,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:09,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:09,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 03:05:09,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:10,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:05:11,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081094379] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:11,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:11,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 73 [2025-01-09 03:05:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46326028] [2025-01-09 03:05:11,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:11,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-01-09 03:05:11,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:11,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-01-09 03:05:11,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1574, Invalid=3828, Unknown=0, NotChecked=0, Total=5402 [2025-01-09 03:05:11,395 INFO L87 Difference]: Start difference. First operand 203 states and 250 transitions. Second operand has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 0 states have call successors, (0), 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:05:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:12,994 INFO L93 Difference]: Finished difference Result 575 states and 712 transitions. [2025-01-09 03:05:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-01-09 03:05:12,994 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 0 states have call successors, (0), 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 73 [2025-01-09 03:05:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:12,996 INFO L225 Difference]: With dead ends: 575 [2025-01-09 03:05:12,996 INFO L226 Difference]: Without dead ends: 573 [2025-01-09 03:05:13,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5713 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3429, Invalid=11091, Unknown=0, NotChecked=0, Total=14520 [2025-01-09 03:05:13,002 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 408 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:13,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 68 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:05:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-01-09 03:05:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 544. [2025-01-09 03:05:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.2357274401473297) internal successors, (671), 543 states have internal predecessors, (671), 0 states have call successors, (0), 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:05:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 671 transitions. [2025-01-09 03:05:13,037 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 671 transitions. Word has length 73 [2025-01-09 03:05:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:13,038 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 671 transitions. [2025-01-09 03:05:13,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 0 states have call successors, (0), 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:05:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 671 transitions. [2025-01-09 03:05:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:05:13,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:13,039 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:13,045 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:05:13,243 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,SelfDestructingSolverStorable10 [2025-01-09 03:05:13,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:13,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2100191258, now seen corresponding path program 1 times [2025-01-09 03:05:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:13,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580709522] [2025-01-09 03:05:13,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:13,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:13,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:05:13,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:05:13,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:13,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-01-09 03:05:13,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:13,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580709522] [2025-01-09 03:05:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580709522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:13,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:05:13,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:05:13,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054872544] [2025-01-09 03:05:13,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:13,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:05:13,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:13,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:05:13,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:05:13,322 INFO L87 Difference]: Start difference. First operand 544 states and 671 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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:05:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:13,374 INFO L93 Difference]: Finished difference Result 966 states and 1197 transitions. [2025-01-09 03:05:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:05:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 73 [2025-01-09 03:05:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:13,377 INFO L225 Difference]: With dead ends: 966 [2025-01-09 03:05:13,377 INFO L226 Difference]: Without dead ends: 767 [2025-01-09 03:05:13,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:05:13,378 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:13,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-01-09 03:05:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 765. [2025-01-09 03:05:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.2382198952879582) internal successors, (946), 764 states have internal predecessors, (946), 0 states have call successors, (0), 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:05:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 946 transitions. [2025-01-09 03:05:13,416 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 946 transitions. Word has length 73 [2025-01-09 03:05:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:13,417 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 946 transitions. [2025-01-09 03:05:13,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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:05:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 946 transitions. [2025-01-09 03:05:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:05:13,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:13,417 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:13,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:05:13,418 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:13,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:13,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2009800170, now seen corresponding path program 1 times [2025-01-09 03:05:13,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:13,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491340037] [2025-01-09 03:05:13,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:13,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:13,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:05:13,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:05:13,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:13,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-01-09 03:05:13,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491340037] [2025-01-09 03:05:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491340037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:13,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:05:13,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:05:13,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006918158] [2025-01-09 03:05:13,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:13,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:05:13,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:13,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:05:13,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:05:13,486 INFO L87 Difference]: Start difference. First operand 765 states and 946 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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:05:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:13,610 INFO L93 Difference]: Finished difference Result 1189 states and 1473 transitions. [2025-01-09 03:05:13,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:05:13,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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) Word has length 73 [2025-01-09 03:05:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:13,614 INFO L225 Difference]: With dead ends: 1189 [2025-01-09 03:05:13,614 INFO L226 Difference]: Without dead ends: 990 [2025-01-09 03:05:13,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:05:13,614 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:13,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 43 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-01-09 03:05:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 843. [2025-01-09 03:05:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.2458432304038005) internal successors, (1049), 842 states have internal predecessors, (1049), 0 states have call successors, (0), 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:05:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1049 transitions. [2025-01-09 03:05:13,684 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1049 transitions. Word has length 73 [2025-01-09 03:05:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:13,684 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1049 transitions. [2025-01-09 03:05:13,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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:05:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1049 transitions. [2025-01-09 03:05:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 03:05:13,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:13,685 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:13,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:05:13,686 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:13,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1758564218, now seen corresponding path program 1 times [2025-01-09 03:05:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:13,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830768695] [2025-01-09 03:05:13,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:13,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:05:13,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:05:13,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:13,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2025-01-09 03:05:13,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:13,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830768695] [2025-01-09 03:05:13,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830768695] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:13,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808730262] [2025-01-09 03:05:13,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:13,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:13,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:13,788 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:05:13,796 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:05:13,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:05:13,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:05:13,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:13,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:13,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 03:05:13,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2025-01-09 03:05:14,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2025-01-09 03:05:14,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808730262] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:14,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:14,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-09 03:05:14,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136422732] [2025-01-09 03:05:14,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:14,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:05:14,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:14,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:05:14,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:05:14,413 INFO L87 Difference]: Start difference. First operand 843 states and 1049 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 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:05:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:14,600 INFO L93 Difference]: Finished difference Result 2081 states and 2589 transitions. [2025-01-09 03:05:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:05:14,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 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 142 [2025-01-09 03:05:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:14,606 INFO L225 Difference]: With dead ends: 2081 [2025-01-09 03:05:14,606 INFO L226 Difference]: Without dead ends: 1882 [2025-01-09 03:05:14,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=140, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:05:14,607 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 276 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:14,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 106 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:05:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2025-01-09 03:05:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1155. [2025-01-09 03:05:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2660311958405546) internal successors, (1461), 1154 states have internal predecessors, (1461), 0 states have call successors, (0), 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:05:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1461 transitions. [2025-01-09 03:05:14,666 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1461 transitions. Word has length 142 [2025-01-09 03:05:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:14,666 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1461 transitions. [2025-01-09 03:05:14,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 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:05:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1461 transitions. [2025-01-09 03:05:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 03:05:14,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:14,668 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 39, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:14,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 03:05:14,868 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,SelfDestructingSolverStorable13 [2025-01-09 03:05:14,869 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:14,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:14,869 INFO L85 PathProgramCache]: Analyzing trace with hash -977622675, now seen corresponding path program 1 times [2025-01-09 03:05:14,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:14,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065568478] [2025-01-09 03:05:14,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:14,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:14,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:05:14,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:05:14,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:14,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 721 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2025-01-09 03:05:15,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065568478] [2025-01-09 03:05:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065568478] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140161071] [2025-01-09 03:05:15,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:05:15,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:15,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:15,266 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:05:15,269 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:05:15,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:05:15,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:05:15,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:15,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:15,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 03:05:15,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1959 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2025-01-09 03:05:15,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:05:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140161071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:05:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:05:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [23] total 44 [2025-01-09 03:05:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017027491] [2025-01-09 03:05:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:05:15,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 03:05:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:15,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 03:05:15,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 03:05:15,918 INFO L87 Difference]: Start difference. First operand 1155 states and 1461 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 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:05:16,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:16,139 INFO L93 Difference]: Finished difference Result 2101 states and 2653 transitions. [2025-01-09 03:05:16,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 03:05:16,140 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 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 145 [2025-01-09 03:05:16,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:16,152 INFO L225 Difference]: With dead ends: 2101 [2025-01-09 03:05:16,152 INFO L226 Difference]: Without dead ends: 876 [2025-01-09 03:05:16,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 03:05:16,161 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:16,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 39 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:05:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-01-09 03:05:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 810. [2025-01-09 03:05:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 1.1137206427688504) internal successors, (901), 809 states have internal predecessors, (901), 0 states have call successors, (0), 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:05:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 901 transitions. [2025-01-09 03:05:16,239 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 901 transitions. Word has length 145 [2025-01-09 03:05:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:16,239 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 901 transitions. [2025-01-09 03:05:16,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 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:05:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 901 transitions. [2025-01-09 03:05:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-01-09 03:05:16,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:16,247 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:16,255 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:05:16,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:16,450 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:16,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash -319855482, now seen corresponding path program 2 times [2025-01-09 03:05:16,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:16,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882734523] [2025-01-09 03:05:16,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:05:16,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:16,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 418 statements into 2 equivalence classes. [2025-01-09 03:05:16,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 418 of 418 statements. [2025-01-09 03:05:16,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:05:16,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2025-01-09 03:05:16,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882734523] [2025-01-09 03:05:16,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882734523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412604350] [2025-01-09 03:05:16,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:05:16,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:16,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:16,774 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:05:16,779 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:05:16,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 418 statements into 2 equivalence classes. [2025-01-09 03:05:16,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 418 of 418 statements. [2025-01-09 03:05:16,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:05:16,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:16,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 03:05:16,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2025-01-09 03:05:17,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2025-01-09 03:05:18,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412604350] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:18,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:18,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 03:05:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742344357] [2025-01-09 03:05:18,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:18,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 03:05:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:18,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 03:05:18,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2025-01-09 03:05:18,165 INFO L87 Difference]: Start difference. First operand 810 states and 901 transitions. Second operand has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 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:05:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:18,432 INFO L93 Difference]: Finished difference Result 2567 states and 3037 transitions. [2025-01-09 03:05:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 03:05:18,433 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 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 418 [2025-01-09 03:05:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:18,436 INFO L225 Difference]: With dead ends: 2567 [2025-01-09 03:05:18,436 INFO L226 Difference]: Without dead ends: 1362 [2025-01-09 03:05:18,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2025-01-09 03:05:18,439 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 257 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:18,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 179 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:05:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-01-09 03:05:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2025-01-09 03:05:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1361 states have (on average 1.073475385745775) internal successors, (1461), 1361 states have internal predecessors, (1461), 0 states have call successors, (0), 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:05:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1461 transitions. [2025-01-09 03:05:18,515 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1461 transitions. Word has length 418 [2025-01-09 03:05:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:18,515 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1461 transitions. [2025-01-09 03:05:18,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 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:05:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1461 transitions. [2025-01-09 03:05:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2025-01-09 03:05:18,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:18,528 INFO L218 NwaCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:18,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 03:05:18,732 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,SelfDestructingSolverStorable15 [2025-01-09 03:05:18,732 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:18,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash 401296518, now seen corresponding path program 3 times [2025-01-09 03:05:18,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:18,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866958821] [2025-01-09 03:05:18,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:05:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:18,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 970 statements into 132 equivalence classes. [2025-01-09 03:05:18,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) and asserted 970 of 970 statements. [2025-01-09 03:05:18,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2025-01-09 03:05:18,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2025-01-09 03:05:19,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:05:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866958821] [2025-01-09 03:05:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866958821] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:05:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85506872] [2025-01-09 03:05:19,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:05:19,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:19,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:05:19,955 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:05:19,956 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:05:20,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 970 statements into 132 equivalence classes. [2025-01-09 03:05:20,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) and asserted 970 of 970 statements. [2025-01-09 03:05:20,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2025-01-09 03:05:20,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:05:20,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 03:05:20,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:05:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2025-01-09 03:05:22,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:05:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2025-01-09 03:05:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85506872] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:05:23,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:05:23,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2025-01-09 03:05:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015014209] [2025-01-09 03:05:23,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:05:23,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 03:05:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:05:23,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 03:05:23,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 03:05:23,434 INFO L87 Difference]: Start difference. First operand 1362 states and 1461 transitions. Second operand has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 0 states have call successors, (0), 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:05:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:05:23,740 INFO L93 Difference]: Finished difference Result 2729 states and 3123 transitions. [2025-01-09 03:05:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 03:05:23,741 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 0 states have call successors, (0), 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 970 [2025-01-09 03:05:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:05:23,746 INFO L225 Difference]: With dead ends: 2729 [2025-01-09 03:05:23,747 INFO L226 Difference]: Without dead ends: 1776 [2025-01-09 03:05:23,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1960 GetRequests, 1908 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 03:05:23,748 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 307 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:05:23,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 236 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:05:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2025-01-09 03:05:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2025-01-09 03:05:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 1.059718309859155) internal successors, (1881), 1775 states have internal predecessors, (1881), 0 states have call successors, (0), 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:05:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1881 transitions. [2025-01-09 03:05:23,819 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1881 transitions. Word has length 970 [2025-01-09 03:05:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:05:23,820 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 1881 transitions. [2025-01-09 03:05:23,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 0 states have call successors, (0), 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:05:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1881 transitions. [2025-01-09 03:05:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2025-01-09 03:05:23,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:05:23,864 INFO L218 NwaCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:23,872 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:05:24,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:05:24,069 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:05:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:05:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2137193094, now seen corresponding path program 4 times [2025-01-09 03:05:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:05:24,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096892660] [2025-01-09 03:05:24,070 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:05:24,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:05:24,095 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1384 statements into 2 equivalence classes. [2025-01-09 03:05:24,421 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1384 of 1384 statements. [2025-01-09 03:05:24,421 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 03:05:24,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:05:24,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 03:05:24,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1384 statements into 1 equivalence classes. [2025-01-09 03:05:24,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1384 of 1384 statements. [2025-01-09 03:05:24,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:05:24,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:05:24,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 03:05:24,732 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 03:05:24,733 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:05:24,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:05:24,737 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:05:25,031 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:05:25,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:05:25 BoogieIcfgContainer [2025-01-09 03:05:25,033 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:05:25,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:05:25,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:05:25,034 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:05:25,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:05:04" (3/4) ... [2025-01-09 03:05:25,039 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 03:05:25,248 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 963. [2025-01-09 03:05:25,429 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:05:25,429 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:05:25,429 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:05:25,430 INFO L158 Benchmark]: Toolchain (without parser) took 21744.35ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 115.3MB in the beginning and 334.5MB in the end (delta: -219.2MB). Peak memory consumption was 335.6MB. Max. memory is 16.1GB. [2025-01-09 03:05:25,431 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:05:25,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.12ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 104.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:05:25,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.17ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 103.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:05:25,431 INFO L158 Benchmark]: Boogie Preprocessor took 17.13ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 102.2MB in the end (delta: 864.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:05:25,432 INFO L158 Benchmark]: RCFGBuilder took 156.01ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 90.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:05:25,432 INFO L158 Benchmark]: TraceAbstraction took 21010.92ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 90.3MB in the beginning and 422.6MB in the end (delta: -332.3MB). Peak memory consumption was 394.3MB. Max. memory is 16.1GB. [2025-01-09 03:05:25,434 INFO L158 Benchmark]: Witness Printer took 395.52ms. Allocated memory is still 696.3MB. Free memory was 422.6MB in the beginning and 334.5MB in the end (delta: 88.1MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-01-09 03:05:25,435 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.12ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 104.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.17ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 103.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.13ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 102.2MB in the end (delta: 864.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 156.01ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 90.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21010.92ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 90.3MB in the beginning and 422.6MB in the end (delta: -332.3MB). Peak memory consumption was 394.3MB. Max. memory is 16.1GB. * Witness Printer took 395.52ms. Allocated memory is still 696.3MB. Free memory was 422.6MB in the beginning and 334.5MB in the end (delta: 88.1MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [SIZE=20, last=0] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) [L6] COND FALSE !(!cond) VAL [SIZE=20, last=21] [L21] RET assume_abort_if_not(last > 0) [L22] int a=0,b=0,c=0,st=0,d=0; VAL [SIZE=20, a=0, b=0, d=0, last=21] [L24] st=1 [L25] c=0 VAL [SIZE=20, a=0, b=0, c=0, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=0, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=1, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=1, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=2, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=2, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=3, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=3, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=4, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=4, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=5, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=5, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=6, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=6, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=7, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=7, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=8, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=8, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=9, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=9, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=10, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=10, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=11, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=11, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=12, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=12, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=13, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=13, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=14, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=14, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=15, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=15, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=16, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=16, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=17, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=17, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=18, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=18, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=19, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=19, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=20, d=0, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=2, b=2, c=20, d=1, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=2, b=2, c=20, d=1, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=2, b=2, c=0, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=0, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=1, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=1, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=2, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=2, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=3, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=3, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=4, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=4, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=5, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=5, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=6, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=6, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=7, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=7, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=8, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=8, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=9, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=9, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=10, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=10, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=11, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=11, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=12, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=12, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=13, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=13, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=14, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=14, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=15, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=15, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=16, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=16, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=17, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=17, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=18, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=18, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=19, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=19, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=20, d=1, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=4, b=4, c=20, d=2, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=4, b=4, c=20, d=2, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=4, b=4, c=0, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=0, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=1, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=1, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=2, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=2, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=3, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=3, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=4, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=4, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=5, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=5, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=6, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=6, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=7, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=7, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=8, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=8, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=9, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=9, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=10, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=10, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=11, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=11, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=12, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=12, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=13, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=13, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=14, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=14, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=15, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=15, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=16, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=16, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=17, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=17, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=18, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=18, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=19, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=19, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=20, d=2, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=6, b=6, c=20, d=3, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=6, b=6, c=20, d=3, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=6, b=6, c=0, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=0, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=1, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=1, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=2, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=2, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=3, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=3, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=4, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=4, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=5, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=5, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=6, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=6, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=7, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=7, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=8, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=8, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=9, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=9, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=10, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=10, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=11, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=11, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=12, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=12, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=13, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=13, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=14, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=14, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=15, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=15, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=16, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=16, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=17, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=17, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=18, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=18, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=19, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=19, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=20, d=3, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=8, b=8, c=20, d=4, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=8, b=8, c=20, d=4, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=8, b=8, c=0, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=0, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=1, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=1, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=2, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=2, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=3, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=3, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=4, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=4, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=5, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=5, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=6, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=6, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=7, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=7, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=8, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=8, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=9, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=9, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=10, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=10, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=11, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=11, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=12, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=12, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=13, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=13, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=14, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=14, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=15, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=15, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=16, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=16, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=17, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=17, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=18, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=18, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=19, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=19, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=20, d=4, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=10, b=10, c=20, d=5, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=10, b=10, c=20, d=5, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=10, b=10, c=0, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=0, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=1, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=1, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=2, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=2, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=3, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=3, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=4, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=4, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=5, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=5, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=6, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=6, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=7, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=7, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=8, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=8, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=9, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=9, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=10, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=10, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=11, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=11, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=12, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=12, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=13, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=13, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=14, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=14, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=15, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=15, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=16, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=16, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=17, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=17, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=18, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=18, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=19, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=19, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=20, d=5, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=12, b=12, c=20, d=6, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=12, b=12, c=20, d=6, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=12, b=12, c=0, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=0, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=1, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=1, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=2, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=2, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=3, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=3, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=4, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=4, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=5, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=5, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=6, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=6, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=7, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=7, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=8, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=8, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=9, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=9, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=10, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=10, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=11, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=11, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=12, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=12, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=13, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=13, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=14, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=14, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=15, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=15, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=16, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=16, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=17, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=17, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=18, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=18, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=19, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=19, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=20, d=6, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=14, b=14, c=20, d=7, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=14, b=14, c=20, d=7, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=14, b=14, c=0, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=0, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=1, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=1, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=2, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=2, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=3, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=3, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=4, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=4, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=5, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=5, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=6, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=6, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=7, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=7, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=8, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=8, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=9, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=9, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=10, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=10, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=11, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=11, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=12, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=12, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=13, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=13, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=14, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=14, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=15, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=15, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=16, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=16, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=17, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=17, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=18, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=18, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=19, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=19, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=20, d=7, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=16, b=16, c=20, d=8, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=16, b=16, c=20, d=8, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=16, b=16, c=0, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=0, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=1, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=1, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=2, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=2, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=3, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=3, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=4, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=4, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=5, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=5, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=6, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=6, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=7, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=7, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=8, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=8, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=9, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=9, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=10, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=10, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=11, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=11, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=12, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=12, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=13, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=13, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=14, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=14, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=15, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=15, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=16, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=16, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=17, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=17, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=18, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=18, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=19, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=19, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=20, d=8, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=18, b=18, c=20, d=9, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=18, b=18, c=20, d=9, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=18, b=18, c=0, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=0, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=1, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=1, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=2, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=2, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=3, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=3, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=4, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=4, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=5, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=5, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=6, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=6, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=7, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=7, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=8, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=8, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=9, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=9, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=10, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=10, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=11, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=11, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=12, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=12, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=13, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=13, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=14, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=14, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=15, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=15, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=16, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=16, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=17, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=17, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=18, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=18, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=19, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=19, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=20, d=9, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=20, b=20, c=20, d=10, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=20, b=20, c=20, d=10, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=20, b=20, c=0, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=0, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=1, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=1, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=2, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=2, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=3, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=3, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=4, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=4, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=5, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=5, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=6, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=6, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=7, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=7, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=8, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=8, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=9, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=9, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=10, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=10, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=11, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=11, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=12, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=12, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=13, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=13, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=14, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=14, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=15, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=15, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=16, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=16, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=17, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=17, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=18, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=18, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=19, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=19, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=20, d=10, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=22, b=22, c=20, d=11, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=22, b=22, c=20, d=11, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=22, b=22, c=0, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=0, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=1, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=1, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=2, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=2, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=3, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=3, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=4, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=4, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=5, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=5, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=6, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=6, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=7, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=7, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=8, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=8, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=9, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=9, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=10, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=10, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=11, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=11, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=12, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=12, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=13, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=13, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=14, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=14, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=15, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=15, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=16, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=16, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=17, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=17, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=18, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=18, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=19, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=19, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=20, d=11, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=24, b=24, c=20, d=12, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=24, b=24, c=20, d=12, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=24, b=24, c=0, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=0, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=1, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=1, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=2, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=2, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=3, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=3, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=4, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=4, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=5, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=5, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=6, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=6, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=7, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=7, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=8, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=8, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=9, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=9, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=10, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=10, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=11, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=11, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=12, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=12, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=13, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=13, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=14, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=14, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=15, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=15, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=16, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=16, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=17, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=17, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=18, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=18, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=19, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=19, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=20, d=12, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=26, b=26, c=20, d=13, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=26, b=26, c=20, d=13, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=26, b=26, c=0, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=0, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=1, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=1, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=2, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=2, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=3, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=3, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=4, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=4, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=5, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=5, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=6, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=6, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=7, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=7, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=8, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=8, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=9, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=9, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=10, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=10, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=11, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=11, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=12, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=12, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=13, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=13, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=14, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=14, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=15, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=15, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=16, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=16, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=17, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=17, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=18, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=18, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=19, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=19, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=20, d=13, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=28, b=28, c=20, d=14, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=28, b=28, c=20, d=14, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=28, b=28, c=0, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=0, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=1, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=1, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=2, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=2, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=3, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=3, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=4, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=4, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=5, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=5, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=6, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=6, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=7, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=7, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=8, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=8, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=9, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=9, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=10, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=10, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=11, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=11, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=12, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=12, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=13, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=13, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=14, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=14, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=15, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=15, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=16, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=16, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=17, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=17, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=18, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=18, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=19, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=19, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=20, d=14, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=30, b=30, c=20, d=15, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=30, b=30, c=20, d=15, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=30, b=30, c=0, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=0, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=1, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=1, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=2, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=2, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=3, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=3, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=4, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=4, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=5, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=5, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=6, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=6, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=7, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=7, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=8, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=8, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=9, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=9, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=10, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=10, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=11, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=11, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=12, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=12, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=13, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=13, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=14, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=14, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=15, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=15, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=16, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=16, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=17, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=17, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=18, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=18, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=19, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=19, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=20, d=15, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=32, b=32, c=20, d=16, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=32, b=32, c=20, d=16, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=32, b=32, c=0, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=0, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=1, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=1, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=2, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=2, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=3, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=3, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=4, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=4, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=5, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=5, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=6, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=6, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=7, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=7, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=8, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=8, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=9, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=9, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=10, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=10, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=11, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=11, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=12, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=12, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=13, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=13, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=14, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=14, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=15, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=15, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=16, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=16, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=17, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=17, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=18, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=18, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=19, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=19, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=20, d=16, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=34, b=34, c=20, d=17, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=34, b=34, c=20, d=17, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=34, b=34, c=0, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=0, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=1, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=1, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=2, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=2, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=3, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=3, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=4, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=4, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=5, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=5, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=6, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=6, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=7, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=7, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=8, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=8, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=9, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=9, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=10, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=10, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=11, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=11, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=12, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=12, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=13, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=13, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=14, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=14, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=15, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=15, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=16, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=16, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=17, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=17, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=18, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=18, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=19, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=19, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=20, d=17, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=36, b=36, c=20, d=18, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=36, b=36, c=20, d=18, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=36, b=36, c=0, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=0, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=1, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=1, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=2, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=2, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=3, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=3, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=4, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=4, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=5, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=5, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=6, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=6, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=7, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=7, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=8, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=8, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=9, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=9, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=10, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=10, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=11, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=11, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=12, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=12, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=13, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=13, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=14, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=14, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=15, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=15, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=16, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=16, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=17, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=17, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=18, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=18, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=19, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=19, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=20, d=18, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=38, b=38, c=20, d=19, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=38, b=38, c=20, d=19, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=38, b=38, c=0, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=0, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=1, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=1, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=2, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=2, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=3, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=3, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=4, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=4, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=5, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=5, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=6, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=6, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=7, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=7, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=8, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=8, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=9, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=9, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=10, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=10, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=11, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=11, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=12, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=12, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=13, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=13, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=14, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=14, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=15, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=15, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=16, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=16, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=17, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=17, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=18, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=18, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=19, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=19, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=20, d=19, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=40, b=40, c=20, d=20, last=21] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [SIZE=20, a=0, b=1, c=20, d=20, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND TRUE !(cond) VAL [SIZE=20, last=21] [L12] reach_error() VAL [SIZE=20, last=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.7s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2085 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2085 mSDsluCounter, 1107 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 844 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2135 IncrementalHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 263 mSDtfsCounter, 2135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3795 GetRequests, 3404 SyntacticMatches, 14 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8369 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1776occurred in iteration=17, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1575 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 5449 NumberOfCodeBlocks, 5395 NumberOfCodeBlocksAsserted, 298 NumberOfCheckSat, 5741 ConstructedInterpolants, 0 QuantifiedInterpolants, 32791 SizeOfPredicates, 23 NumberOfNonLiveVariables, 3283 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 45341/449635 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 03:05:25,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE