./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-12 00:45:49,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:45:49,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:45:49,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:45:49,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:45:49,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:45:49,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:45:49,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:45:49,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:45:49,975 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:45:49,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:45:49,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:45:49,976 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:45:49,979 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:45:49,980 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:45:49,980 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:45:49,982 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:45:49,982 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:45:49,983 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:45:49,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:45:49,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:45:49,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:45:49,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:45:49,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:45:49,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:45:49,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:45:49,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:45:49,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:45:49,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:45:49,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:45:49,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:45:49,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:45:49,989 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:45:49,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:45:49,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:45:49,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:45:49,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:45:49,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:45:49,991 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:45:49,991 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-clean/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-clean/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-10-12 00:45:50,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:45:50,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:45:50,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:45:50,321 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:45:50,322 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:45:50,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.i [2024-10-12 00:45:51,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:45:51,940 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:45:51,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/as2013-hybrid.i [2024-10-12 00:45:51,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f4e79943/393349d08ad44820852b55aec03eab2c/FLAGd21d46b67 [2024-10-12 00:45:51,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f4e79943/393349d08ad44820852b55aec03eab2c [2024-10-12 00:45:51,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:45:51,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:45:51,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:45:51,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:45:51,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:45:51,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e069b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51, skipping insertion in model container [2024-10-12 00:45:51,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:45:52,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:45:52,206 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:45:52,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:45:52,229 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:45:52,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52 WrapperNode [2024-10-12 00:45:52,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:45:52,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:45:52,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:45:52,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:45:52,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,258 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 45 [2024-10-12 00:45:52,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:45:52,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:45:52,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:45:52,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:45:52,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,281 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-10-12 00:45:52,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:45:52,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:45:52,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:45:52,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:45:52,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (1/1) ... [2024-10-12 00:45:52,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:52,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:45:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:45:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:45:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:45:52,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:45:52,483 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:45:52,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:45:52,623 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-12 00:45:52,627 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:45:52,642 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:45:52,642 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:45:52,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:45:52 BoogieIcfgContainer [2024-10-12 00:45:52,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:45:52,644 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:45:52,644 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:45:52,648 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:45:52,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:45:52,650 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:45:51" (1/3) ... [2024-10-12 00:45:52,651 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@626d102e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:45:52, skipping insertion in model container [2024-10-12 00:45:52,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:45:52,652 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:52" (2/3) ... [2024-10-12 00:45:52,652 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@626d102e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:45:52, skipping insertion in model container [2024-10-12 00:45:52,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:45:52,653 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:45:52" (3/3) ... [2024-10-12 00:45:52,654 INFO L332 chiAutomizerObserver]: Analyzing ICFG as2013-hybrid.i [2024-10-12 00:45:52,716 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:45:52,716 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:45:52,716 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:45:52,717 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:45:52,717 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:45:52,718 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:45:52,718 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:45:52,719 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:45:52,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:52,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:45:52,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:52,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:52,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:52,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:45:52,747 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:45:52,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:52,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:45:52,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:52,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:52,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:52,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:45:52,758 INFO L745 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true 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); 7#L-1true 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; 16#L16-2true [2024-10-12 00:45:52,758 INFO L747 eck$LassoCheckResult]: Loop: 16#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; 2#L19-2true assume !(main_~j~0#1 < 10); 19#L19-3true assume main_~i~0#1 > 9;main_~i~0#1 := 0; 8#L24-1true havoc main_~j~0#1; 16#L16-2true [2024-10-12 00:45:52,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:45:52,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573659334] [2024-10-12 00:45:52,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:52,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1270380, now seen corresponding path program 1 times [2024-10-12 00:45:52,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420932490] [2024-10-12 00:45:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:52,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420932490] [2024-10-12 00:45:52,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420932490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:45:52,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:45:52,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:45:52,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220250606] [2024-10-12 00:45:52,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:45:52,988 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:45:52,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:45:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:45:53,022 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:53,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:53,042 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-10-12 00:45:53,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2024-10-12 00:45:53,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-12 00:45:53,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 15 states and 17 transitions. [2024-10-12 00:45:53,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-12 00:45:53,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-12 00:45:53,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2024-10-12 00:45:53,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:45:53,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-12 00:45:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2024-10-12 00:45:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2024-10-12 00:45:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-10-12 00:45:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-10-12 00:45:53,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-10-12 00:45:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:45:53,078 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-10-12 00:45:53,078 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:45:53,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2024-10-12 00:45:53,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-12 00:45:53,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:53,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:53,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:53,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:53,080 INFO L745 eck$LassoCheckResult]: Stem: 58#$Ultimate##0 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); 59#L-1 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; 60#L16-2 [2024-10-12 00:45:53,080 INFO L747 eck$LassoCheckResult]: Loop: 60#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; 52#L19-2 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; 53#L13 assume !(0 == __VERIFIER_assert_~cond#1); 56#L13-3 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; 57#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 54#L13-7 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; 55#L19-2 assume !(main_~j~0#1 < 10); 62#L19-3 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 61#L24-1 havoc main_~j~0#1; 60#L16-2 [2024-10-12 00:45:53,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:53,081 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:45:53,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:53,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188988633] [2024-10-12 00:45:53,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:53,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:53,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:53,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:53,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1213427224, now seen corresponding path program 1 times [2024-10-12 00:45:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:53,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342785092] [2024-10-12 00:45:53,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:53,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:53,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342785092] [2024-10-12 00:45:53,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342785092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:45:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654646828] [2024-10-12 00:45:53,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:53,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:45:53,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:53,178 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:45:53,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 00:45:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:53,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:45:53,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:53,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:45:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654646828] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:45:53,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:45:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-12 00:45:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82482909] [2024-10-12 00:45:53,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:45:53,317 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:45:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:53,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:45:53,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:45:53,319 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-10-12 00:45:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:53,365 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-10-12 00:45:53,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2024-10-12 00:45:53,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2024-10-12 00:45:53,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2024-10-12 00:45:53,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-12 00:45:53,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-10-12 00:45:53,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2024-10-12 00:45:53,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:45:53,368 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-12 00:45:53,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2024-10-12 00:45:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-12 00:45:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-10-12 00:45:53,373 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-12 00:45:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:45:53,375 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-12 00:45:53,377 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:45:53,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2024-10-12 00:45:53,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2024-10-12 00:45:53,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:53,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:53,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:53,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-12 00:45:53,381 INFO L745 eck$LassoCheckResult]: Stem: 151#$Ultimate##0 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); 152#L-1 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; 153#L16-2 [2024-10-12 00:45:53,382 INFO L747 eck$LassoCheckResult]: Loop: 153#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; 154#L19-2 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; 171#L13 assume !(0 == __VERIFIER_assert_~cond#1); 170#L13-3 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; 169#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 148#L13-7 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; 146#L19-2 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; 147#L13 assume !(0 == __VERIFIER_assert_~cond#1); 149#L13-3 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; 150#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 155#L13-7 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; 168#L19-2 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; 167#L13 assume !(0 == __VERIFIER_assert_~cond#1); 166#L13-3 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; 165#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 164#L13-7 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; 163#L19-2 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; 159#L13 assume !(0 == __VERIFIER_assert_~cond#1); 162#L13-3 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; 161#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 160#L13-7 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; 158#L19-2 assume !(main_~j~0#1 < 10); 157#L19-3 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 156#L24-1 havoc main_~j~0#1; 153#L16-2 [2024-10-12 00:45:53,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:45:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:53,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273416326] [2024-10-12 00:45:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:53,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:53,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:53,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:53,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:53,404 INFO L85 PathProgramCache]: Analyzing trace with hash -726852244, now seen corresponding path program 2 times [2024-10-12 00:45:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:53,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081693274] [2024-10-12 00:45:53,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:53,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:53,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081693274] [2024-10-12 00:45:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081693274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:45:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827695819] [2024-10-12 00:45:53,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:45:53,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:45:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:53,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:45:53,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 00:45:53,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:45:53,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:45:53,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:45:53,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:53,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:45:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:53,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827695819] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:45:53,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:45:53,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-12 00:45:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810727938] [2024-10-12 00:45:53,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:45:53,847 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:45:53,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:53,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 00:45:53,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-12 00:45:53,848 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 3 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:53,911 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-10-12 00:45:53,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 58 transitions. [2024-10-12 00:45:53,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2024-10-12 00:45:53,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 58 transitions. [2024-10-12 00:45:53,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-10-12 00:45:53,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-10-12 00:45:53,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 58 transitions. [2024-10-12 00:45:53,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:45:53,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-10-12 00:45:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 58 transitions. [2024-10-12 00:45:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-12 00:45:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 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-10-12 00:45:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-10-12 00:45:53,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-10-12 00:45:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:45:53,928 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-10-12 00:45:53,928 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:45:53,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 58 transitions. [2024-10-12 00:45:53,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2024-10-12 00:45:53,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:53,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:53,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:53,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 10, 10, 10, 1, 1, 1, 1] [2024-10-12 00:45:53,930 INFO L745 eck$LassoCheckResult]: Stem: 386#$Ultimate##0 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); 387#L-1 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; 388#L16-2 [2024-10-12 00:45:53,932 INFO L747 eck$LassoCheckResult]: Loop: 388#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; 381#L19-2 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; 382#L13 assume !(0 == __VERIFIER_assert_~cond#1); 385#L13-3 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; 389#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 383#L13-7 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; 384#L19-2 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; 436#L13 assume !(0 == __VERIFIER_assert_~cond#1); 435#L13-3 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; 434#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 433#L13-7 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; 432#L19-2 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; 431#L13 assume !(0 == __VERIFIER_assert_~cond#1); 430#L13-3 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; 429#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 428#L13-7 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; 427#L19-2 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; 426#L13 assume !(0 == __VERIFIER_assert_~cond#1); 425#L13-3 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; 424#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 423#L13-7 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; 422#L19-2 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; 421#L13 assume !(0 == __VERIFIER_assert_~cond#1); 420#L13-3 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; 419#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 418#L13-7 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; 417#L19-2 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; 416#L13 assume !(0 == __VERIFIER_assert_~cond#1); 415#L13-3 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; 414#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 413#L13-7 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; 412#L19-2 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; 411#L13 assume !(0 == __VERIFIER_assert_~cond#1); 410#L13-3 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; 409#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 408#L13-7 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; 407#L19-2 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; 406#L13 assume !(0 == __VERIFIER_assert_~cond#1); 405#L13-3 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; 404#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 403#L13-7 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; 402#L19-2 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; 401#L13 assume !(0 == __VERIFIER_assert_~cond#1); 400#L13-3 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; 399#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 398#L13-7 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; 397#L19-2 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; 393#L13 assume !(0 == __VERIFIER_assert_~cond#1); 396#L13-3 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; 395#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 394#L13-7 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; 392#L19-2 assume !(main_~j~0#1 < 10); 391#L19-3 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 390#L24-1 havoc main_~j~0#1; 388#L16-2 [2024-10-12 00:45:53,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-12 00:45:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:53,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679629645] [2024-10-12 00:45:53,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:53,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:53,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:53,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:53,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash 605955564, now seen corresponding path program 3 times [2024-10-12 00:45:53,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:53,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168802444] [2024-10-12 00:45:53,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:53,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:54,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:54,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1929806894, now seen corresponding path program 1 times [2024-10-12 00:45:54,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:54,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267750518] [2024-10-12 00:45:54,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-12 00:45:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:54,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267750518] [2024-10-12 00:45:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267750518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:45:54,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:45:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:45:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25176251] [2024-10-12 00:45:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:45:55,203 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:55,204 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:55,204 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:55,204 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:55,204 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:55,205 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,205 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:55,205 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:55,205 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration4_Loop [2024-10-12 00:45:55,207 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:55,207 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:55,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,293 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:55,294 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:55,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:45:55,302 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:55,302 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:55,321 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:55,322 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-10-12 00:45:55,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:45:55,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,346 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:55,346 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:55,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:45:55,372 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:55,372 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-10-12 00:45:55,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:55,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:45:55,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:55,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:55,399 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:55,399 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-10-12 00:45:55,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:55,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:45:55,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:55,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:55,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:45:55,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,448 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:45:55,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:55,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:55,473 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:55,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:45:55,491 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:55,491 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:55,491 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:55,491 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:55,491 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:55,491 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,491 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:55,491 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:55,491 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration4_Loop [2024-10-12 00:45:55,491 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:55,491 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:55,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,545 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:55,549 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:55,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,553 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:45:55,556 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-10-12 00:45:55,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:55,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:45:55,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,594 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:45:55,598 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-10-12 00:45:55,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:55,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:45:55,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,637 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:45:55,639 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-10-12 00:45:55,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:55,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:55,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,675 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:45:55,679 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-10-12 00:45:55,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,699 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:55,702 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-12 00:45:55,702 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:45:55,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,706 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:45:55,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:55,708 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:55,708 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:55,709 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-10-12 00:45:55,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:55,722 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:55,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-12 00:45:55,955 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-10-12 00:45:55,957 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 58 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:56,009 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 58 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 169 states and 175 transitions. Complement of second has 7 states. [2024-10-12 00:45:56,011 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-10-12 00:45:56,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-12 00:45:56,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 54 letters. [2024-10-12 00:45:56,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:56,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 56 letters. Loop has 54 letters. [2024-10-12 00:45:56,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:56,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 108 letters. [2024-10-12 00:45:56,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:56,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 175 transitions. [2024-10-12 00:45:56,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2024-10-12 00:45:56,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 167 states and 173 transitions. [2024-10-12 00:45:56,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2024-10-12 00:45:56,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2024-10-12 00:45:56,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 173 transitions. [2024-10-12 00:45:56,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:56,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167 states and 173 transitions. [2024-10-12 00:45:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 173 transitions. [2024-10-12 00:45:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-10-12 00:45:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 1.0365853658536586) internal successors, (170), 163 states have internal predecessors, (170), 0 states have call successors, (0), 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-10-12 00:45:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 170 transitions. [2024-10-12 00:45:56,043 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 170 transitions. [2024-10-12 00:45:56,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:56,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:45:56,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:45:56,044 INFO L87 Difference]: Start difference. First operand 164 states and 170 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:56,062 INFO L93 Difference]: Finished difference Result 217 states and 222 transitions. [2024-10-12 00:45:56,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 222 transitions. [2024-10-12 00:45:56,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 115 [2024-10-12 00:45:56,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 165 states and 169 transitions. [2024-10-12 00:45:56,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2024-10-12 00:45:56,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2024-10-12 00:45:56,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 169 transitions. [2024-10-12 00:45:56,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:45:56,067 INFO L218 hiAutomatonCegarLoop]: Abstraction has 165 states and 169 transitions. [2024-10-12 00:45:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 169 transitions. [2024-10-12 00:45:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 110. [2024-10-12 00:45:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.0272727272727273) internal successors, (113), 109 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2024-10-12 00:45:56,074 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 113 transitions. [2024-10-12 00:45:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:45:56,075 INFO L425 stractBuchiCegarLoop]: Abstraction has 110 states and 113 transitions. [2024-10-12 00:45:56,075 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:45:56,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 113 transitions. [2024-10-12 00:45:56,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2024-10-12 00:45:56,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:56,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:56,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:56,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 20, 20, 20, 2, 2, 2, 1, 1] [2024-10-12 00:45:56,079 INFO L745 eck$LassoCheckResult]: Stem: 1188#$Ultimate##0 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); 1189#L-1 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; 1186#L16-2 [2024-10-12 00:45:56,079 INFO L747 eck$LassoCheckResult]: Loop: 1186#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; 1187#L19-2 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; 1290#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1289#L13-3 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; 1288#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1181#L13-7 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; 1182#L19-2 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; 1183#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1184#L13-3 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; 1185#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1190#L13-7 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; 1287#L19-2 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; 1286#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1285#L13-3 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; 1284#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1283#L13-7 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; 1282#L19-2 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; 1281#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1280#L13-3 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; 1279#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1278#L13-7 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; 1277#L19-2 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; 1276#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1275#L13-3 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; 1274#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1273#L13-7 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; 1272#L19-2 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; 1271#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1270#L13-3 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; 1269#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1268#L13-7 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; 1267#L19-2 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; 1266#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1265#L13-3 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; 1264#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1263#L13-7 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; 1262#L19-2 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; 1261#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1260#L13-3 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; 1259#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1258#L13-7 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; 1257#L19-2 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; 1256#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1255#L13-3 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; 1254#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1253#L13-7 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; 1252#L19-2 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; 1248#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1251#L13-3 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; 1250#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1249#L13-7 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; 1247#L19-2 assume !(main_~j~0#1 < 10); 1192#L19-3 assume !(main_~i~0#1 > 9); 1193#L24-1 havoc main_~j~0#1; 1246#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; 1245#L19-2 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; 1244#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1243#L13-3 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; 1242#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1241#L13-7 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; 1240#L19-2 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; 1239#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1238#L13-3 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; 1237#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1236#L13-7 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; 1235#L19-2 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; 1234#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1233#L13-3 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; 1232#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1231#L13-7 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; 1230#L19-2 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; 1229#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1228#L13-3 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; 1227#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1226#L13-7 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; 1225#L19-2 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; 1224#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1223#L13-3 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; 1222#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1221#L13-7 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; 1220#L19-2 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; 1219#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1218#L13-3 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; 1217#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1216#L13-7 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; 1215#L19-2 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; 1214#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1213#L13-3 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; 1212#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1211#L13-7 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; 1210#L19-2 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; 1209#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1208#L13-3 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; 1207#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1206#L13-7 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; 1205#L19-2 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; 1204#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1203#L13-3 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; 1202#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1201#L13-7 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; 1200#L19-2 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; 1196#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1199#L13-3 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; 1198#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1197#L13-7 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; 1195#L19-2 assume !(main_~j~0#1 < 10); 1194#L19-3 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 1191#L24-1 havoc main_~j~0#1; 1186#L16-2 [2024-10-12 00:45:56,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-12 00:45:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:56,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055470163] [2024-10-12 00:45:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:56,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:56,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:56,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1759867733, now seen corresponding path program 1 times [2024-10-12 00:45:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:56,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969099734] [2024-10-12 00:45:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:56,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:56,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:56,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash 416893975, now seen corresponding path program 1 times [2024-10-12 00:45:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264732138] [2024-10-12 00:45:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:56,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 1 proven. 523 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2024-10-12 00:45:56,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264732138] [2024-10-12 00:45:56,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264732138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:45:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819257793] [2024-10-12 00:45:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:56,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:45:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:56,371 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:45:56,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-12 00:45:56,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:56,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:45:56,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 1 proven. 523 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2024-10-12 00:45:56,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:45:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 1 proven. 523 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2024-10-12 00:45:56,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819257793] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:45:56,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:45:56,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-12 00:45:56,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4722848] [2024-10-12 00:45:56,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:45:58,856 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:58,857 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:58,857 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:58,857 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:58,857 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:58,857 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:58,857 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:58,858 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:58,858 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration5_Loop [2024-10-12 00:45:58,858 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:58,858 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:58,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:58,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:58,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:58,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:58,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:58,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:58,899 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:58,899 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:58,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:58,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:58,901 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:58,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:45:58,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:58,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:58,921 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:58,922 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-10-12 00:45:58,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:45:58,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:58,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:58,940 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:58,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:45:58,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:58,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:58,961 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:58,961 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-10-12 00:45:58,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:45:58,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:58,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:58,978 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:58,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:45:58,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:58,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:58,991 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:58,991 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-10-12 00:45:59,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:59,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:59,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:59,007 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:59,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:45:59,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:59,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:59,020 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:59,020 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-10-12 00:45:59,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:45:59,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:59,032 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:59,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:45:59,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:59,033 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:59,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:59,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:59,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:59,057 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:59,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:45:59,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:59,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:59,073 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:59,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:59,085 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:59,085 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:59,085 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:59,085 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:59,085 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:59,085 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:59,085 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:59,085 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:59,085 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration5_Loop [2024-10-12 00:45:59,085 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:59,085 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:59,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:59,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:59,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:59,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:59,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:59,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:59,129 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:59,129 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:59,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:59,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:59,130 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:59,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:45:59,133 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-10-12 00:45:59,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:59,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:59,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:59,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:59,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:59,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:59,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:59,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:59,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:59,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:59,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:59,157 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:59,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:45:59,159 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-10-12 00:45:59,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:59,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:59,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:59,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:59,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:59,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:59,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:59,171 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:59,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:59,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:59,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:59,188 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:59,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:45:59,192 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-10-12 00:45:59,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:59,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:59,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:59,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:59,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:59,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:59,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:59,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:59,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:59,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:59,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:59,221 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:59,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:45:59,222 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-10-12 00:45:59,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:59,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:59,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:59,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:59,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:59,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:59,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:59,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:59,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:59,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:59,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:59,251 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:59,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:45:59,257 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-10-12 00:45:59,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:59,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:59,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:59,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:59,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:59,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:59,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:59,272 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:59,275 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:45:59,275 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:45:59,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:59,277 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:59,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:45:59,279 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:59,279 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:59,279 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:59,279 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-10-12 00:45:59,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:59,291 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:59,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:59,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:59,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:59,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:45:59,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:59,563 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 1 proven. 523 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2024-10-12 00:45:59,563 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-10-12 00:45:59,564 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 113 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-10-12 00:45:59,607 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 113 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 331 states and 340 transitions. Complement of second has 9 states. [2024-10-12 00:45:59,607 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-10-12 00:45:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-10-12 00:45:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2024-10-12 00:45:59,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 108 letters. [2024-10-12 00:45:59,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:59,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 110 letters. Loop has 108 letters. [2024-10-12 00:45:59,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:59,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 216 letters. [2024-10-12 00:45:59,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:59,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 340 transitions. [2024-10-12 00:45:59,615 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 118 [2024-10-12 00:45:59,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 329 states and 338 transitions. [2024-10-12 00:45:59,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2024-10-12 00:45:59,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2024-10-12 00:45:59,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 338 transitions. [2024-10-12 00:45:59,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:59,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 329 states and 338 transitions. [2024-10-12 00:45:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 338 transitions. [2024-10-12 00:45:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 272. [2024-10-12 00:45:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 272 states have (on average 1.0294117647058822) internal successors, (280), 271 states have internal predecessors, (280), 0 states have call successors, (0), 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-10-12 00:45:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 280 transitions. [2024-10-12 00:45:59,630 INFO L240 hiAutomatonCegarLoop]: Abstraction has 272 states and 280 transitions. [2024-10-12 00:45:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:59,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 00:45:59,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-12 00:45:59,631 INFO L87 Difference]: Start difference. First operand 272 states and 280 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:59,675 INFO L93 Difference]: Finished difference Result 539 states and 550 transitions. [2024-10-12 00:45:59,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 539 states and 550 transitions. [2024-10-12 00:45:59,678 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 334 [2024-10-12 00:45:59,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 539 states to 433 states and 442 transitions. [2024-10-12 00:45:59,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2024-10-12 00:45:59,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2024-10-12 00:45:59,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 442 transitions. [2024-10-12 00:45:59,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:45:59,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 442 transitions. [2024-10-12 00:45:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 442 transitions. [2024-10-12 00:45:59,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 326. [2024-10-12 00:45:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 326 states have (on average 1.021472392638037) internal successors, (333), 325 states have internal predecessors, (333), 0 states have call successors, (0), 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-10-12 00:45:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 333 transitions. [2024-10-12 00:45:59,694 INFO L240 hiAutomatonCegarLoop]: Abstraction has 326 states and 333 transitions. [2024-10-12 00:45:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:45:59,695 INFO L425 stractBuchiCegarLoop]: Abstraction has 326 states and 333 transitions. [2024-10-12 00:45:59,695 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:45:59,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 333 transitions. [2024-10-12 00:45:59,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 324 [2024-10-12 00:45:59,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:59,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:59,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:59,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [60, 60, 60, 60, 60, 6, 6, 6, 5, 1] [2024-10-12 00:45:59,701 INFO L745 eck$LassoCheckResult]: Stem: 3460#$Ultimate##0 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); 3461#L-1 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; 3464#L16-2 [2024-10-12 00:45:59,702 INFO L747 eck$LassoCheckResult]: Loop: 3464#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; 3777#L19-2 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; 3776#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3457#L13-3 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; 3458#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3775#L13-7 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; 3774#L19-2 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; 3772#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3770#L13-3 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; 3768#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3766#L13-7 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; 3764#L19-2 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; 3762#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3760#L13-3 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; 3758#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3756#L13-7 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; 3754#L19-2 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; 3752#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3750#L13-3 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; 3748#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3746#L13-7 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; 3744#L19-2 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; 3742#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3740#L13-3 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; 3738#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3736#L13-7 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; 3734#L19-2 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; 3732#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3730#L13-3 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; 3728#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3726#L13-7 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; 3724#L19-2 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; 3722#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3720#L13-3 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; 3718#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3716#L13-7 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; 3714#L19-2 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; 3712#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3710#L13-3 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; 3708#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3706#L13-7 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; 3704#L19-2 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; 3702#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3700#L13-3 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; 3698#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3696#L13-7 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; 3694#L19-2 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; 3685#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3692#L13-3 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; 3690#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3688#L13-7 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; 3684#L19-2 assume !(main_~j~0#1 < 10); 3465#L19-3 assume !(main_~i~0#1 > 9); 3463#L24-1 havoc main_~j~0#1; 3459#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; 3454#L19-2 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; 3455#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3456#L13-3 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; 3462#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3452#L13-7 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; 3453#L19-2 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; 3773#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3771#L13-3 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; 3769#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3767#L13-7 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; 3765#L19-2 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; 3763#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3761#L13-3 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; 3759#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3757#L13-7 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; 3755#L19-2 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; 3753#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3751#L13-3 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; 3749#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3747#L13-7 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; 3745#L19-2 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; 3743#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3741#L13-3 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; 3739#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3737#L13-7 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; 3735#L19-2 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; 3733#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3731#L13-3 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; 3729#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3727#L13-7 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; 3725#L19-2 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; 3723#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3721#L13-3 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; 3719#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3717#L13-7 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; 3715#L19-2 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; 3713#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3711#L13-3 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; 3709#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3707#L13-7 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; 3705#L19-2 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; 3703#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3701#L13-3 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; 3699#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3697#L13-7 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; 3695#L19-2 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; 3687#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3693#L13-3 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; 3691#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3689#L13-7 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; 3686#L19-2 assume !(main_~j~0#1 < 10); 3683#L19-3 assume !(main_~i~0#1 > 9); 3682#L24-1 havoc main_~j~0#1; 3681#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; 3680#L19-2 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; 3679#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3678#L13-3 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; 3677#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3676#L13-7 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; 3675#L19-2 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; 3674#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3673#L13-3 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; 3672#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3671#L13-7 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; 3670#L19-2 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; 3669#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3668#L13-3 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; 3667#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3666#L13-7 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; 3665#L19-2 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; 3664#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3663#L13-3 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; 3662#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3661#L13-7 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; 3660#L19-2 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; 3659#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3658#L13-3 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; 3657#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3656#L13-7 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; 3655#L19-2 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; 3654#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3653#L13-3 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; 3652#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3651#L13-7 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; 3650#L19-2 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; 3649#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3648#L13-3 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; 3647#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3646#L13-7 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; 3645#L19-2 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; 3644#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3643#L13-3 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; 3642#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3641#L13-7 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; 3640#L19-2 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; 3639#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3638#L13-3 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; 3637#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3636#L13-7 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; 3635#L19-2 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; 3631#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3634#L13-3 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; 3633#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3632#L13-7 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; 3630#L19-2 assume !(main_~j~0#1 < 10); 3629#L19-3 assume !(main_~i~0#1 > 9); 3628#L24-1 havoc main_~j~0#1; 3627#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; 3626#L19-2 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; 3625#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3624#L13-3 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; 3623#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3622#L13-7 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; 3621#L19-2 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; 3620#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3619#L13-3 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; 3618#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3617#L13-7 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; 3616#L19-2 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; 3615#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3614#L13-3 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; 3613#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3612#L13-7 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; 3611#L19-2 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; 3610#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3609#L13-3 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; 3608#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3607#L13-7 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; 3606#L19-2 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; 3605#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3604#L13-3 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; 3603#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3602#L13-7 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; 3601#L19-2 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; 3600#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3599#L13-3 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; 3598#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3597#L13-7 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; 3596#L19-2 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; 3595#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3594#L13-3 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; 3593#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3592#L13-7 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; 3591#L19-2 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; 3590#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3589#L13-3 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; 3588#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3587#L13-7 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; 3586#L19-2 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; 3585#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3584#L13-3 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; 3583#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3582#L13-7 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; 3581#L19-2 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; 3577#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3580#L13-3 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; 3579#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3578#L13-7 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; 3576#L19-2 assume !(main_~j~0#1 < 10); 3575#L19-3 assume !(main_~i~0#1 > 9); 3574#L24-1 havoc main_~j~0#1; 3573#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; 3572#L19-2 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; 3571#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3570#L13-3 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; 3569#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3568#L13-7 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; 3567#L19-2 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; 3566#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3565#L13-3 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; 3564#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3563#L13-7 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; 3562#L19-2 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; 3561#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3560#L13-3 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; 3559#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3558#L13-7 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; 3557#L19-2 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; 3556#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3555#L13-3 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; 3554#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3553#L13-7 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; 3552#L19-2 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; 3551#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3550#L13-3 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; 3549#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3548#L13-7 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; 3547#L19-2 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; 3546#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3545#L13-3 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; 3544#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3543#L13-7 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; 3542#L19-2 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; 3541#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3540#L13-3 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; 3539#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3538#L13-7 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; 3537#L19-2 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; 3536#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3535#L13-3 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; 3534#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3533#L13-7 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; 3532#L19-2 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; 3531#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3530#L13-3 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; 3529#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3528#L13-7 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; 3527#L19-2 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; 3523#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3526#L13-3 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; 3525#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3524#L13-7 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; 3522#L19-2 assume !(main_~j~0#1 < 10); 3521#L19-3 assume !(main_~i~0#1 > 9); 3468#L24-1 havoc main_~j~0#1; 3520#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; 3519#L19-2 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; 3518#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3517#L13-3 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; 3516#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3515#L13-7 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; 3514#L19-2 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; 3513#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3512#L13-3 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; 3511#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3510#L13-7 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; 3509#L19-2 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; 3508#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3507#L13-3 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; 3506#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3505#L13-7 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; 3504#L19-2 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; 3503#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3502#L13-3 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; 3501#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3500#L13-7 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; 3499#L19-2 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; 3498#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3497#L13-3 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; 3496#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3495#L13-7 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; 3494#L19-2 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; 3493#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3492#L13-3 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; 3491#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3490#L13-7 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; 3489#L19-2 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; 3488#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3487#L13-3 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; 3486#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3485#L13-7 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; 3484#L19-2 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; 3483#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3482#L13-3 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; 3481#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3480#L13-7 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; 3479#L19-2 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; 3478#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3477#L13-3 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; 3476#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3475#L13-7 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; 3474#L19-2 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; 3470#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3473#L13-3 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; 3472#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 3471#L13-7 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; 3469#L19-2 assume !(main_~j~0#1 < 10); 3466#L19-3 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 3467#L24-1 havoc main_~j~0#1; 3464#L16-2 [2024-10-12 00:45:59,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-10-12 00:45:59,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:59,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934678338] [2024-10-12 00:45:59,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:59,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:59,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:59,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1401720455, now seen corresponding path program 2 times [2024-10-12 00:45:59,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95540686] [2024-10-12 00:45:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:59,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:59,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:59,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:59,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2079034309, now seen corresponding path program 2 times [2024-10-12 00:45:59,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:59,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798695468] [2024-10-12 00:45:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:59,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9270 backedges. 5 proven. 7855 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-12 00:46:00,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:00,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798695468] [2024-10-12 00:46:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798695468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:46:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140831743] [2024-10-12 00:46:00,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:46:00,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:46:00,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:00,354 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:46:00,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-12 00:46:00,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:46:00,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:46:00,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:46:00,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9270 backedges. 5 proven. 7855 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-12 00:46:01,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:46:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9270 backedges. 5 proven. 7855 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-12 00:46:01,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140831743] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:46:01,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:46:01,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-10-12 00:46:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431553255] [2024-10-12 00:46:01,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:46:12,224 WARN L286 SmtUtils]: Spent 10.65s on a formula simplification. DAG size of input: 1034 DAG size of output: 725 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:46:15,688 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:15,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:15,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:15,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:15,688 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:15,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:15,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:15,689 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:15,689 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration6_Loop [2024-10-12 00:46:15,689 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:15,689 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:15,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,732 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:15,732 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:15,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:15,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:15,734 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:15,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:46:15,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:15,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:15,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:46:15,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:15,763 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:15,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:46:15,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:15,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:15,776 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:15,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:15,787 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:15,787 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:15,787 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:15,788 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:15,788 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:15,788 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:15,788 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:15,788 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:15,788 INFO L132 ssoRankerPreferences]: Filename of dumped script: as2013-hybrid.i_Iteration6_Loop [2024-10-12 00:46:15,788 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:15,788 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:15,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:15,822 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:15,822 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:15,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:15,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:15,824 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:15,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:46:15,825 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-10-12 00:46:15,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:15,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:15,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:15,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:15,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:15,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:15,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:15,838 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:15,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:15,841 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:46:15,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:15,843 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:15,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:46:15,844 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:15,844 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:15,844 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:15,844 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-10-12 00:46:15,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 00:46:15,856 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:15,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:15,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:15,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:16,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:46:16,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9270 backedges. 5 proven. 7855 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-12 00:46:16,562 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-10-12 00:46:16,562 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 326 states and 333 transitions. cyclomatic complexity: 8 Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:46:16,681 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 326 states and 333 transitions. cyclomatic complexity: 8. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 979 states and 1000 transitions. Complement of second has 17 states. [2024-10-12 00:46:16,682 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-10-12 00:46:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:46:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2024-10-12 00:46:16,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 2 letters. Loop has 324 letters. [2024-10-12 00:46:16,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:16,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 326 letters. Loop has 324 letters. [2024-10-12 00:46:16,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:16,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 2 letters. Loop has 648 letters. [2024-10-12 00:46:16,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:16,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 979 states and 1000 transitions. [2024-10-12 00:46:16,703 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 354 [2024-10-12 00:46:16,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 979 states to 977 states and 998 transitions. [2024-10-12 00:46:16,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 651 [2024-10-12 00:46:16,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 653 [2024-10-12 00:46:16,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 977 states and 998 transitions. [2024-10-12 00:46:16,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:16,709 INFO L218 hiAutomatonCegarLoop]: Abstraction has 977 states and 998 transitions. [2024-10-12 00:46:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states and 998 transitions. [2024-10-12 00:46:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 704. [2024-10-12 00:46:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 704 states have (on average 1.0227272727272727) internal successors, (720), 703 states have internal predecessors, (720), 0 states have call successors, (0), 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-10-12 00:46:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 720 transitions. [2024-10-12 00:46:16,733 INFO L240 hiAutomatonCegarLoop]: Abstraction has 704 states and 720 transitions. [2024-10-12 00:46:16,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:16,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:46:16,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:46:16,737 INFO L87 Difference]: Start difference. First operand 704 states and 720 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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-10-12 00:46:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:16,797 INFO L93 Difference]: Finished difference Result 1187 states and 1210 transitions. [2024-10-12 00:46:16,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1187 states and 1210 transitions. [2024-10-12 00:46:16,804 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 570 [2024-10-12 00:46:16,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1187 states to 865 states and 882 transitions. [2024-10-12 00:46:16,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 865 [2024-10-12 00:46:16,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 865 [2024-10-12 00:46:16,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 865 states and 882 transitions. [2024-10-12 00:46:16,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:16,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 865 states and 882 transitions. [2024-10-12 00:46:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states and 882 transitions. [2024-10-12 00:46:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 542. [2024-10-12 00:46:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 542 states have (on average 1.0202952029520296) internal successors, (553), 541 states have internal predecessors, (553), 0 states have call successors, (0), 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-10-12 00:46:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 553 transitions. [2024-10-12 00:46:16,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 542 states and 553 transitions. [2024-10-12 00:46:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:46:16,819 INFO L425 stractBuchiCegarLoop]: Abstraction has 542 states and 553 transitions. [2024-10-12 00:46:16,819 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:46:16,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 553 transitions. [2024-10-12 00:46:16,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 540 [2024-10-12 00:46:16,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:16,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:16,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:16,826 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [100, 100, 100, 100, 100, 10, 10, 10, 9, 1] [2024-10-12 00:46:16,826 INFO L745 eck$LassoCheckResult]: Stem: 9636#$Ultimate##0 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); 9637#L-1 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; 9638#L16-2 [2024-10-12 00:46:16,827 INFO L747 eck$LassoCheckResult]: Loop: 9638#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; 9631#L19-2 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; 9632#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9635#L13-3 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; 9639#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9633#L13-7 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; 9634#L19-2 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; 10165#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10163#L13-3 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; 10161#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10159#L13-7 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; 10157#L19-2 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; 10155#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10153#L13-3 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; 10151#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10149#L13-7 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; 10147#L19-2 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; 10145#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10143#L13-3 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; 10141#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10139#L13-7 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; 10137#L19-2 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; 10135#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10133#L13-3 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; 10131#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10129#L13-7 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; 10127#L19-2 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; 10125#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10123#L13-3 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; 10121#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10119#L13-7 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; 10117#L19-2 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; 10115#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10113#L13-3 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; 10111#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10109#L13-7 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; 10107#L19-2 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; 10105#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10103#L13-3 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; 10101#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10099#L13-7 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; 10097#L19-2 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; 10095#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10093#L13-3 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; 10091#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10089#L13-7 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; 10087#L19-2 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; 10079#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10085#L13-3 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; 10083#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10081#L13-7 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; 10078#L19-2 assume !(main_~j~0#1 < 10); 9641#L19-3 assume !(main_~i~0#1 > 9); 9642#L24-1 havoc main_~j~0#1; 10172#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; 10171#L19-2 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; 10170#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10169#L13-3 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; 10168#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10167#L13-7 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; 10166#L19-2 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; 10164#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10162#L13-3 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; 10160#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10158#L13-7 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; 10156#L19-2 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; 10154#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10152#L13-3 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; 10150#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10148#L13-7 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; 10146#L19-2 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; 10144#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10142#L13-3 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; 10140#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10138#L13-7 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; 10136#L19-2 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; 10134#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10132#L13-3 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; 10130#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10128#L13-7 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; 10126#L19-2 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; 10124#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10122#L13-3 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; 10120#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10118#L13-7 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; 10116#L19-2 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; 10114#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10112#L13-3 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; 10110#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10108#L13-7 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; 10106#L19-2 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; 10104#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10102#L13-3 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; 10100#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10098#L13-7 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; 10096#L19-2 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; 10094#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10092#L13-3 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; 10090#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10088#L13-7 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; 10086#L19-2 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; 10077#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10084#L13-3 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; 10082#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10080#L13-7 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; 10076#L19-2 assume !(main_~j~0#1 < 10); 10075#L19-3 assume !(main_~i~0#1 > 9); 10074#L24-1 havoc main_~j~0#1; 10073#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; 10072#L19-2 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; 10071#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10070#L13-3 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; 10069#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10068#L13-7 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; 10067#L19-2 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; 10066#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10065#L13-3 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; 10064#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10063#L13-7 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; 10062#L19-2 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; 10061#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10060#L13-3 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; 10059#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10058#L13-7 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; 10057#L19-2 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; 10056#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10055#L13-3 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; 10054#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10053#L13-7 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; 10052#L19-2 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; 10051#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10050#L13-3 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; 10049#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10048#L13-7 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; 10047#L19-2 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; 10046#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10045#L13-3 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; 10044#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10043#L13-7 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; 10042#L19-2 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; 10041#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10040#L13-3 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; 10039#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10038#L13-7 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; 10037#L19-2 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; 10036#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10035#L13-3 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; 10034#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10033#L13-7 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; 10032#L19-2 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; 10031#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10030#L13-3 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; 10029#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10028#L13-7 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; 10027#L19-2 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; 10023#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10026#L13-3 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; 10025#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10024#L13-7 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; 10022#L19-2 assume !(main_~j~0#1 < 10); 10021#L19-3 assume !(main_~i~0#1 > 9); 10020#L24-1 havoc main_~j~0#1; 10019#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; 10018#L19-2 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; 10017#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10016#L13-3 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; 10015#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10014#L13-7 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; 10013#L19-2 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; 10012#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10011#L13-3 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; 10010#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10009#L13-7 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; 10008#L19-2 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; 10007#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10006#L13-3 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; 10005#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 10004#L13-7 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; 10003#L19-2 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; 10002#L13 assume !(0 == __VERIFIER_assert_~cond#1); 10001#L13-3 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; 10000#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9999#L13-7 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; 9998#L19-2 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; 9997#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9996#L13-3 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; 9995#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9994#L13-7 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; 9993#L19-2 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; 9992#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9991#L13-3 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; 9990#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9989#L13-7 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; 9988#L19-2 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; 9987#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9986#L13-3 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; 9985#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9984#L13-7 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; 9983#L19-2 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; 9982#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9981#L13-3 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; 9980#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9979#L13-7 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; 9978#L19-2 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; 9977#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9976#L13-3 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; 9975#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9974#L13-7 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; 9973#L19-2 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; 9969#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9972#L13-3 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; 9971#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9970#L13-7 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; 9968#L19-2 assume !(main_~j~0#1 < 10); 9967#L19-3 assume !(main_~i~0#1 > 9); 9966#L24-1 havoc main_~j~0#1; 9965#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; 9964#L19-2 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; 9963#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9962#L13-3 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; 9961#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9960#L13-7 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; 9959#L19-2 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; 9958#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9957#L13-3 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; 9956#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9955#L13-7 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; 9954#L19-2 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; 9953#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9952#L13-3 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; 9951#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9950#L13-7 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; 9949#L19-2 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; 9948#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9947#L13-3 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; 9946#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9945#L13-7 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; 9944#L19-2 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; 9943#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9942#L13-3 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; 9941#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9940#L13-7 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; 9939#L19-2 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; 9938#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9937#L13-3 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; 9936#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9935#L13-7 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; 9934#L19-2 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; 9933#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9932#L13-3 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; 9931#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9930#L13-7 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; 9929#L19-2 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; 9928#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9927#L13-3 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; 9926#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9925#L13-7 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; 9924#L19-2 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; 9923#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9922#L13-3 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; 9921#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9920#L13-7 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; 9919#L19-2 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; 9915#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9918#L13-3 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; 9917#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9916#L13-7 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; 9914#L19-2 assume !(main_~j~0#1 < 10); 9913#L19-3 assume !(main_~i~0#1 > 9); 9912#L24-1 havoc main_~j~0#1; 9911#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; 9910#L19-2 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; 9909#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9908#L13-3 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; 9907#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9906#L13-7 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; 9905#L19-2 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; 9904#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9903#L13-3 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; 9902#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9901#L13-7 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; 9900#L19-2 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; 9899#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9898#L13-3 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; 9897#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9896#L13-7 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; 9895#L19-2 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; 9894#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9893#L13-3 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; 9892#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9891#L13-7 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; 9890#L19-2 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; 9889#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9888#L13-3 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; 9887#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9886#L13-7 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; 9885#L19-2 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; 9884#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9883#L13-3 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; 9882#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9881#L13-7 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; 9880#L19-2 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; 9879#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9878#L13-3 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; 9877#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9876#L13-7 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; 9875#L19-2 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; 9874#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9873#L13-3 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; 9872#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9871#L13-7 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; 9870#L19-2 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; 9869#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9868#L13-3 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; 9867#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9866#L13-7 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; 9865#L19-2 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; 9861#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9864#L13-3 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; 9863#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9862#L13-7 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; 9860#L19-2 assume !(main_~j~0#1 < 10); 9859#L19-3 assume !(main_~i~0#1 > 9); 9858#L24-1 havoc main_~j~0#1; 9857#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; 9856#L19-2 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; 9855#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9854#L13-3 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; 9853#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9852#L13-7 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; 9851#L19-2 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; 9850#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9849#L13-3 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; 9848#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9847#L13-7 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; 9846#L19-2 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; 9845#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9844#L13-3 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; 9843#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9842#L13-7 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; 9841#L19-2 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; 9840#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9839#L13-3 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; 9838#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9837#L13-7 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; 9836#L19-2 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; 9835#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9834#L13-3 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; 9833#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9832#L13-7 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; 9831#L19-2 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; 9830#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9829#L13-3 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; 9828#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9827#L13-7 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; 9826#L19-2 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; 9825#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9824#L13-3 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; 9823#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9822#L13-7 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; 9821#L19-2 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; 9820#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9819#L13-3 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; 9818#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9817#L13-7 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; 9816#L19-2 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; 9815#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9814#L13-3 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; 9813#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9812#L13-7 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; 9811#L19-2 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; 9807#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9810#L13-3 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; 9809#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9808#L13-7 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; 9806#L19-2 assume !(main_~j~0#1 < 10); 9805#L19-3 assume !(main_~i~0#1 > 9); 9804#L24-1 havoc main_~j~0#1; 9803#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; 9802#L19-2 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; 9801#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9800#L13-3 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; 9799#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9798#L13-7 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; 9797#L19-2 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; 9796#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9795#L13-3 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; 9794#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9793#L13-7 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; 9792#L19-2 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; 9791#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9790#L13-3 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; 9789#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9788#L13-7 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; 9787#L19-2 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; 9786#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9785#L13-3 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; 9784#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9783#L13-7 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; 9782#L19-2 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; 9781#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9780#L13-3 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; 9779#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9778#L13-7 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; 9777#L19-2 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; 9776#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9775#L13-3 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; 9774#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9773#L13-7 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; 9772#L19-2 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; 9771#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9770#L13-3 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; 9769#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9768#L13-7 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; 9767#L19-2 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; 9766#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9765#L13-3 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; 9764#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9763#L13-7 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; 9762#L19-2 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; 9761#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9760#L13-3 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; 9759#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9758#L13-7 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; 9757#L19-2 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; 9753#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9756#L13-3 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; 9755#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9754#L13-7 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; 9752#L19-2 assume !(main_~j~0#1 < 10); 9751#L19-3 assume !(main_~i~0#1 > 9); 9750#L24-1 havoc main_~j~0#1; 9749#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; 9748#L19-2 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; 9747#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9746#L13-3 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; 9745#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9744#L13-7 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; 9743#L19-2 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; 9742#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9741#L13-3 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; 9740#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9739#L13-7 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; 9738#L19-2 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; 9737#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9736#L13-3 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; 9735#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9734#L13-7 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; 9733#L19-2 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; 9732#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9731#L13-3 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; 9730#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9729#L13-7 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; 9728#L19-2 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; 9727#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9726#L13-3 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; 9725#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9724#L13-7 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; 9723#L19-2 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; 9722#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9721#L13-3 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; 9720#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9719#L13-7 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; 9718#L19-2 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; 9717#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9716#L13-3 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; 9715#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9714#L13-7 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; 9713#L19-2 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; 9712#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9711#L13-3 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; 9710#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9709#L13-7 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; 9708#L19-2 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; 9707#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9706#L13-3 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; 9705#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9704#L13-7 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; 9703#L19-2 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; 9699#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9702#L13-3 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; 9701#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9700#L13-7 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; 9698#L19-2 assume !(main_~j~0#1 < 10); 9697#L19-3 assume !(main_~i~0#1 > 9); 9644#L24-1 havoc main_~j~0#1; 9696#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; 9695#L19-2 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; 9694#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9693#L13-3 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; 9692#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9691#L13-7 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; 9690#L19-2 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; 9689#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9688#L13-3 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; 9687#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9686#L13-7 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; 9685#L19-2 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; 9684#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9683#L13-3 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; 9682#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9681#L13-7 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; 9680#L19-2 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; 9679#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9678#L13-3 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; 9677#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9676#L13-7 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; 9675#L19-2 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; 9674#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9673#L13-3 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; 9672#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9671#L13-7 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; 9670#L19-2 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; 9669#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9668#L13-3 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; 9667#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9666#L13-7 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; 9665#L19-2 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; 9664#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9663#L13-3 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; 9662#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9661#L13-7 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; 9660#L19-2 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; 9659#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9658#L13-3 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; 9657#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9656#L13-7 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; 9655#L19-2 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; 9654#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9653#L13-3 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; 9652#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9651#L13-7 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; 9650#L19-2 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; 9646#L13 assume !(0 == __VERIFIER_assert_~cond#1); 9649#L13-3 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; 9648#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 9647#L13-7 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; 9645#L19-2 assume !(main_~j~0#1 < 10); 9643#L19-3 assume main_~i~0#1 > 9;main_~i~0#1 := 0; 9640#L24-1 havoc main_~j~0#1; 9638#L16-2 [2024-10-12 00:46:16,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:16,829 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-10-12 00:46:16,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:16,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039798232] [2024-10-12 00:46:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:16,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:16,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:16,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:16,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash 88662941, now seen corresponding path program 3 times [2024-10-12 00:46:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:16,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277926624] [2024-10-12 00:46:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:16,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:16,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-12 00:46:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:17,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:17,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:17,036 INFO L85 PathProgramCache]: Analyzing trace with hash -817295265, now seen corresponding path program 3 times [2024-10-12 00:46:17,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:17,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430307899] [2024-10-12 00:46:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:17,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:17,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:17,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:47,117 WARN L286 SmtUtils]: Spent 29.81s on a formula simplification. DAG size of input: 1718 DAG size of output: 1203 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:46:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:57,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:57,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:46:57 BoogieIcfgContainer [2024-10-12 00:46:57,885 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:46:57,886 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:46:57,886 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:46:57,887 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:46:57,887 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:45:52" (3/4) ... [2024-10-12 00:46:57,888 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 00:46:58,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:46:58,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:46:58,007 INFO L158 Benchmark]: Toolchain (without parser) took 66041.66ms. Allocated memory was 127.9MB in the beginning and 708.8MB in the end (delta: 580.9MB). Free memory was 74.1MB in the beginning and 439.9MB in the end (delta: -365.7MB). Peak memory consumption was 216.3MB. Max. memory is 16.1GB. [2024-10-12 00:46:58,008 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 127.9MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:58,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.06ms. Allocated memory is still 127.9MB. Free memory was 73.8MB in the beginning and 62.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:46:58,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.58ms. Allocated memory is still 127.9MB. Free memory was 62.2MB in the beginning and 60.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:58,008 INFO L158 Benchmark]: Boogie Preprocessor took 35.59ms. Allocated memory is still 127.9MB. Free memory was 60.7MB in the beginning and 59.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:46:58,008 INFO L158 Benchmark]: RCFGBuilder took 347.61ms. Allocated memory was 127.9MB in the beginning and 182.5MB in the end (delta: 54.5MB). Free memory was 59.1MB in the beginning and 148.2MB in the end (delta: -89.2MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-12 00:46:58,009 INFO L158 Benchmark]: BuchiAutomizer took 65241.62ms. Allocated memory was 182.5MB in the beginning and 708.8MB in the end (delta: 526.4MB). Free memory was 148.2MB in the beginning and 455.6MB in the end (delta: -307.4MB). Peak memory consumption was 219.9MB. Max. memory is 16.1GB. [2024-10-12 00:46:58,009 INFO L158 Benchmark]: Witness Printer took 120.48ms. Allocated memory is still 708.8MB. Free memory was 455.6MB in the beginning and 439.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 00:46:58,010 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 127.9MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.06ms. Allocated memory is still 127.9MB. Free memory was 73.8MB in the beginning and 62.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.58ms. Allocated memory is still 127.9MB. Free memory was 62.2MB in the beginning and 60.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.59ms. Allocated memory is still 127.9MB. Free memory was 60.7MB in the beginning and 59.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.61ms. Allocated memory was 127.9MB in the beginning and 182.5MB in the end (delta: 54.5MB). Free memory was 59.1MB in the beginning and 148.2MB in the end (delta: -89.2MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 65241.62ms. Allocated memory was 182.5MB in the beginning and 708.8MB in the end (delta: 526.4MB). Free memory was 148.2MB in the beginning and 455.6MB in the end (delta: -307.4MB). Peak memory consumption was 219.9MB. Max. memory is 16.1GB. * Witness Printer took 120.48ms. Allocated memory is still 708.8MB. Free memory was 455.6MB in the beginning and 439.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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 9 terminating modules (6 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. 6 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 542 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 65.0s and 7 iterations. TraceHistogramMax:100. Analysis of lassos took 63.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 822 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: 2121/10499 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 84 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 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: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s 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-10-12 00:46:58,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:58,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-12 00:46:58,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:58,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:58,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)