./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex1b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-lit/hh2012-ex1b.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:38:03,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:38:03,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:38:03,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:38:03,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:38:03,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:38:03,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:38:03,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:38:03,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:38:03,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:38:03,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:38:03,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:38:03,395 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:38:03,395 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:38:03,396 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:38:03,396 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:38:03,396 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:38:03,396 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:38:03,396 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:38:03,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:38:03,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:38:03,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:38:03,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:38:03,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:38:03,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:38:03,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:38:03,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:38:03,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:38:03,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:38:03,402 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:38:03,402 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:38:03,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:38:03,402 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:38:03,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:38:03,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:38:03,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:38:03,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:38:03,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:38:03,403 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:38:03,403 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 [2024-11-23 02:38:03,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:38:03,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:38:03,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:38:03,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:38:03,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:38:03,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-11-23 02:38:04,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:38:05,008 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:38:05,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-11-23 02:38:05,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb6d010d/a6e857412cd84440929cdda2c9ca3119/FLAG2790bbf9c [2024-11-23 02:38:05,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb6d010d/a6e857412cd84440929cdda2c9ca3119 [2024-11-23 02:38:05,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:38:05,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:38:05,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:38:05,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:38:05,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:38:05,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0373da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05, skipping insertion in model container [2024-11-23 02:38:05,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:38:05,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:38:05,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:38:05,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:38:05,209 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:38:05,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05 WrapperNode [2024-11-23 02:38:05,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:38:05,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:38:05,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:38:05,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:38:05,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,237 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 59 [2024-11-23 02:38:05,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:38:05,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:38:05,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:38:05,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:38:05,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-23 02:38:05,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:38:05,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:38:05,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:38:05,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:38:05,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (1/1) ... [2024-11-23 02:38:05,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:05,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:05,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:05,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 02:38:05,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 02:38:05,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 02:38:05,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:38:05,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:38:05,398 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:38:05,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:38:05,504 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-23 02:38:05,505 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:38:05,513 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:38:05,514 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 02:38:05,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:38:05 BoogieIcfgContainer [2024-11-23 02:38:05,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:38:05,519 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:38:05,520 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:38:05,522 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:38:05,523 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:38:05,523 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:38:05" (1/3) ... [2024-11-23 02:38:05,524 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dced4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:38:05, skipping insertion in model container [2024-11-23 02:38:05,525 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:38:05,525 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:05" (2/3) ... [2024-11-23 02:38:05,525 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dced4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:38:05, skipping insertion in model container [2024-11-23 02:38:05,525 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:38:05,525 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:38:05" (3/3) ... [2024-11-23 02:38:05,526 INFO L332 chiAutomizerObserver]: Analyzing ICFG hh2012-ex1b.i [2024-11-23 02:38:05,570 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:38:05,570 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:38:05,570 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:38:05,570 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:38:05,570 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:38:05,570 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:38:05,570 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:38:05,570 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:38:05,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 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-11-23 02:38:05,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-23 02:38:05,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:05,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:05,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:05,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:05,588 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:38:05,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 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-11-23 02:38:05,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-23 02:38:05,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:05,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:05,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:05,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:05,595 INFO L745 eck$LassoCheckResult]: Stem: 27#$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(10, 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; 28#L16-2true [2024-11-23 02:38:05,596 INFO L747 eck$LassoCheckResult]: Loop: 28#L16-2true assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 12#L18-2true assume !(main_~j~0#1 < 100); 13#L18-3true assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 29#L13-4true assume !(0 == __VERIFIER_assert_~cond#1); 9#L13-7true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 24#L13-8true assume !(0 == __VERIFIER_assert_~cond#1); 14#L13-11true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1; 28#L16-2true [2024-11-23 02:38:05,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-23 02:38:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:05,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513492097] [2024-11-23 02:38:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:05,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:05,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:05,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:05,710 INFO L85 PathProgramCache]: Analyzing trace with hash -825620732, now seen corresponding path program 1 times [2024-11-23 02:38:05,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:05,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172563966] [2024-11-23 02:38:05,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:05,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:05,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:05,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172563966] [2024-11-23 02:38:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172563966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:38:05,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:38:05,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 02:38:05,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063548784] [2024-11-23 02:38:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:38:05,796 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:05,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:05,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:38:05,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:38:05,829 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:05,857 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2024-11-23 02:38:05,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2024-11-23 02:38:05,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-23 02:38:05,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 12 states and 13 transitions. [2024-11-23 02:38:05,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-23 02:38:05,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-23 02:38:05,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2024-11-23 02:38:05,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:05,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-23 02:38:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2024-11-23 02:38:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-23 02:38:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-23 02:38:05,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-23 02:38:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:38:05,890 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-23 02:38:05,891 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:38:05,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2024-11-23 02:38:05,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-23 02:38:05,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:05,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:05,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:05,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:05,892 INFO L745 eck$LassoCheckResult]: Stem: 73#$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(10, 2); 74#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; 72#L16-2 [2024-11-23 02:38:05,892 INFO L747 eck$LassoCheckResult]: Loop: 72#L16-2 assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 69#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 67#L13 assume !(0 == __VERIFIER_assert_~cond#1); 68#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 75#L18-2 assume !(main_~j~0#1 < 100); 70#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 71#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 64#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 65#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 66#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1; 72#L16-2 [2024-11-23 02:38:05,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-23 02:38:05,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:05,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987692030] [2024-11-23 02:38:05,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:05,901 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:38:05,901 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:05,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:05,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:05,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash 112317510, now seen corresponding path program 1 times [2024-11-23 02:38:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:05,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737290739] [2024-11-23 02:38:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737290739] [2024-11-23 02:38:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737290739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:38:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373467419] [2024-11-23 02:38:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:38:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:05,984 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:38:05,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 02:38:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:06,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 02:38:06,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:06,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:38:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:06,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373467419] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:38:06,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:38:06,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-23 02:38:06,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45875788] [2024-11-23 02:38:06,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:38:06,094 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:06,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:06,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:38:06,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:38:06,095 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:06,125 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-23 02:38:06,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2024-11-23 02:38:06,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-11-23 02:38:06,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2024-11-23 02:38:06,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-23 02:38:06,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-23 02:38:06,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2024-11-23 02:38:06,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:06,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-23 02:38:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2024-11-23 02:38:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-23 02:38:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-23 02:38:06,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-23 02:38:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:38:06,133 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-23 02:38:06,133 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:38:06,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2024-11-23 02:38:06,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-11-23 02:38:06,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:06,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:06,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:06,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:06,134 INFO L745 eck$LassoCheckResult]: Stem: 169#$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(10, 2); 170#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; 168#L16-2 [2024-11-23 02:38:06,134 INFO L747 eck$LassoCheckResult]: Loop: 168#L16-2 assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 171#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 180#L13 assume !(0 == __VERIFIER_assert_~cond#1); 172#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 165#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 163#L13 assume !(0 == __VERIFIER_assert_~cond#1); 164#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 179#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 178#L13 assume !(0 == __VERIFIER_assert_~cond#1); 177#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 176#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 174#L13 assume !(0 == __VERIFIER_assert_~cond#1); 175#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 173#L18-2 assume !(main_~j~0#1 < 100); 166#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 167#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_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 161#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 162#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1; 168#L16-2 [2024-11-23 02:38:06,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-23 02:38:06,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:06,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079897466] [2024-11-23 02:38:06,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:38:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:06,139 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:38:06,140 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:06,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:06,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:06,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:06,149 INFO L85 PathProgramCache]: Analyzing trace with hash -995346300, now seen corresponding path program 2 times [2024-11-23 02:38:06,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:06,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970577884] [2024-11-23 02:38:06,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:06,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:06,175 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:38:06,175 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:06,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:06,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970577884] [2024-11-23 02:38:06,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970577884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:38:06,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514843558] [2024-11-23 02:38:06,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:06,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:38:06,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:06,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:38:06,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 02:38:06,357 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:38:06,358 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:06,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:38:06,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:06,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:38:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:06,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514843558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:38:06,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:38:06,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-23 02:38:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569498592] [2024-11-23 02:38:06,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:38:06,478 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:06,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:06,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 02:38:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-23 02:38:06,480 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:06,519 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-23 02:38:06,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 40 transitions. [2024-11-23 02:38:06,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2024-11-23 02:38:06,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 40 transitions. [2024-11-23 02:38:06,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-23 02:38:06,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-23 02:38:06,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 40 transitions. [2024-11-23 02:38:06,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:06,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-23 02:38:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 40 transitions. [2024-11-23 02:38:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-23 02:38:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 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-11-23 02:38:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-23 02:38:06,525 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-23 02:38:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 02:38:06,527 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-23 02:38:06,527 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:38:06,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 40 transitions. [2024-11-23 02:38:06,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2024-11-23 02:38:06,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:06,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:06,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:06,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:06,529 INFO L745 eck$LassoCheckResult]: Stem: 353#$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(10, 2); 354#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; 351#L16-2 [2024-11-23 02:38:06,529 INFO L747 eck$LassoCheckResult]: Loop: 351#L16-2 assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 348#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 346#L13 assume !(0 == __VERIFIER_assert_~cond#1); 347#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 352#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 381#L13 assume !(0 == __VERIFIER_assert_~cond#1); 380#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 379#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 378#L13 assume !(0 == __VERIFIER_assert_~cond#1); 377#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 376#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 375#L13 assume !(0 == __VERIFIER_assert_~cond#1); 374#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 373#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 372#L13 assume !(0 == __VERIFIER_assert_~cond#1); 371#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 370#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 369#L13 assume !(0 == __VERIFIER_assert_~cond#1); 368#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 367#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 366#L13 assume !(0 == __VERIFIER_assert_~cond#1); 365#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 364#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 363#L13 assume !(0 == __VERIFIER_assert_~cond#1); 362#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 361#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 360#L13 assume !(0 == __VERIFIER_assert_~cond#1); 359#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 358#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 356#L13 assume !(0 == __VERIFIER_assert_~cond#1); 357#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 355#L18-2 assume !(main_~j~0#1 < 100); 349#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 350#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 343#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 344#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 345#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1; 351#L16-2 [2024-11-23 02:38:06,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-23 02:38:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:06,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880495819] [2024-11-23 02:38:06,530 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:38:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:06,533 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:38:06,534 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:06,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:06,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:06,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:06,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1255721668, now seen corresponding path program 3 times [2024-11-23 02:38:06,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:06,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117536721] [2024-11-23 02:38:06,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:38:06,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:06,591 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-23 02:38:06,592 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:06,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117536721] [2024-11-23 02:38:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117536721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:38:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113223466] [2024-11-23 02:38:06,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:38:06,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:38:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:06,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:38:06,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 02:38:06,882 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-23 02:38:06,882 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:06,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-23 02:38:06,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:06,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:38:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:07,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113223466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:38:07,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:38:07,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-23 02:38:07,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794473117] [2024-11-23 02:38:07,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:38:07,185 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:07,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:07,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-23 02:38:07,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-23 02:38:07,186 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. cyclomatic complexity: 2 Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:07,234 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2024-11-23 02:38:07,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 76 transitions. [2024-11-23 02:38:07,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2024-11-23 02:38:07,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 76 transitions. [2024-11-23 02:38:07,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2024-11-23 02:38:07,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2024-11-23 02:38:07,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 76 transitions. [2024-11-23 02:38:07,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:07,237 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-23 02:38:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 76 transitions. [2024-11-23 02:38:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-23 02:38:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-11-23 02:38:07,240 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-23 02:38:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-23 02:38:07,241 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-23 02:38:07,241 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:38:07,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 76 transitions. [2024-11-23 02:38:07,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2024-11-23 02:38:07,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:07,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:07,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:07,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:07,244 INFO L745 eck$LassoCheckResult]: Stem: 710#$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(10, 2); 711#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; 708#L16-2 [2024-11-23 02:38:07,244 INFO L747 eck$LassoCheckResult]: Loop: 708#L16-2 assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 705#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 703#L13 assume !(0 == __VERIFIER_assert_~cond#1); 704#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 709#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 774#L13 assume !(0 == __VERIFIER_assert_~cond#1); 773#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 772#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 771#L13 assume !(0 == __VERIFIER_assert_~cond#1); 770#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 769#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 768#L13 assume !(0 == __VERIFIER_assert_~cond#1); 767#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 766#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 765#L13 assume !(0 == __VERIFIER_assert_~cond#1); 764#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 763#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 762#L13 assume !(0 == __VERIFIER_assert_~cond#1); 761#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 760#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 759#L13 assume !(0 == __VERIFIER_assert_~cond#1); 758#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 757#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 756#L13 assume !(0 == __VERIFIER_assert_~cond#1); 755#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 754#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 753#L13 assume !(0 == __VERIFIER_assert_~cond#1); 752#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 751#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 750#L13 assume !(0 == __VERIFIER_assert_~cond#1); 749#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 748#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 747#L13 assume !(0 == __VERIFIER_assert_~cond#1); 746#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 745#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 744#L13 assume !(0 == __VERIFIER_assert_~cond#1); 743#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 742#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 741#L13 assume !(0 == __VERIFIER_assert_~cond#1); 740#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 739#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 738#L13 assume !(0 == __VERIFIER_assert_~cond#1); 737#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 736#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 735#L13 assume !(0 == __VERIFIER_assert_~cond#1); 734#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 733#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 732#L13 assume !(0 == __VERIFIER_assert_~cond#1); 731#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 730#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 729#L13 assume !(0 == __VERIFIER_assert_~cond#1); 728#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 727#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 726#L13 assume !(0 == __VERIFIER_assert_~cond#1); 725#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 724#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 723#L13 assume !(0 == __VERIFIER_assert_~cond#1); 722#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 721#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 720#L13 assume !(0 == __VERIFIER_assert_~cond#1); 719#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 718#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 717#L13 assume !(0 == __VERIFIER_assert_~cond#1); 716#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 715#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 713#L13 assume !(0 == __VERIFIER_assert_~cond#1); 714#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 712#L18-2 assume !(main_~j~0#1 < 100); 706#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 707#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 700#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 701#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 702#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1; 708#L16-2 [2024-11-23 02:38:07,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-23 02:38:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:07,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557449679] [2024-11-23 02:38:07,249 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:38:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:07,254 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:38:07,254 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:07,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:07,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:07,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash 891141956, now seen corresponding path program 4 times [2024-11-23 02:38:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:07,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741341015] [2024-11-23 02:38:07,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:38:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:07,291 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:38:07,291 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741341015] [2024-11-23 02:38:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741341015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:38:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816141089] [2024-11-23 02:38:07,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:38:07,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:38:07,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:07,791 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:38:07,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 02:38:07,845 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:38:07,846 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:07,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-23 02:38:07,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:07,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:38:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:08,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816141089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:38:08,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:38:08,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-11-23 02:38:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030135618] [2024-11-23 02:38:08,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:38:08,673 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:08,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-23 02:38:08,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-23 02:38:08,675 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. cyclomatic complexity: 2 Second operand has 48 states, 48 states have (on average 2.9375) internal successors, (141), 47 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:08,751 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2024-11-23 02:38:08,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 148 transitions. [2024-11-23 02:38:08,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 145 [2024-11-23 02:38:08,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 148 transitions. [2024-11-23 02:38:08,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2024-11-23 02:38:08,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2024-11-23 02:38:08,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 148 transitions. [2024-11-23 02:38:08,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:08,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 148 transitions. [2024-11-23 02:38:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 148 transitions. [2024-11-23 02:38:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-23 02:38:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.0068027210884354) internal successors, (148), 146 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2024-11-23 02:38:08,770 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 148 transitions. [2024-11-23 02:38:08,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-23 02:38:08,771 INFO L425 stractBuchiCegarLoop]: Abstraction has 147 states and 148 transitions. [2024-11-23 02:38:08,771 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:38:08,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 148 transitions. [2024-11-23 02:38:08,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 145 [2024-11-23 02:38:08,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:08,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:08,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:08,775 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:08,776 INFO L745 eck$LassoCheckResult]: Stem: 1415#$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(10, 2); 1416#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; 1413#L16-2 [2024-11-23 02:38:08,776 INFO L747 eck$LassoCheckResult]: Loop: 1413#L16-2 assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 1410#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1408#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1409#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1414#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1551#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1550#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1549#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1548#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1547#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1546#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1545#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1544#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1543#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1542#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1541#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1540#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1539#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1538#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1537#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1536#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1535#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1534#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1533#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1532#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1531#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1530#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1529#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1528#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1527#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1526#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1525#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1524#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1523#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1522#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1521#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1520#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1519#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1518#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1517#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1516#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1515#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1514#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1513#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1512#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1511#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1510#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1509#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1508#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1507#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1506#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1505#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1504#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1503#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1502#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1501#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1500#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1499#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1498#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1497#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1496#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1495#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1494#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1493#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1492#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1491#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1490#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1489#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1488#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1487#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1486#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1485#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1484#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1483#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1482#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1481#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1480#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1479#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1478#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1477#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1476#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1475#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1474#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1473#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1472#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1471#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1470#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1469#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1468#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1467#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1466#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1465#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1464#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1463#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1462#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1461#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1460#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1459#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1458#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1457#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1456#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1455#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1454#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1453#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1452#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1451#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1450#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1449#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1448#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1447#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1446#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1445#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1444#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1443#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1442#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1441#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1440#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1439#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1438#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1437#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1436#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1435#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1434#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1433#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1432#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1431#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1430#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1429#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1428#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1427#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1426#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1425#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1424#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1423#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1422#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1421#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1420#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1418#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1419#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1417#L18-2 assume !(main_~j~0#1 < 100); 1411#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1412#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1405#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1406#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 1407#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1; 1413#L16-2 [2024-11-23 02:38:08,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-23 02:38:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803558576] [2024-11-23 02:38:08,777 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:38:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:08,779 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 02:38:08,779 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:08,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:08,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:08,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 994502724, now seen corresponding path program 5 times [2024-11-23 02:38:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019020194] [2024-11-23 02:38:08,781 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:38:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:08,880 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-23 02:38:08,880 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:10,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019020194] [2024-11-23 02:38:10,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019020194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:38:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470916809] [2024-11-23 02:38:10,262 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:38:10,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:38:10,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:10,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:38:10,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 02:38:10,376 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-23 02:38:10,377 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:10,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-23 02:38:10,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:10,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:38:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:12,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470916809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:38:12,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:38:12,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2024-11-23 02:38:12,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481186462] [2024-11-23 02:38:12,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:38:12,772 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:12,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-23 02:38:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-23 02:38:12,777 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. cyclomatic complexity: 2 Second operand has 96 states, 96 states have (on average 2.96875) internal successors, (285), 95 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:12,979 INFO L93 Difference]: Finished difference Result 291 states and 292 transitions. [2024-11-23 02:38:12,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 291 states and 292 transitions. [2024-11-23 02:38:12,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 289 [2024-11-23 02:38:12,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 291 states to 291 states and 292 transitions. [2024-11-23 02:38:12,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 291 [2024-11-23 02:38:12,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2024-11-23 02:38:12,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 291 states and 292 transitions. [2024-11-23 02:38:12,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:12,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 291 states and 292 transitions. [2024-11-23 02:38:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 292 transitions. [2024-11-23 02:38:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-23 02:38:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 291 states have (on average 1.0034364261168385) internal successors, (292), 290 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2024-11-23 02:38:12,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 291 states and 292 transitions. [2024-11-23 02:38:12,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-23 02:38:12,999 INFO L425 stractBuchiCegarLoop]: Abstraction has 291 states and 292 transitions. [2024-11-23 02:38:12,999 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:38:12,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 292 transitions. [2024-11-23 02:38:13,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 289 [2024-11-23 02:38:13,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:13,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:13,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:13,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:13,002 INFO L745 eck$LassoCheckResult]: Stem: 2816#$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(10, 2); 2817#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; 2814#L16-2 [2024-11-23 02:38:13,002 INFO L747 eck$LassoCheckResult]: Loop: 2814#L16-2 assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 2811#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2809#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2810#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2815#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3096#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3095#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3094#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3093#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3092#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3091#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3090#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3089#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3088#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3087#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3086#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3085#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3084#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3083#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3082#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3081#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3080#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3079#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3078#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3077#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3076#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3075#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3074#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3073#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3072#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3071#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3070#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3069#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3068#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3067#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3066#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3065#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3064#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3063#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3062#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3061#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3060#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3059#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3058#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3057#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3056#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3055#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3054#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3053#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3052#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3051#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3050#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3049#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3048#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3047#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3046#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3045#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3044#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3043#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3042#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3041#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3040#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3039#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3038#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3037#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3036#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3035#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3034#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3033#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3032#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3031#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3030#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3029#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3028#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3027#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3026#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3025#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3024#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3023#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3022#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3021#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3020#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3019#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3018#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3017#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3016#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3015#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3014#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3013#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3012#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3011#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3010#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3009#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3008#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3007#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3006#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3005#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3004#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3003#L13 assume !(0 == __VERIFIER_assert_~cond#1); 3002#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3001#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3000#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2999#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2998#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2997#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2996#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2995#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2994#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2993#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2992#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2991#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2990#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2989#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2988#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2987#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2986#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2985#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2984#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2983#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2982#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2981#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2980#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2979#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2978#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2977#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2976#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2975#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2974#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2973#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2972#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2971#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2970#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2969#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2968#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2967#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2966#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2965#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2964#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2963#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2962#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2961#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2960#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2959#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2958#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2957#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2956#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2955#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2954#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2953#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2952#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2951#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2950#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2949#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2948#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2947#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2946#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2945#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2944#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2943#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2942#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2941#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2940#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2939#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2938#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2937#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2936#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2935#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2934#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2933#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2932#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2931#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2930#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2929#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2928#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2927#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2926#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2925#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2924#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2923#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2922#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2921#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2920#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2919#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2918#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2917#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2916#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2915#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2914#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2913#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2912#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2911#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2910#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2909#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2908#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2907#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2906#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2905#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2904#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2903#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2902#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2901#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2900#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2899#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2898#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2897#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2896#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2895#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2894#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2893#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2892#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2891#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2890#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2889#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2888#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2887#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2886#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2885#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2884#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2883#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2882#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2881#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2880#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2879#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2878#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2877#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2876#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2875#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2874#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2873#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2872#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2871#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2870#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2869#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2868#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2867#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2866#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2865#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2864#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2863#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2862#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2861#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2860#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2859#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2858#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2857#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2856#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2855#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2854#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2853#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2852#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2851#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2850#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2849#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2848#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2847#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2846#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2845#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2844#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2843#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2842#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2841#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2840#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2839#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2838#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2837#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2836#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2835#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2834#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2833#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2832#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2831#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2830#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2829#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2828#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2827#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2826#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2825#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2824#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2823#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2822#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2821#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2819#L13 assume !(0 == __VERIFIER_assert_~cond#1); 2820#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 2818#L18-2 assume !(main_~j~0#1 < 100); 2812#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2813#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 2806#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2807#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 2808#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1; 2814#L16-2 [2024-11-23 02:38:13,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-23 02:38:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905577751] [2024-11-23 02:38:13,005 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:38:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:13,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:13,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:13,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 362166852, now seen corresponding path program 6 times [2024-11-23 02:38:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:13,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569717380] [2024-11-23 02:38:13,011 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:38:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:13,176 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-11-23 02:38:13,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:17,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569717380] [2024-11-23 02:38:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569717380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:38:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454255175] [2024-11-23 02:38:17,450 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:38:17,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:38:17,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:17,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:38:17,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 02:38:17,680 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-11-23 02:38:17,680 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:17,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-23 02:38:17,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:18,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:38:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:21,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454255175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:38:21,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:38:21,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 101 [2024-11-23 02:38:21,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010168234] [2024-11-23 02:38:21,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:38:21,123 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:21,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:21,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-23 02:38:21,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2024-11-23 02:38:21,126 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. cyclomatic complexity: 2 Second operand has 102 states, 102 states have (on average 3.0) internal successors, (306), 101 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:21,259 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2024-11-23 02:38:21,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 309 states and 310 transitions. [2024-11-23 02:38:21,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2024-11-23 02:38:21,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 309 states to 309 states and 310 transitions. [2024-11-23 02:38:21,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 309 [2024-11-23 02:38:21,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2024-11-23 02:38:21,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 310 transitions. [2024-11-23 02:38:21,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:21,262 INFO L218 hiAutomatonCegarLoop]: Abstraction has 309 states and 310 transitions. [2024-11-23 02:38:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 310 transitions. [2024-11-23 02:38:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-11-23 02:38:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 309 states have (on average 1.0032362459546926) internal successors, (310), 308 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2024-11-23 02:38:21,269 INFO L240 hiAutomatonCegarLoop]: Abstraction has 309 states and 310 transitions. [2024-11-23 02:38:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-23 02:38:21,270 INFO L425 stractBuchiCegarLoop]: Abstraction has 309 states and 310 transitions. [2024-11-23 02:38:21,270 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:38:21,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 309 states and 310 transitions. [2024-11-23 02:38:21,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2024-11-23 02:38:21,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:21,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:21,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:21,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:21,272 INFO L745 eck$LassoCheckResult]: Stem: 5249#$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(10, 2); 5250#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; 5247#L16-2 [2024-11-23 02:38:21,272 INFO L747 eck$LassoCheckResult]: Loop: 5247#L16-2 assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 5244#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5242#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5243#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5248#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5547#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5546#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5545#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5544#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5543#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5542#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5541#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5540#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5539#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5538#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5537#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5536#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5535#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5534#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5533#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5532#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5531#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5530#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5529#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5528#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5527#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5526#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5525#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5524#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5523#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5522#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5521#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5520#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5519#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5518#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5517#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5516#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5515#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5514#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5513#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5512#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5511#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5510#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5509#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5508#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5507#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5506#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5505#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5504#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5503#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5502#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5501#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5500#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5499#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5498#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5497#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5496#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5495#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5494#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5493#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5492#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5491#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5490#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5489#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5488#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5487#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5486#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5485#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5484#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5483#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5482#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5481#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5480#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5479#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5478#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5477#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5476#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5475#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5474#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5473#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5472#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5471#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5470#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5469#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5468#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5467#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5466#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5465#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5464#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5463#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5462#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5461#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5460#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5459#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5458#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5457#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5456#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5455#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5454#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5453#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5452#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5451#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5450#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5449#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5448#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5447#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5446#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5445#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5444#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5443#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5442#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5441#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5440#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5439#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5438#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5437#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5436#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5435#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5434#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5433#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5432#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5431#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5430#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5429#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5428#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5427#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5426#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5425#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5424#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5423#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5422#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5421#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5420#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5419#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5418#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5417#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5416#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5415#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5414#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5413#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5412#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5411#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5410#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5409#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5408#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5407#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5406#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5405#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5404#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5403#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5402#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5401#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5400#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5399#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5398#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5397#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5396#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5395#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5394#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5393#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5392#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5391#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5390#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5389#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5388#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5387#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5386#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5385#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5384#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5383#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5382#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5381#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5380#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5379#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5378#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5377#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5376#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5375#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5374#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5373#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5372#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5371#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5370#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5369#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5368#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5367#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5366#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5365#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5364#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5363#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5362#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5361#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5360#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5359#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5358#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5357#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5356#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5355#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5354#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5353#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5352#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5351#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5350#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5349#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5348#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5347#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5346#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5345#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5344#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5343#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5342#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5341#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5340#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5339#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5338#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5337#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5336#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5335#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5334#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5333#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5332#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5331#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5330#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5329#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5328#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5327#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5326#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5325#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5324#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5323#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5322#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5321#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5320#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5319#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5318#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5317#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5316#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5315#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5314#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5313#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5312#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5311#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5310#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5309#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5308#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5307#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5306#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5305#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5304#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5303#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5302#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5301#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5300#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5299#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5298#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5297#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5296#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5295#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5294#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5293#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5292#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5291#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5290#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5289#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5288#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5287#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5286#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5285#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5284#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5283#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5282#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5281#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5280#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5279#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5278#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5277#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5276#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5275#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5274#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5273#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5272#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5271#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5270#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5269#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5268#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5267#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5266#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5265#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5264#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5263#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5262#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5261#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5260#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5259#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5258#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5257#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5256#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5255#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5254#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5252#L13 assume !(0 == __VERIFIER_assert_~cond#1); 5253#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 5251#L18-2 assume !(main_~j~0#1 < 100); 5245#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5246#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 5239#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5240#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 5241#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1; 5247#L16-2 [2024-11-23 02:38:21,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-23 02:38:21,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:21,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281147694] [2024-11-23 02:38:21,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:21,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:21,276 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:38:21,276 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:21,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:21,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -546448252, now seen corresponding path program 7 times [2024-11-23 02:38:21,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:21,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114673784] [2024-11-23 02:38:21,279 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:38:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:21,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:21,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:21,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:21,402 INFO L85 PathProgramCache]: Analyzing trace with hash 558249346, now seen corresponding path program 1 times [2024-11-23 02:38:21,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:21,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505419077] [2024-11-23 02:38:21,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:21,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:21,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:21,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:31,358 WARN L286 SmtUtils]: Spent 9.79s on a formula simplification. DAG size of input: 1228 DAG size of output: 923 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-23 02:38:46,124 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:46,125 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:46,125 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:46,125 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:46,125 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:38:46,125 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,125 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:46,125 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:46,125 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration8_Loop [2024-11-23 02:38:46,125 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:46,125 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:46,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,200 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:46,201 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:38:46,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,204 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-23 02:38:46,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:46,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:46,223 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:38:46,223 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:38:46,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:46,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,231 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-23 02:38:46,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:46,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:46,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:46,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,256 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-23 02:38:46,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:38:46,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:46,285 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:38:46,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:46,290 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:46,290 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:46,290 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:46,290 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:46,291 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:38:46,291 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,291 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:46,291 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:46,291 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration8_Loop [2024-11-23 02:38:46,291 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:46,291 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:46,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,328 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:46,331 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:38:46,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,335 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-23 02:38:46,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:46,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:46,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:46,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:46,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:46,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:46,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:46,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:46,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:38:46,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-23 02:38:46,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-23 02:38:46,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:46,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:46,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:46,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:46,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:46,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:46,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:46,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:46,392 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:38:46,395 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:38:46,395 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:38:46,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,398 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-23 02:38:46,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:38:46,400 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:38:46,400 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:38:46,400 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 199 Supporting invariants [] [2024-11-23 02:38:46,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:46,411 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:38:46,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:46,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:46,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:46,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:46,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:47,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-23 02:38:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14950 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14950 trivial. 0 not checked. [2024-11-23 02:38:47,440 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-23 02:38:47,444 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 309 states and 310 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,480 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 309 states and 310 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 617 states and 620 transitions. Complement of second has 6 states. [2024-11-23 02:38:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-23 02:38:47,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 307 letters. [2024-11-23 02:38:47,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 309 letters. Loop has 307 letters. [2024-11-23 02:38:47,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 614 letters. [2024-11-23 02:38:47,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 617 states and 620 transitions. [2024-11-23 02:38:47,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:38:47,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 617 states to 614 states and 617 transitions. [2024-11-23 02:38:47,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 305 [2024-11-23 02:38:47,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2024-11-23 02:38:47,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 614 states and 617 transitions. [2024-11-23 02:38:47,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:38:47,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 614 states and 617 transitions. [2024-11-23 02:38:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states and 617 transitions. [2024-11-23 02:38:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 315. [2024-11-23 02:38:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 315 states have (on average 1.0095238095238095) internal successors, (318), 314 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 318 transitions. [2024-11-23 02:38:47,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 315 states and 318 transitions. [2024-11-23 02:38:47,512 INFO L425 stractBuchiCegarLoop]: Abstraction has 315 states and 318 transitions. [2024-11-23 02:38:47,512 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:38:47,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 318 transitions. [2024-11-23 02:38:47,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:38:47,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:47,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:47,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:38:47,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:38:47,514 INFO L745 eck$LassoCheckResult]: Stem: 7129#$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(10, 2); 7130#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; 7133#L16-2 assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 7123#L18-2 [2024-11-23 02:38:47,514 INFO L747 eck$LassoCheckResult]: Loop: 7123#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 7119#L13 assume !(0 == __VERIFIER_assert_~cond#1); 7120#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 7123#L18-2 [2024-11-23 02:38:47,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-11-23 02:38:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128136619] [2024-11-23 02:38:47,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:47,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash 50101, now seen corresponding path program 1 times [2024-11-23 02:38:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269770130] [2024-11-23 02:38:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash 889698734, now seen corresponding path program 1 times [2024-11-23 02:38:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885438321] [2024-11-23 02:38:47,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:47,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,563 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:47,563 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:47,563 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:47,564 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:47,564 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:38:47,564 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,564 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:47,564 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:47,564 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration9_Loop [2024-11-23 02:38:47,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:47,564 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:47,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,590 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:47,590 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:38:47,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,592 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-23 02:38:47,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:47,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,606 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:38:47,606 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:38:47,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,614 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-23 02:38:47,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:47,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,629 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:38:47,629 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:38:47,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-23 02:38:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,636 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-23 02:38:47,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:47,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,649 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:38:47,649 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:38:47,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,657 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-23 02:38:47,659 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:47,659 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,677 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-23 02:38:47,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:38:47,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,793 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:38:47,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,800 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:47,800 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:47,800 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:47,800 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:47,800 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:38:47,800 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,800 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:47,800 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:47,800 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration9_Loop [2024-11-23 02:38:47,800 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:47,800 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:47,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,828 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:47,828 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:38:47,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,830 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-23 02:38:47,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:47,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:47,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:47,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:47,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:47,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:47,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:47,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:47,844 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:38:47,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,856 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-23 02:38:47,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:47,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:47,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:47,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:47,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:47,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:47,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:47,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:47,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:38:47,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,877 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-23 02:38:47,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:47,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:47,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:47,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:47,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:47,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:47,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:47,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:47,891 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:38:47,893 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:38:47,893 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:38:47,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,894 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-23 02:38:47,896 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:38:47,896 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:38:47,896 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:38:47,896 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 199 Supporting invariants [] [2024-11-23 02:38:47,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,903 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:38:47,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:47,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:47,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:47,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:47,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:47,936 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:47,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 315 states and 318 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,948 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 315 states and 318 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 824 states and 828 transitions. Complement of second has 5 states. [2024-11-23 02:38:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-23 02:38:47,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2024-11-23 02:38:47,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2024-11-23 02:38:47,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2024-11-23 02:38:47,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 824 states and 828 transitions. [2024-11-23 02:38:47,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:38:47,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 824 states to 619 states and 622 transitions. [2024-11-23 02:38:47,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-23 02:38:47,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-23 02:38:47,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 619 states and 622 transitions. [2024-11-23 02:38:47,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:38:47,958 INFO L218 hiAutomatonCegarLoop]: Abstraction has 619 states and 622 transitions. [2024-11-23 02:38:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states and 622 transitions. [2024-11-23 02:38:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-11-23 02:38:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 616 states have (on average 1.00487012987013) internal successors, (619), 615 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 619 transitions. [2024-11-23 02:38:47,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 616 states and 619 transitions. [2024-11-23 02:38:47,967 INFO L425 stractBuchiCegarLoop]: Abstraction has 616 states and 619 transitions. [2024-11-23 02:38:47,967 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:38:47,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 616 states and 619 transitions. [2024-11-23 02:38:47,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:38:47,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:47,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:47,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [100, 100, 100, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:47,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:38:47,973 INFO L745 eck$LassoCheckResult]: Stem: 8307#$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(10, 2); 8308#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; 8309#L16-2 assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 8301#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8298#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8299#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8306#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8907#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8906#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8905#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8904#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8903#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8902#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8901#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8900#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8899#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8898#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8897#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8896#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8895#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8894#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8893#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8892#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8891#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8890#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8889#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8888#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8887#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8886#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8885#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8884#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8883#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8882#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8881#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8880#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8879#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8878#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8877#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8876#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8875#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8874#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8873#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8872#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8871#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8870#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8869#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8868#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8867#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8866#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8865#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8864#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8863#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8862#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8861#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8860#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8859#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8858#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8857#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8856#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8855#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8854#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8853#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8852#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8851#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8850#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8849#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8848#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8847#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8846#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8845#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8844#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8843#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8842#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8841#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8840#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8839#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8838#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8837#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8836#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8835#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8834#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8833#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8832#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8831#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8830#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8829#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8828#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8827#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8826#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8825#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8824#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8823#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8822#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8821#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8820#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8819#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8818#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8817#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8816#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8815#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8814#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8813#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8812#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8811#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8810#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8809#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8808#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8807#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8806#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8805#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8804#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8803#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8802#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8801#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8800#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8799#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8798#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8797#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8796#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8795#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8794#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8793#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8792#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8791#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8790#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8789#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8788#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8787#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8786#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8785#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8784#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8783#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8782#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8781#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8780#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8779#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8778#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8777#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8776#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8775#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8774#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8773#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8772#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8771#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8770#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8769#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8768#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8767#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8766#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8765#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8764#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8763#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8762#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8761#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8760#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8759#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8758#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8757#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8756#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8755#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8754#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8753#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8752#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8751#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8750#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8749#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8748#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8747#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8746#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8745#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8744#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8743#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8742#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8741#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8740#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8739#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8738#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8737#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8736#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8735#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8734#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8733#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8732#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8731#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8730#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8729#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8728#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8727#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8726#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8725#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8724#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8723#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8722#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8721#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8720#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8719#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8718#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8717#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8716#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8715#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8714#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8713#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8712#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8711#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8710#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8709#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8708#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8707#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8706#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8705#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8704#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8703#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8702#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8701#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8700#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8699#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8698#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8697#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8696#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8695#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8694#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8693#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8692#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8691#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8690#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8689#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8688#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8687#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8686#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8685#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8684#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8683#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8682#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8681#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8680#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8679#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8678#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8677#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8676#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8675#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8674#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8673#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8672#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8671#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8670#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8669#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8668#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8667#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8666#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8665#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8664#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8663#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8662#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8661#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8660#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8659#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8658#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8657#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8656#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8655#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8654#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8653#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8652#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8651#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8650#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8649#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8648#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8647#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8646#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8645#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8644#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8643#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8642#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8641#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8640#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8639#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8638#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8637#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8636#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8635#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8634#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8633#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8632#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8631#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8630#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8629#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8628#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8627#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8626#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8625#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8624#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8623#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8622#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8621#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8620#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8619#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8618#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8617#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8616#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8318#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8319#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8317#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8316#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8311#L18-2 assume !(main_~j~0#1 < 100); 8302#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 100 == main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8303#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 8292#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8293#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 8295#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_~j~0#1; 8304#L16-2 assume !!(main_~i~0#1 < 100);main_~j~0#1 := 0; 8300#L18-2 [2024-11-23 02:38:47,973 INFO L747 eck$LassoCheckResult]: Loop: 8300#L18-2 assume !!(main_~j~0#1 < 100);main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 100 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 8296#L13 assume !(0 == __VERIFIER_assert_~cond#1); 8297#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 8300#L18-2 [2024-11-23 02:38:47,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash 125860553, now seen corresponding path program 2 times [2024-11-23 02:38:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343860538] [2024-11-23 02:38:47,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:48,059 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:38:48,059 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:48,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:48,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:48,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash 50101, now seen corresponding path program 2 times [2024-11-23 02:38:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:48,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391648296] [2024-11-23 02:38:48,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:48,124 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:38:48,124 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:48,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:48,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:48,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash 5305325, now seen corresponding path program 3 times [2024-11-23 02:38:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405844302] [2024-11-23 02:38:48,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:38:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:48,232 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2024-11-23 02:38:48,232 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:48,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:48,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:48,310 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:48,310 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:48,310 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:48,310 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:48,310 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:38:48,310 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,310 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:48,310 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:48,310 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration10_Loop [2024-11-23 02:38:48,310 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:48,311 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:48,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,333 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:48,333 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:38:48,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,335 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-23 02:38:48,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:48,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:48,353 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:38:48,353 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:38:48,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-23 02:38:48,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,361 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-23 02:38:48,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:48,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:48,375 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:38:48,376 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:38:48,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-23 02:38:48,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,387 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-23 02:38:48,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:48,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:48,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:48,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,410 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-23 02:38:48,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:38:48,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:48,437 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:38:48,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:48,443 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:48,443 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:48,443 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:48,443 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:48,443 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:38:48,443 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,443 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:48,443 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:48,443 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex1b.i_Iteration10_Loop [2024-11-23 02:38:48,443 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:48,443 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:48,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,471 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:48,472 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:38:48,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,474 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-23 02:38:48,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:48,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:48,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:48,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:48,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:48,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:48,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:48,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:48,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:38:48,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-23 02:38:48,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,501 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-23 02:38:48,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:48,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:48,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:48,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:48,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:48,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:48,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:48,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:48,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:38:48,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:48,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,527 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-23 02:38:48,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:48,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:48,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:48,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:48,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:48,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:48,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:48,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:48,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:38:48,545 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:38:48,545 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:38:48,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,547 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-23 02:38:48,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:38:48,549 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:38:48,549 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:38:48,549 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 199 Supporting invariants [] [2024-11-23 02:38:48,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:48,556 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:38:48,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:48,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:48,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:48,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:48,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:48,970 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:48,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 616 states and 619 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:48,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 616 states and 619 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Result 818 states and 822 transitions. Complement of second has 5 states. [2024-11-23 02:38:48,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-23 02:38:48,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 310 letters. Loop has 3 letters. [2024-11-23 02:38:48,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:48,986 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:38:48,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:49,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:49,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:49,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:49,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:49,428 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:49,428 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 616 states and 619 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:49,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 616 states and 619 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Result 818 states and 822 transitions. Complement of second has 7 states. [2024-11-23 02:38:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-11-23 02:38:49,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 310 letters. Loop has 3 letters. [2024-11-23 02:38:49,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:49,447 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:38:49,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:49,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:49,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:49,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:49,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:49,891 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:49,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 616 states and 619 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:49,900 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 616 states and 619 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Result 1020 states and 1025 transitions. Complement of second has 4 states. [2024-11-23 02:38:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2024-11-23 02:38:49,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 310 letters. Loop has 3 letters. [2024-11-23 02:38:49,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:49,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 313 letters. Loop has 3 letters. [2024-11-23 02:38:49,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:49,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 310 letters. Loop has 6 letters. [2024-11-23 02:38:49,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:49,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1020 states and 1025 transitions. [2024-11-23 02:38:49,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:38:49,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1020 states to 0 states and 0 transitions. [2024-11-23 02:38:49,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-23 02:38:49,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-23 02:38:49,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-23 02:38:49,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:49,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:38:49,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:38:49,908 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:38:49,908 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-23 02:38:49,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-23 02:38:49,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:38:49,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-23 02:38:49,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:38:49 BoogieIcfgContainer [2024-11-23 02:38:49,913 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:38:49,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:38:49,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:38:49,914 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:38:49,914 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:38:05" (3/4) ... [2024-11-23 02:38:49,916 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 02:38:49,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:38:49,917 INFO L158 Benchmark]: Toolchain (without parser) took 44888.60ms. Allocated memory was 184.5MB in the beginning and 841.0MB in the end (delta: 656.4MB). Free memory was 116.0MB in the beginning and 323.6MB in the end (delta: -207.6MB). Peak memory consumption was 451.4MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,918 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 104.9MB. Free memory was 76.2MB in the beginning and 76.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:38:49,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.56ms. Allocated memory is still 184.5MB. Free memory was 115.7MB in the beginning and 103.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.13ms. Allocated memory is still 184.5MB. Free memory was 103.8MB in the beginning and 102.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,918 INFO L158 Benchmark]: Boogie Preprocessor took 40.58ms. Allocated memory is still 184.5MB. Free memory was 102.1MB in the beginning and 100.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,918 INFO L158 Benchmark]: RCFGBuilder took 235.04ms. Allocated memory is still 184.5MB. Free memory was 100.6MB in the beginning and 151.2MB in the end (delta: -50.6MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,919 INFO L158 Benchmark]: BuchiAutomizer took 44394.01ms. Allocated memory was 184.5MB in the beginning and 841.0MB in the end (delta: 656.4MB). Free memory was 151.2MB in the beginning and 323.6MB in the end (delta: -172.4MB). Peak memory consumption was 486.6MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,919 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 841.0MB. Free memory is still 323.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:38:49,920 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.09ms. Allocated memory is still 104.9MB. Free memory was 76.2MB in the beginning and 76.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.56ms. Allocated memory is still 184.5MB. Free memory was 115.7MB in the beginning and 103.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.13ms. Allocated memory is still 184.5MB. Free memory was 103.8MB in the beginning and 102.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.58ms. Allocated memory is still 184.5MB. Free memory was 102.1MB in the beginning and 100.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 235.04ms. Allocated memory is still 184.5MB. Free memory was 100.6MB in the beginning and 151.2MB in the end (delta: -50.6MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 44394.01ms. Allocated memory was 184.5MB in the beginning and 841.0MB in the end (delta: 656.4MB). Free memory was 151.2MB in the beginning and 323.6MB in the end (delta: -172.4MB). Peak memory consumption was 486.6MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 841.0MB. Free memory is still 323.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 199) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * j) + 199) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + 199) and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 102 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.3s and 11 iterations. TraceHistogramMax:100. Analysis of lassos took 41.0s. Construction of modules took 0.3s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 302 StatesRemovedByMinimization, 2 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 14950/14950 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 825 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 695 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 423 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 130 mSDtfsCounter, 423 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI7 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-23 02:38:49,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:50,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-23 02:38:50,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:50,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-23 02:38:50,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:50,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:51,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 02:38:51,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:51,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE