./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/as2013-hybrid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-lit/as2013-hybrid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f4877babf2234c4d9f84af37e06b0d1c35e333b586df80a0a3a6ac5b1b8e2d2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:04:56,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:04:56,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:04:56,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:04:56,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:04:56,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:04:56,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:04:56,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:04:56,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:04:56,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:04:56,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:04:56,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:04:56,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:04:56,693 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:04:56,693 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:04:56,693 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:04:56,693 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:04:56,694 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:04:56,694 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:04:56,694 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:04:56,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:04:56,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:04:56,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:04:56,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:04:56,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:04:56,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:04:56,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:04:56,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:04:56,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:04:56,702 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:04:56,702 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:04:56,702 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:04:56,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:04:56,702 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:04:56,702 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:04:56,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:04:56,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:04:56,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:04:56,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:04:56,703 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:04:56,703 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) 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 -> 6f4877babf2234c4d9f84af37e06b0d1c35e333b586df80a0a3a6ac5b1b8e2d2 [2024-11-10 23:04:56,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:04:56,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:04:56,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:04:56,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:04:56,923 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:04:56,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/as2013-hybrid.i [2024-11-10 23:04:58,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:04:58,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:04:58,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.i [2024-11-10 23:04:58,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccb850c52/28ea49baeb3f458b9d044d48039690d3/FLAGaba8450f9 [2024-11-10 23:04:58,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccb850c52/28ea49baeb3f458b9d044d48039690d3 [2024-11-10 23:04:58,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:04:58,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:04:58,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:04:58,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:04:58,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:04:58,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39523b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58, skipping insertion in model container [2024-11-10 23:04:58,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:04:58,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:04:58,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:04:58,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:04:58,942 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:04:58,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58 WrapperNode [2024-11-10 23:04:58,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:04:58,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:04:58,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:04:58,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:04:58,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,963 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 43 [2024-11-10 23:04:58,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:04:58,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:04:58,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:04:58,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:04:58,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,978 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]. [2024-11-10 23:04:58,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:04:58,982 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:04:58,982 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:04:58,982 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:04:58,983 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (1/1) ... [2024-11-10 23:04:58,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:58,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:59,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:04:59,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 23:04:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:04:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:04:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:04:59,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:04:59,090 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:04:59,091 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:04:59,168 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-10 23:04:59,168 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:04:59,175 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:04:59,176 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:04:59,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:04:59 BoogieIcfgContainer [2024-11-10 23:04:59,176 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:04:59,177 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:04:59,177 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:04:59,180 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:04:59,181 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:04:59,181 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:04:58" (1/3) ... [2024-11-10 23:04:59,181 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26e064bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:04:59, skipping insertion in model container [2024-11-10 23:04:59,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:04:59,182 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:58" (2/3) ... [2024-11-10 23:04:59,182 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26e064bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:04:59, skipping insertion in model container [2024-11-10 23:04:59,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:04:59,182 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:04:59" (3/3) ... [2024-11-10 23:04:59,183 INFO L332 chiAutomizerObserver]: Analyzing ICFG as2013-hybrid.i [2024-11-10 23:04:59,222 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:04:59,223 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:04:59,223 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:04:59,223 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:04:59,223 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:04:59,223 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:04:59,223 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:04:59,223 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:04:59,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:59,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-10 23:04:59,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:59,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:59,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:04:59,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 23:04:59,242 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:04:59,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:59,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-10 23:04:59,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:59,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:59,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:04:59,246 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 23:04:59,250 INFO L745 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 16#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 2#L16true [2024-11-10 23:04:59,251 INFO L747 eck$LassoCheckResult]: Loop: 2#L16true assume true; 17#L16-2true assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 20#L19true assume !true; 21#L24true assume main_~i~0#1 > 9;main_~i~0#1 := 0; 4#L16-1true havoc main_~j~0#1; 2#L16true [2024-11-10 23:04:59,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:59,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 1 times [2024-11-10 23:04:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571877069] [2024-11-10 23:04:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:59,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:59,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:59,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:59,359 INFO L85 PathProgramCache]: Analyzing trace with hash 57222872, now seen corresponding path program 1 times [2024-11-10 23:04:59,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:59,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768446783] [2024-11-10 23:04:59,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:59,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:59,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768446783] [2024-11-10 23:04:59,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768446783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:04:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:04:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 23:04:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863951940] [2024-11-10 23:04:59,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:04:59,402 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:04:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:04:59,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 23:04:59,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 23:04:59,428 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:04:59,433 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-10 23:04:59,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2024-11-10 23:04:59,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-10 23:04:59,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 14 transitions. [2024-11-10 23:04:59,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 23:04:59,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 23:04:59,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2024-11-10 23:04:59,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:04:59,438 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-10 23:04:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2024-11-10 23:04:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-10 23:04:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-10 23:04:59,455 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-10 23:04:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 23:04:59,461 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-10 23:04:59,461 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:04:59,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2024-11-10 23:04:59,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-10 23:04:59,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:59,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:59,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:04:59,462 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-10 23:04:59,462 INFO L745 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 54#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 46#L16 [2024-11-10 23:04:59,462 INFO L747 eck$LassoCheckResult]: Loop: 46#L16 assume true; 47#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 57#L19 assume true; 55#L19-1 assume !(main_~j~0#1 < 10); 56#L24 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 50#L16-1 havoc main_~j~0#1; 46#L16 [2024-11-10 23:04:59,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:59,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 2 times [2024-11-10 23:04:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947132670] [2024-11-10 23:04:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:59,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:59,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:59,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:59,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:59,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1773895612, now seen corresponding path program 1 times [2024-11-10 23:04:59,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:59,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82975557] [2024-11-10 23:04:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:59,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82975557] [2024-11-10 23:04:59,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82975557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:04:59,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:04:59,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 23:04:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703168187] [2024-11-10 23:04:59,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:04:59,526 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:04:59,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:04:59,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 23:04:59,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 23:04:59,528 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:04:59,547 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-10 23:04:59,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2024-11-10 23:04:59,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-10 23:04:59,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2024-11-10 23:04:59,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-10 23:04:59,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-10 23:04:59,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2024-11-10 23:04:59,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:04:59,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-10 23:04:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2024-11-10 23:04:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2024-11-10 23:04:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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) [2024-11-10 23:04:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-10 23:04:59,550 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-10 23:04:59,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 23:04:59,555 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-10 23:04:59,555 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:04:59,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2024-11-10 23:04:59,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-10 23:04:59,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:59,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:59,556 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:04:59,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:04:59,560 INFO L745 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 88#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 82#L16 [2024-11-10 23:04:59,561 INFO L747 eck$LassoCheckResult]: Loop: 82#L16 assume true; 83#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 92#L19 assume true; 91#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 84#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 85#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 89#L13 assume !(0 == __VERIFIER_assert_~cond#1); 90#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 93#L19 assume true; 95#L19-1 assume !(main_~j~0#1 < 10); 94#L24 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 86#L16-1 havoc main_~j~0#1; 82#L16 [2024-11-10 23:04:59,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 3 times [2024-11-10 23:04:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:59,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892312577] [2024-11-10 23:04:59,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:59,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:59,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:59,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1720090383, now seen corresponding path program 1 times [2024-11-10 23:04:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:59,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58144567] [2024-11-10 23:04:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:59,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:59,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58144567] [2024-11-10 23:04:59,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58144567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:04:59,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576647372] [2024-11-10 23:04:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:59,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:04:59,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:59,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:04:59,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 23:04:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:59,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 23:04:59,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:04:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:59,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:04:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:59,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576647372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:04:59,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:04:59,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 23:04:59,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644884450] [2024-11-10 23:04:59,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:04:59,770 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:04:59,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:04:59,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 23:04:59,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 23:04:59,772 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:04:59,804 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-10 23:04:59,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2024-11-10 23:04:59,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-10 23:04:59,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 34 transitions. [2024-11-10 23:04:59,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-10 23:04:59,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-10 23:04:59,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2024-11-10 23:04:59,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:04:59,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-11-10 23:04:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2024-11-10 23:04:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-10 23:04:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.0625) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:04:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-11-10 23:04:59,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-11-10 23:04:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 23:04:59,813 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-11-10 23:04:59,813 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 23:04:59,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 34 transitions. [2024-11-10 23:04:59,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-10 23:04:59,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:59,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:59,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:04:59,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-10 23:04:59,816 INFO L745 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 211#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 203#L16 [2024-11-10 23:04:59,816 INFO L747 eck$LassoCheckResult]: Loop: 203#L16 assume true; 204#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 214#L19 assume true; 234#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 233#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 212#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 208#L13 assume !(0 == __VERIFIER_assert_~cond#1); 209#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 215#L19 assume true; 213#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 205#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 206#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 232#L13 assume !(0 == __VERIFIER_assert_~cond#1); 231#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 230#L19 assume true; 229#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 228#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 227#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 226#L13 assume !(0 == __VERIFIER_assert_~cond#1); 225#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 224#L19 assume true; 223#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 218#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 222#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 221#L13 assume !(0 == __VERIFIER_assert_~cond#1); 220#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 219#L19 assume true; 217#L19-1 assume !(main_~j~0#1 < 10); 216#L24 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 207#L16-1 havoc main_~j~0#1; 203#L16 [2024-11-10 23:04:59,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 4 times [2024-11-10 23:04:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:59,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909219757] [2024-11-10 23:04:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:59,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:59,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:59,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:59,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:59,827 INFO L85 PathProgramCache]: Analyzing trace with hash 421658504, now seen corresponding path program 2 times [2024-11-10 23:04:59,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:59,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872069270] [2024-11-10 23:04:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:59,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:04:59,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872069270] [2024-11-10 23:04:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872069270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:04:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941445183] [2024-11-10 23:04:59,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 23:04:59,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:04:59,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:59,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:04:59,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 23:05:00,050 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 23:05:00,050 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:05:00,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 23:05:00,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:00,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:00,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941445183] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:00,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:00,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-10 23:05:00,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525875553] [2024-11-10 23:05:00,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:00,226 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:00,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:00,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 23:05:00,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-10 23:05:00,227 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. cyclomatic complexity: 3 Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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) [2024-11-10 23:05:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:00,283 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2024-11-10 23:05:00,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 70 transitions. [2024-11-10 23:05:00,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2024-11-10 23:05:00,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 70 transitions. [2024-11-10 23:05:00,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2024-11-10 23:05:00,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2024-11-10 23:05:00,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 70 transitions. [2024-11-10 23:05:00,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:00,289 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-10 23:05:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 70 transitions. [2024-11-10 23:05:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-10 23:05:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 67 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2024-11-10 23:05:00,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-10 23:05:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 23:05:00,297 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-10 23:05:00,298 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 23:05:00,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2024-11-10 23:05:00,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2024-11-10 23:05:00,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:00,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:00,302 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:00,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-11-10 23:05:00,302 INFO L745 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 498#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 492#L16 [2024-11-10 23:05:00,302 INFO L747 eck$LassoCheckResult]: Loop: 492#L16 assume true; 493#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 503#L19 assume true; 559#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 558#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 501#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 499#L13 assume !(0 == __VERIFIER_assert_~cond#1); 500#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 504#L19 assume true; 502#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 494#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 495#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 557#L13 assume !(0 == __VERIFIER_assert_~cond#1); 556#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 555#L19 assume true; 554#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 553#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 552#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 551#L13 assume !(0 == __VERIFIER_assert_~cond#1); 550#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 549#L19 assume true; 548#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 547#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 546#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 545#L13 assume !(0 == __VERIFIER_assert_~cond#1); 544#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 543#L19 assume true; 542#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 541#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 540#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 539#L13 assume !(0 == __VERIFIER_assert_~cond#1); 538#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 537#L19 assume true; 536#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 535#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 534#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 533#L13 assume !(0 == __VERIFIER_assert_~cond#1); 532#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 531#L19 assume true; 530#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 529#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 528#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 527#L13 assume !(0 == __VERIFIER_assert_~cond#1); 526#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 525#L19 assume true; 524#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 523#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 522#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 521#L13 assume !(0 == __VERIFIER_assert_~cond#1); 520#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 519#L19 assume true; 518#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 517#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 516#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 515#L13 assume !(0 == __VERIFIER_assert_~cond#1); 514#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 513#L19 assume true; 512#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 507#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 511#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 510#L13 assume !(0 == __VERIFIER_assert_~cond#1); 509#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 508#L19 assume true; 506#L19-1 assume !(main_~j~0#1 < 10); 505#L24 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 496#L16-1 havoc main_~j~0#1; 492#L16 [2024-11-10 23:05:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 5 times [2024-11-10 23:05:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304009695] [2024-11-10 23:05:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:00,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:00,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:00,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:00,325 INFO L85 PathProgramCache]: Analyzing trace with hash -694932550, now seen corresponding path program 3 times [2024-11-10 23:05:00,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:00,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454224122] [2024-11-10 23:05:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:00,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:00,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:00,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:00,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1904132135, now seen corresponding path program 1 times [2024-11-10 23:05:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:00,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703177110] [2024-11-10 23:05:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:00,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-10 23:05:00,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:00,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703177110] [2024-11-10 23:05:00,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703177110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:05:00,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:05:00,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 23:05:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628167149] [2024-11-10 23:05:00,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:05:01,148 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:01,149 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:01,149 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:01,149 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:01,149 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:05:01,149 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:01,149 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:01,149 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:01,149 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration5_Loop [2024-11-10 23:05:01,149 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:01,150 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:01,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,210 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:01,211 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:05:01,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:01,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:01,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:01,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 23:05:01,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:01,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:01,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-10 23:05:01,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:01,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:01,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:01,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 23:05:01,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:05:01,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:01,263 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:05:01,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-10 23:05:01,275 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:01,275 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:01,275 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:01,275 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:01,275 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:05:01,275 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:01,275 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:01,275 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:01,275 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration5_Loop [2024-11-10 23:05:01,275 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:01,275 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:01,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:01,308 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:01,311 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:05:01,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:01,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:01,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:01,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 23:05:01,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:01,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:01,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:01,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:01,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:01,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:01,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:01,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:01,331 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:05:01,334 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-10 23:05:01,334 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:05:01,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:01,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:01,337 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:01,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 23:05:01,340 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:05:01,340 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:05:01,340 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:05:01,341 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 23:05:01,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 23:05:01,358 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:05:01,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:01,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:05:01,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:01,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 23:05:01,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-10 23:05:01,546 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-10 23:05:01,547 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 70 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:01,588 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 70 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 207 states and 213 transitions. Complement of second has 7 states. [2024-11-10 23:05:01,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:05:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:01,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-10 23:05:01,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 66 letters. [2024-11-10 23:05:01,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:01,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 68 letters. Loop has 66 letters. [2024-11-10 23:05:01,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:01,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 132 letters. [2024-11-10 23:05:01,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:01,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 213 transitions. [2024-11-10 23:05:01,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2024-11-10 23:05:01,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 204 states and 210 transitions. [2024-11-10 23:05:01,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2024-11-10 23:05:01,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2024-11-10 23:05:01,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 210 transitions. [2024-11-10 23:05:01,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:05:01,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 204 states and 210 transitions. [2024-11-10 23:05:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 210 transitions. [2024-11-10 23:05:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2024-11-10 23:05:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 200 states have (on average 1.03) internal successors, (206), 199 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) [2024-11-10 23:05:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 206 transitions. [2024-11-10 23:05:01,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 200 states and 206 transitions. [2024-11-10 23:05:01,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:01,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 23:05:01,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 23:05:01,613 INFO L87 Difference]: Start difference. First operand 200 states and 206 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:01,630 INFO L93 Difference]: Finished difference Result 266 states and 271 transitions. [2024-11-10 23:05:01,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 271 transitions. [2024-11-10 23:05:01,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 141 [2024-11-10 23:05:01,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 202 states and 206 transitions. [2024-11-10 23:05:01,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2024-11-10 23:05:01,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2024-11-10 23:05:01,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 206 transitions. [2024-11-10 23:05:01,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:01,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 202 states and 206 transitions. [2024-11-10 23:05:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 206 transitions. [2024-11-10 23:05:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 134. [2024-11-10 23:05:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.0223880597014925) internal successors, (137), 133 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2024-11-10 23:05:01,648 INFO L240 hiAutomatonCegarLoop]: Abstraction has 134 states and 137 transitions. [2024-11-10 23:05:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 23:05:01,651 INFO L425 stractBuchiCegarLoop]: Abstraction has 134 states and 137 transitions. [2024-11-10 23:05:01,651 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 23:05:01,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 137 transitions. [2024-11-10 23:05:01,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 132 [2024-11-10 23:05:01,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:01,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:01,653 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:01,653 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 20, 20, 20, 20, 20, 2, 2, 2, 2, 1, 1] [2024-11-10 23:05:01,653 INFO L745 eck$LassoCheckResult]: Stem: 1468#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 1469#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 1472#L16 [2024-11-10 23:05:01,653 INFO L747 eck$LassoCheckResult]: Loop: 1472#L16 assume true; 1475#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 1476#L19 assume true; 1596#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1595#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1473#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1470#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1471#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1477#L19 assume true; 1474#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1465#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1466#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1594#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1593#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1592#L19 assume true; 1591#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1590#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1589#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1588#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1587#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1586#L19 assume true; 1585#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1584#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1583#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1582#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1581#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1580#L19 assume true; 1579#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1578#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1577#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1576#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1575#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1574#L19 assume true; 1573#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1572#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1571#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1570#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1569#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1568#L19 assume true; 1567#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1566#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1565#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1564#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1563#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1562#L19 assume true; 1561#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1560#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1559#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1558#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1557#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1556#L19 assume true; 1555#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1554#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1553#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1552#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1551#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1550#L19 assume true; 1549#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1544#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1548#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1547#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1546#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1545#L19 assume true; 1543#L19-1 assume !(main_~j~0#1 < 10); 1478#L24 assume !(main_~i~0#1 > 9); 1467#L16-1 havoc main_~j~0#1; 1463#L16 assume true; 1464#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 1542#L19 assume true; 1541#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1540#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1539#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1538#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1537#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1536#L19 assume true; 1535#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1534#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1533#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1532#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1531#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1530#L19 assume true; 1529#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1528#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1527#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1526#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1525#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1524#L19 assume true; 1523#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1522#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1521#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1520#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1519#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1518#L19 assume true; 1517#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1516#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1515#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1514#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1513#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1512#L19 assume true; 1511#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1510#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1509#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1508#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1507#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1506#L19 assume true; 1505#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1504#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1503#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1502#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1501#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1500#L19 assume true; 1499#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1498#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1497#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1496#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1495#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1494#L19 assume true; 1493#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1492#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1491#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1490#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1489#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1488#L19 assume true; 1487#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1482#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1486#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1485#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1484#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1483#L19 assume true; 1481#L19-1 assume !(main_~j~0#1 < 10); 1479#L24 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 1480#L16-1 havoc main_~j~0#1; 1472#L16 [2024-11-10 23:05:01,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 6 times [2024-11-10 23:05:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:01,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721990105] [2024-11-10 23:05:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:01,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:01,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:01,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:01,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1557003886, now seen corresponding path program 1 times [2024-11-10 23:05:01,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:01,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739042320] [2024-11-10 23:05:01,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:01,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:01,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:01,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash -436727311, now seen corresponding path program 1 times [2024-11-10 23:05:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293808296] [2024-11-10 23:05:01,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:01,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 1 proven. 645 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-10 23:05:01,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:01,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293808296] [2024-11-10 23:05:01,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293808296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:05:01,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523749564] [2024-11-10 23:05:01,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:01,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:05:01,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:01,878 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:05:01,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 23:05:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:01,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:05:01,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:01,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 23:05:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 1 proven. 645 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-10 23:05:02,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 1 proven. 645 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-10 23:05:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523749564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:02,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-10 23:05:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850824305] [2024-11-10 23:05:02,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:03,931 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:03,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:03,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:03,932 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:03,932 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:05:03,932 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:03,932 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:03,932 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:03,932 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration6_Loop [2024-11-10 23:05:03,932 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:03,932 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:03,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:03,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:03,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:03,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:03,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:03,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:03,965 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:03,965 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:05:03,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:03,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:03,967 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:03,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 23:05:03,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:03,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:03,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:03,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:03,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:03,993 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:03,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 23:05:03,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:05:03,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:04,007 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:05:04,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-10 23:05:04,018 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:04,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:04,019 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:04,019 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:04,019 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:05:04,019 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:04,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:04,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:04,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration6_Loop [2024-11-10 23:05:04,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:04,019 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:04,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:04,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:04,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:04,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:04,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:04,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:04,055 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:04,055 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:05:04,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:04,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:04,057 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:04,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 23:05:04,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:04,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:04,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:04,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:04,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:04,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:04,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:04,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:04,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:04,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:04,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:04,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:04,083 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:04,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 23:05:04,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:04,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:04,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:04,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:04,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:04,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:04,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:04,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:04,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:05:04,098 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-10 23:05:04,098 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:05:04,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:04,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:04,099 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:04,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 23:05:04,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:05:04,101 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:05:04,101 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:05:04,101 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 23:05:04,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-10 23:05:04,111 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:05:04,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:04,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:05:04,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:04,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 23:05:04,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 1 proven. 645 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-10 23:05:04,366 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-10 23:05:04,366 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 134 states and 137 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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) [2024-11-10 23:05:04,397 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 134 states and 137 transitions. cyclomatic complexity: 4. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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) Result 405 states and 414 transitions. Complement of second has 9 states. [2024-11-10 23:05:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-10 23:05:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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) [2024-11-10 23:05:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2024-11-10 23:05:04,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 2 letters. Loop has 132 letters. [2024-11-10 23:05:04,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:04,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 134 letters. Loop has 132 letters. [2024-11-10 23:05:04,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:04,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 2 letters. Loop has 264 letters. [2024-11-10 23:05:04,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:04,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 405 states and 414 transitions. [2024-11-10 23:05:04,408 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2024-11-10 23:05:04,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 405 states to 402 states and 411 transitions. [2024-11-10 23:05:04,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 268 [2024-11-10 23:05:04,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2024-11-10 23:05:04,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 411 transitions. [2024-11-10 23:05:04,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:05:04,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 402 states and 411 transitions. [2024-11-10 23:05:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 411 transitions. [2024-11-10 23:05:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 332. [2024-11-10 23:05:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 1.0240963855421688) internal successors, (340), 331 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 340 transitions. [2024-11-10 23:05:04,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 340 transitions. [2024-11-10 23:05:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 23:05:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-10 23:05:04,422 INFO L87 Difference]: Start difference. First operand 332 states and 340 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:04,461 INFO L93 Difference]: Finished difference Result 659 states and 670 transitions. [2024-11-10 23:05:04,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 670 transitions. [2024-11-10 23:05:04,464 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 408 [2024-11-10 23:05:04,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 529 states and 538 transitions. [2024-11-10 23:05:04,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 529 [2024-11-10 23:05:04,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 529 [2024-11-10 23:05:04,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 538 transitions. [2024-11-10 23:05:04,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:04,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 529 states and 538 transitions. [2024-11-10 23:05:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 538 transitions. [2024-11-10 23:05:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 398. [2024-11-10 23:05:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 398 states have (on average 1.0175879396984924) internal successors, (405), 397 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 405 transitions. [2024-11-10 23:05:04,479 INFO L240 hiAutomatonCegarLoop]: Abstraction has 398 states and 405 transitions. [2024-11-10 23:05:04,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 23:05:04,482 INFO L425 stractBuchiCegarLoop]: Abstraction has 398 states and 405 transitions. [2024-11-10 23:05:04,482 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 23:05:04,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 398 states and 405 transitions. [2024-11-10 23:05:04,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 396 [2024-11-10 23:05:04,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:04,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:04,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:04,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [66, 60, 60, 60, 60, 60, 6, 6, 6, 6, 5, 1] [2024-11-10 23:05:04,486 INFO L745 eck$LassoCheckResult]: Stem: 4235#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 4236#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 4228#L16 [2024-11-10 23:05:04,487 INFO L747 eck$LassoCheckResult]: Loop: 4228#L16 assume true; 4229#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 4239#L19 assume true; 4238#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4231#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4232#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4237#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4619#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4618#L19 assume true; 4616#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4614#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4612#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4610#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4608#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4606#L19 assume true; 4604#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4602#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4600#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4598#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4596#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4594#L19 assume true; 4592#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4590#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4588#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4586#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4584#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4582#L19 assume true; 4580#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4578#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4576#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4574#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4572#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4570#L19 assume true; 4568#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4566#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4564#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4562#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4560#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4558#L19 assume true; 4556#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4554#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4552#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4550#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4548#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4546#L19 assume true; 4544#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4542#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4540#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4538#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4536#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4534#L19 assume true; 4532#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4530#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4528#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4526#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4524#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4522#L19 assume true; 4520#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4509#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4518#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4516#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4514#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4512#L19 assume true; 4508#L19-1 assume !(main_~j~0#1 < 10); 4241#L24 assume !(main_~i~0#1 > 9); 4242#L16-1 havoc main_~j~0#1; 4625#L16 assume true; 4624#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 4623#L19 assume true; 4622#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4621#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4620#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4233#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4234#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4240#L19 assume true; 4617#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4615#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4613#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4611#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4609#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4607#L19 assume true; 4605#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4603#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4601#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4599#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4597#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4595#L19 assume true; 4593#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4591#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4589#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4587#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4585#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4583#L19 assume true; 4581#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4579#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4577#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4575#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4573#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4571#L19 assume true; 4569#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4567#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4565#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4563#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4561#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4559#L19 assume true; 4557#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4555#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4553#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4551#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4549#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4547#L19 assume true; 4545#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4543#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4541#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4539#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4537#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4535#L19 assume true; 4533#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4531#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4529#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4527#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4525#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4523#L19 assume true; 4521#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4511#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4519#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4517#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4515#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4513#L19 assume true; 4510#L19-1 assume !(main_~j~0#1 < 10); 4507#L24 assume !(main_~i~0#1 > 9); 4506#L16-1 havoc main_~j~0#1; 4505#L16 assume true; 4504#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 4503#L19 assume true; 4502#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4501#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4500#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4499#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4498#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4497#L19 assume true; 4496#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4495#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4494#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4493#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4492#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4491#L19 assume true; 4490#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4489#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4488#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4487#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4486#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4485#L19 assume true; 4484#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4483#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4482#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4481#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4480#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4479#L19 assume true; 4478#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4477#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4476#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4475#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4474#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4473#L19 assume true; 4472#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4471#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4470#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4469#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4468#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4467#L19 assume true; 4466#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4465#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4464#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4463#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4462#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4461#L19 assume true; 4460#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4459#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4458#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4457#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4456#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4455#L19 assume true; 4454#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4453#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4452#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4451#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4450#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4449#L19 assume true; 4448#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4443#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4447#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4446#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4445#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4444#L19 assume true; 4442#L19-1 assume !(main_~j~0#1 < 10); 4441#L24 assume !(main_~i~0#1 > 9); 4440#L16-1 havoc main_~j~0#1; 4439#L16 assume true; 4438#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 4437#L19 assume true; 4436#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4435#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4434#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4433#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4432#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4431#L19 assume true; 4430#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4429#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4428#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4427#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4426#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4425#L19 assume true; 4424#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4423#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4422#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4421#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4420#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4419#L19 assume true; 4418#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4417#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4416#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4415#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4414#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4413#L19 assume true; 4412#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4411#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4410#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4409#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4408#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4407#L19 assume true; 4406#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4405#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4404#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4403#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4402#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4401#L19 assume true; 4400#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4399#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4398#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4397#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4396#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4395#L19 assume true; 4394#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4393#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4392#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4391#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4390#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4389#L19 assume true; 4388#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4387#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4386#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4385#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4384#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4383#L19 assume true; 4382#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4377#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4381#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4380#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4379#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4378#L19 assume true; 4376#L19-1 assume !(main_~j~0#1 < 10); 4375#L24 assume !(main_~i~0#1 > 9); 4374#L16-1 havoc main_~j~0#1; 4373#L16 assume true; 4372#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 4371#L19 assume true; 4370#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4369#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4368#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4367#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4366#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4365#L19 assume true; 4364#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4363#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4362#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4361#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4360#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4359#L19 assume true; 4358#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4357#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4356#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4355#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4354#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4353#L19 assume true; 4352#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4351#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4350#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4349#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4348#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4347#L19 assume true; 4346#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4345#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4344#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4343#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4342#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4341#L19 assume true; 4340#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4339#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4338#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4337#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4336#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4335#L19 assume true; 4334#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4333#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4332#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4331#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4330#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4329#L19 assume true; 4328#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4327#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4326#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4325#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4324#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4323#L19 assume true; 4322#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4321#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4320#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4319#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4318#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4317#L19 assume true; 4316#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4311#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4315#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4314#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4313#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4312#L19 assume true; 4310#L19-1 assume !(main_~j~0#1 < 10); 4309#L24 assume !(main_~i~0#1 > 9); 4244#L16-1 havoc main_~j~0#1; 4308#L16 assume true; 4307#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 4306#L19 assume true; 4305#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4304#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4303#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4302#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4301#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4300#L19 assume true; 4299#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4298#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4297#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4296#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4295#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4294#L19 assume true; 4293#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4292#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4291#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4290#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4289#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4288#L19 assume true; 4287#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4286#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4285#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4284#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4283#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4282#L19 assume true; 4281#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4280#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4279#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4278#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4277#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4276#L19 assume true; 4275#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4274#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4273#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4272#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4271#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4270#L19 assume true; 4269#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4268#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4267#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4266#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4265#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4264#L19 assume true; 4263#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4262#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4261#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4260#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4259#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4258#L19 assume true; 4257#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4256#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4255#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4254#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4253#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4252#L19 assume true; 4251#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4246#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 4250#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4249#L13 assume !(0 == __VERIFIER_assert_~cond#1); 4248#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4247#L19 assume true; 4245#L19-1 assume !(main_~j~0#1 < 10); 4243#L24 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 4230#L16-1 havoc main_~j~0#1; 4228#L16 [2024-11-10 23:05:04,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 7 times [2024-11-10 23:05:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:04,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402231747] [2024-11-10 23:05:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:04,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:04,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:04,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash 335019250, now seen corresponding path program 2 times [2024-11-10 23:05:04,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:04,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113106719] [2024-11-10 23:05:04,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:04,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:04,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:04,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1504271953, now seen corresponding path program 2 times [2024-11-10 23:05:04,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:04,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858297008] [2024-11-10 23:05:04,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:04,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:04,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 23:05:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11430 backedges. 5 proven. 9685 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 23:05:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858297008] [2024-11-10 23:05:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858297008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:05:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164175867] [2024-11-10 23:05:05,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 23:05:05,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:05:05,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:05,017 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:05:05,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 23:05:05,194 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 23:05:05,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:05:05,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 23:05:05,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 11430 backedges. 5 proven. 9685 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 23:05:05,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11430 backedges. 5 proven. 9685 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 23:05:05,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164175867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:05,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:05,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-10 23:05:05,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228379509] [2024-11-10 23:05:05,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:14,212 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 1034 DAG size of output: 726 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-10 23:05:17,566 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:17,567 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:17,567 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:17,567 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:17,567 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:05:17,567 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,567 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:17,567 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:17,567 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration7_Loop [2024-11-10 23:05:17,567 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:17,567 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:17,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,603 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:17,603 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:05:17,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,605 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 23:05:17,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:17,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:17,621 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:05:17,621 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:05:17,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 23:05:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,633 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-10 23:05:17,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:17,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:17,650 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:05:17,650 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2#1=0} Honda state: {ULTIMATE.start_main_#t~post2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:05:17,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:17,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,661 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 23:05:17,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:17,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:17,673 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:05:17,673 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:05:17,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-10 23:05:17,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,686 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 23:05:17,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:17,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:17,699 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:05:17,699 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:05:17,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:17,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,710 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 23:05:17,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:17,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:17,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-10 23:05:17,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,733 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-10 23:05:17,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:05:17,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:17,746 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:05:17,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:17,756 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:17,756 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:17,756 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:17,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:17,756 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:05:17,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:17,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:17,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration7_Loop [2024-11-10 23:05:17,756 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:17,756 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:17,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:17,788 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:17,788 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:05:17,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,789 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-10 23:05:17,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:17,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:17,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:17,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:17,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:17,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:17,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:17,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:17,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:17,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:17,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,815 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-10 23:05:17,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:17,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:17,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:17,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:17,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:17,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:17,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:17,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:17,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:17,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:17,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,838 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-10 23:05:17,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:17,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:17,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:17,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:17,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:17,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:17,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:17,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:17,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:17,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:17,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,863 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-10 23:05:17,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:17,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:17,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:17,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:17,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:17,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:17,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:17,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:17,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:17,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:17,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,887 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-10 23:05:17,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:05:17,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:17,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:17,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:17,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:17,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:17,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:17,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:17,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:05:17,903 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:05:17,903 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 23:05:17,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:17,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:17,905 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:17,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-10 23:05:17,906 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:05:17,906 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:05:17,906 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:05:17,906 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 23:05:17,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:17,918 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:05:17,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:17,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:05:17,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:18,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 23:05:18,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:18,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-10 23:05:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11430 backedges. 5 proven. 9685 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 23:05:18,516 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2024-11-10 23:05:18,516 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 398 states and 405 transitions. cyclomatic complexity: 8 Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:18,604 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 398 states and 405 transitions. cyclomatic complexity: 8. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1197 states and 1218 transitions. Complement of second has 17 states. [2024-11-10 23:05:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-11-10 23:05:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2024-11-10 23:05:18,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 72 transitions. Stem has 2 letters. Loop has 396 letters. [2024-11-10 23:05:18,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:18,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 72 transitions. Stem has 398 letters. Loop has 396 letters. [2024-11-10 23:05:18,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:18,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 72 transitions. Stem has 2 letters. Loop has 792 letters. [2024-11-10 23:05:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:18,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1197 states and 1218 transitions. [2024-11-10 23:05:18,621 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 432 [2024-11-10 23:05:18,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1197 states to 1194 states and 1215 transitions. [2024-11-10 23:05:18,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 796 [2024-11-10 23:05:18,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 798 [2024-11-10 23:05:18,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1194 states and 1215 transitions. [2024-11-10 23:05:18,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:05:18,626 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1194 states and 1215 transitions. [2024-11-10 23:05:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states and 1215 transitions. [2024-11-10 23:05:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 860. [2024-11-10 23:05:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 860 states have (on average 1.0186046511627906) internal successors, (876), 859 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 876 transitions. [2024-11-10 23:05:18,637 INFO L240 hiAutomatonCegarLoop]: Abstraction has 860 states and 876 transitions. [2024-11-10 23:05:18,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:18,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 23:05:18,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 23:05:18,638 INFO L87 Difference]: Start difference. First operand 860 states and 876 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:18,688 INFO L93 Difference]: Finished difference Result 1451 states and 1474 transitions. [2024-11-10 23:05:18,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1451 states and 1474 transitions. [2024-11-10 23:05:18,694 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 696 [2024-11-10 23:05:18,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1451 states to 1057 states and 1074 transitions. [2024-11-10 23:05:18,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1057 [2024-11-10 23:05:18,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1057 [2024-11-10 23:05:18,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1057 states and 1074 transitions. [2024-11-10 23:05:18,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:18,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1057 states and 1074 transitions. [2024-11-10 23:05:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states and 1074 transitions. [2024-11-10 23:05:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 662. [2024-11-10 23:05:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 662 states have (on average 1.0166163141993958) internal successors, (673), 661 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 673 transitions. [2024-11-10 23:05:18,708 INFO L240 hiAutomatonCegarLoop]: Abstraction has 662 states and 673 transitions. [2024-11-10 23:05:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 23:05:18,709 INFO L425 stractBuchiCegarLoop]: Abstraction has 662 states and 673 transitions. [2024-11-10 23:05:18,709 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 23:05:18,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 662 states and 673 transitions. [2024-11-10 23:05:18,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 660 [2024-11-10 23:05:18,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:18,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:18,717 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:18,717 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [110, 100, 100, 100, 100, 100, 10, 10, 10, 10, 9, 1] [2024-11-10 23:05:18,718 INFO L745 eck$LassoCheckResult]: Stem: 11770#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); 11771#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 11774#L16 [2024-11-10 23:05:18,719 INFO L747 eck$LassoCheckResult]: Loop: 11774#L16 assume true; 12426#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 12425#L19 assume true; 11775#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11767#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11768#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11772#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11773#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12421#L19 assume true; 12419#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12417#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12415#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12413#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12411#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12409#L19 assume true; 12407#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12405#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12403#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12401#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12399#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12397#L19 assume true; 12395#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12393#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12391#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12389#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12387#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12385#L19 assume true; 12383#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12381#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12379#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12377#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12375#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12373#L19 assume true; 12371#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12369#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12367#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12365#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12363#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12361#L19 assume true; 12359#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12357#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12355#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12353#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12351#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12349#L19 assume true; 12347#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12345#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12343#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12341#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12339#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12337#L19 assume true; 12335#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12333#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12331#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12329#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12327#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12325#L19 assume true; 12323#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12312#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12321#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12319#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12317#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12315#L19 assume true; 12311#L19-1 assume !(main_~j~0#1 < 10); 11780#L24 assume !(main_~i~0#1 > 9); 11769#L16-1 havoc main_~j~0#1; 11765#L16 assume true; 11766#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 11776#L19 assume true; 11777#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12424#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12423#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12422#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11778#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11779#L19 assume true; 12420#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12418#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12416#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12414#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12412#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12410#L19 assume true; 12408#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12406#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12404#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12402#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12400#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12398#L19 assume true; 12396#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12394#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12392#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12390#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12388#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12386#L19 assume true; 12384#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12382#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12380#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12378#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12376#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12374#L19 assume true; 12372#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12370#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12368#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12366#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12364#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12362#L19 assume true; 12360#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12358#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12356#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12354#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12352#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12350#L19 assume true; 12348#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12346#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12344#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12342#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12340#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12338#L19 assume true; 12336#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12334#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12332#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12330#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12328#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12326#L19 assume true; 12324#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12314#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12322#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12320#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12318#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12316#L19 assume true; 12313#L19-1 assume !(main_~j~0#1 < 10); 12310#L24 assume !(main_~i~0#1 > 9); 12309#L16-1 havoc main_~j~0#1; 12308#L16 assume true; 12307#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 12306#L19 assume true; 12305#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12304#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12303#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12302#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12301#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12300#L19 assume true; 12299#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12298#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12297#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12296#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12295#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12294#L19 assume true; 12293#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12292#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12291#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12290#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12289#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12288#L19 assume true; 12287#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12286#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12285#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12284#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12283#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12282#L19 assume true; 12281#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12280#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12279#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12278#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12277#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12276#L19 assume true; 12275#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12274#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12273#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12272#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12271#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12270#L19 assume true; 12269#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12268#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12267#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12266#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12265#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12264#L19 assume true; 12263#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12262#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12261#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12260#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12259#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12258#L19 assume true; 12257#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12256#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12255#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12254#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12253#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12252#L19 assume true; 12251#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12246#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12250#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12249#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12248#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12247#L19 assume true; 12245#L19-1 assume !(main_~j~0#1 < 10); 12244#L24 assume !(main_~i~0#1 > 9); 12243#L16-1 havoc main_~j~0#1; 12242#L16 assume true; 12241#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 12240#L19 assume true; 12239#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12238#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12237#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12236#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12235#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12234#L19 assume true; 12233#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12232#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12231#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12230#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12229#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12228#L19 assume true; 12227#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12226#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12225#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12224#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12223#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12222#L19 assume true; 12221#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12220#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12219#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12218#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12217#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12216#L19 assume true; 12215#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12214#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12213#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12212#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12211#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12210#L19 assume true; 12209#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12208#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12207#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12206#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12205#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12204#L19 assume true; 12203#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12202#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12201#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12200#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12199#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12198#L19 assume true; 12197#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12196#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12195#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12194#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12193#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12192#L19 assume true; 12191#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12190#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12189#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12188#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12187#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12186#L19 assume true; 12185#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12180#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12184#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12183#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12182#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12181#L19 assume true; 12179#L19-1 assume !(main_~j~0#1 < 10); 12178#L24 assume !(main_~i~0#1 > 9); 12177#L16-1 havoc main_~j~0#1; 12176#L16 assume true; 12175#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 12174#L19 assume true; 12173#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12172#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12171#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12170#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12169#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12168#L19 assume true; 12167#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12166#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12165#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12164#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12163#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12162#L19 assume true; 12161#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12160#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12159#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12158#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12157#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12156#L19 assume true; 12155#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12154#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12153#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12152#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12151#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12150#L19 assume true; 12149#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12148#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12147#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12146#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12145#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12144#L19 assume true; 12143#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12142#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12141#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12140#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12139#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12138#L19 assume true; 12137#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12136#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12135#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12134#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12133#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12132#L19 assume true; 12131#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12130#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12129#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12128#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12127#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12126#L19 assume true; 12125#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12124#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12123#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12122#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12121#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12120#L19 assume true; 12119#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12114#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12118#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12117#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12116#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12115#L19 assume true; 12113#L19-1 assume !(main_~j~0#1 < 10); 12112#L24 assume !(main_~i~0#1 > 9); 12111#L16-1 havoc main_~j~0#1; 12110#L16 assume true; 12109#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 12108#L19 assume true; 12107#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12106#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12105#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12104#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12103#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12102#L19 assume true; 12101#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12100#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12099#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12098#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12097#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12096#L19 assume true; 12095#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12094#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12093#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12092#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12091#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12090#L19 assume true; 12089#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12088#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12087#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12086#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12085#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12084#L19 assume true; 12083#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12082#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12081#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12080#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12079#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12078#L19 assume true; 12077#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12076#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12075#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12074#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12073#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12072#L19 assume true; 12071#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12070#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12069#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12068#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12067#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12066#L19 assume true; 12065#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12064#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12063#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12062#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12061#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12060#L19 assume true; 12059#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12058#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12057#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12056#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12055#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12054#L19 assume true; 12053#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12048#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12052#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12051#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12050#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12049#L19 assume true; 12047#L19-1 assume !(main_~j~0#1 < 10); 12046#L24 assume !(main_~i~0#1 > 9); 12045#L16-1 havoc main_~j~0#1; 12044#L16 assume true; 12043#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 12042#L19 assume true; 12041#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12040#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12039#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12038#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12037#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12036#L19 assume true; 12035#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12034#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12033#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12032#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12031#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12030#L19 assume true; 12029#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12028#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12027#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12026#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12025#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12024#L19 assume true; 12023#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12022#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12021#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12020#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12019#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12018#L19 assume true; 12017#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12016#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12015#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12014#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12013#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12012#L19 assume true; 12011#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12010#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12009#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12008#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12007#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12006#L19 assume true; 12005#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12004#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 12003#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12002#L13 assume !(0 == __VERIFIER_assert_~cond#1); 12001#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12000#L19 assume true; 11999#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11998#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11997#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11996#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11995#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11994#L19 assume true; 11993#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11992#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11991#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11990#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11989#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11988#L19 assume true; 11987#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11982#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11986#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11985#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11984#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11983#L19 assume true; 11981#L19-1 assume !(main_~j~0#1 < 10); 11980#L24 assume !(main_~i~0#1 > 9); 11979#L16-1 havoc main_~j~0#1; 11978#L16 assume true; 11977#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 11976#L19 assume true; 11975#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11974#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11973#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11972#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11971#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11970#L19 assume true; 11969#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11968#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11967#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11966#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11965#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11964#L19 assume true; 11963#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11962#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11961#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11960#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11959#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11958#L19 assume true; 11957#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11956#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11955#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11954#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11953#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11952#L19 assume true; 11951#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11950#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11949#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11948#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11947#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11946#L19 assume true; 11945#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11944#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11943#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11942#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11941#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11940#L19 assume true; 11939#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11938#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11937#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11936#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11935#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11934#L19 assume true; 11933#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11932#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11931#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11930#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11929#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11928#L19 assume true; 11927#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11926#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11925#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11924#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11923#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11922#L19 assume true; 11921#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11916#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11920#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11919#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11918#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11917#L19 assume true; 11915#L19-1 assume !(main_~j~0#1 < 10); 11914#L24 assume !(main_~i~0#1 > 9); 11913#L16-1 havoc main_~j~0#1; 11912#L16 assume true; 11911#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 11910#L19 assume true; 11909#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11908#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11907#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11906#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11905#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11904#L19 assume true; 11903#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11902#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11901#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11900#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11899#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11898#L19 assume true; 11897#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11896#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11895#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11894#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11893#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11892#L19 assume true; 11891#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11890#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11889#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11888#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11887#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11886#L19 assume true; 11885#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11884#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11883#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11882#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11881#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11880#L19 assume true; 11879#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11878#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11877#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11876#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11875#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11874#L19 assume true; 11873#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11872#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11871#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11870#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11869#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11868#L19 assume true; 11867#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11866#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11865#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11864#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11863#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11862#L19 assume true; 11861#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11860#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11859#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11858#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11857#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11856#L19 assume true; 11855#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11850#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11854#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11853#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11852#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11851#L19 assume true; 11849#L19-1 assume !(main_~j~0#1 < 10); 11848#L24 assume !(main_~i~0#1 > 9); 11783#L16-1 havoc main_~j~0#1; 11847#L16 assume true; 11846#L16-2 assume !false;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 0; 11845#L19 assume true; 11844#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11843#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11842#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11841#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11840#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11839#L19 assume true; 11838#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11837#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11836#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11835#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11834#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11833#L19 assume true; 11832#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11831#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11830#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11829#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11828#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11827#L19 assume true; 11826#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11825#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11824#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11823#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11822#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11821#L19 assume true; 11820#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11819#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11818#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11817#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11816#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11815#L19 assume true; 11814#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11813#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11812#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11811#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11810#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11809#L19 assume true; 11808#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11807#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11806#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11805#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11804#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11803#L19 assume true; 11802#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11801#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11800#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11799#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11798#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11797#L19 assume true; 11796#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11795#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11794#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11793#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11792#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11791#L19 assume true; 11790#L19-1 assume !!(main_~j~0#1 < 10);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11785#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 11789#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 10 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 11788#L13 assume !(0 == __VERIFIER_assert_~cond#1); 11787#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 11786#L19 assume true; 11784#L19-1 assume !(main_~j~0#1 < 10); 11781#L24 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 11782#L16-1 havoc main_~j~0#1; 11774#L16 [2024-11-10 23:05:18,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:18,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 8 times [2024-11-10 23:05:18,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:18,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567133117] [2024-11-10 23:05:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:18,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:18,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:18,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2012178350, now seen corresponding path program 3 times [2024-11-10 23:05:18,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:18,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98222801] [2024-11-10 23:05:18,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:18,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:18,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:18,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:18,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash -257144143, now seen corresponding path program 3 times [2024-11-10 23:05:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358052479] [2024-11-10 23:05:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:18,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:19,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:40,999 WARN L286 SmtUtils]: Spent 21.91s on a formula simplification. DAG size of input: 1718 DAG size of output: 1202 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-10 23:05:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:50,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:51,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:05:51 BoogieIcfgContainer [2024-11-10 23:05:51,064 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 23:05:51,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 23:05:51,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 23:05:51,065 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 23:05:51,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:04:59" (3/4) ... [2024-11-10 23:05:51,068 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 23:05:51,145 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 23:05:51,145 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 23:05:51,146 INFO L158 Benchmark]: Toolchain (without parser) took 52445.47ms. Allocated memory was 169.9MB in the beginning and 914.4MB in the end (delta: 744.5MB). Free memory was 103.0MB in the beginning and 527.5MB in the end (delta: -424.5MB). Peak memory consumption was 321.2MB. Max. memory is 16.1GB. [2024-11-10 23:05:51,146 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory was 131.4MB in the beginning and 131.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:05:51,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.40ms. Allocated memory is still 169.9MB. Free memory was 102.7MB in the beginning and 137.8MB in the end (delta: -35.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-10 23:05:51,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.65ms. Allocated memory is still 169.9MB. Free memory was 137.8MB in the beginning and 137.0MB in the end (delta: 840.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:05:51,146 INFO L158 Benchmark]: Boogie Preprocessor took 18.24ms. Allocated memory is still 169.9MB. Free memory was 137.0MB in the beginning and 134.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:05:51,147 INFO L158 Benchmark]: IcfgBuilder took 193.75ms. Allocated memory is still 169.9MB. Free memory was 134.9MB in the beginning and 124.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 23:05:51,147 INFO L158 Benchmark]: BuchiAutomizer took 51887.74ms. Allocated memory was 169.9MB in the beginning and 914.4MB in the end (delta: 744.5MB). Free memory was 124.4MB in the beginning and 543.2MB in the end (delta: -418.8MB). Peak memory consumption was 327.4MB. Max. memory is 16.1GB. [2024-11-10 23:05:51,147 INFO L158 Benchmark]: Witness Printer took 80.22ms. Allocated memory is still 914.4MB. Free memory was 543.2MB in the beginning and 527.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 23:05:51,148 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory was 131.4MB in the beginning and 131.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.40ms. Allocated memory is still 169.9MB. Free memory was 102.7MB in the beginning and 137.8MB in the end (delta: -35.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.65ms. Allocated memory is still 169.9MB. Free memory was 137.8MB in the beginning and 137.0MB in the end (delta: 840.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.24ms. Allocated memory is still 169.9MB. Free memory was 137.0MB in the beginning and 134.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 193.75ms. Allocated memory is still 169.9MB. Free memory was 134.9MB in the beginning and 124.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 51887.74ms. Allocated memory was 169.9MB in the beginning and 914.4MB in the end (delta: 744.5MB). Free memory was 124.4MB in the beginning and 543.2MB in the end (delta: -418.8MB). Peak memory consumption was 327.4MB. Max. memory is 16.1GB. * Witness Printer took 80.22ms. Allocated memory is still 914.4MB. Free memory was 543.2MB in the beginning and 527.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 5 locations. One deterministic module has affine ranking function i and consists of 9 locations. 7 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 662 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 51.7s and 8 iterations. TraceHistogramMax:110. Analysis of lassos took 50.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 1006 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2616/12946 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 116 mSDtfsCounter, 216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 16]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L15] int i = 0; VAL [i=0] Loop: [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND TRUE i > 9 [L25] i = 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 16]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int i = 0; VAL [i=0] Loop: [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND FALSE !(i > 9) [L16] COND TRUE 1 [L17] i++ [L18] int j = 0; [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND TRUE j < 10 [L20] CALL __VERIFIER_assert(0 <= i) [L13] COND FALSE !(!(cond)) [L20] RET __VERIFIER_assert(0 <= i) [L21] CALL __VERIFIER_assert(i <= 10) [L13] COND FALSE !(!(cond)) [L21] RET __VERIFIER_assert(i <= 10) [L22] j++ [L19] COND FALSE !(j < 10) [L24] COND TRUE i > 9 [L25] i = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 23:05:51,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:51,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:51,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:51,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:51,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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(TERM)