./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --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 eda42c9201fdedd9f50669e53ef2af5b1d7cb675 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:50:18,691 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:50:18,692 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:50:18,699 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:50:18,699 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:50:18,700 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:50:18,701 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:50:18,702 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:50:18,703 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:50:18,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:50:18,704 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:50:18,704 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:50:18,705 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:50:18,705 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:50:18,706 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:50:18,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:50:18,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:50:18,708 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:50:18,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:50:18,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:50:18,712 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:50:18,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:50:18,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:50:18,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:50:18,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:50:18,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:50:18,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:50:18,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:50:18,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:50:18,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:50:18,718 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:50:18,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:50:18,718 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:50:18,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:50:18,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:50:18,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:50:18,720 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 08:50:18,730 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:50:18,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:50:18,731 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:50:18,731 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:50:18,731 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:50:18,731 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 08:50:18,731 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 08:50:18,732 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 08:50:18,732 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 08:50:18,732 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 08:50:18,732 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 08:50:18,732 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:50:18,732 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:50:18,732 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 08:50:18,732 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:50:18,733 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:50:18,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:50:18,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 08:50:18,733 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 08:50:18,733 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 08:50:18,733 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:50:18,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:50:18,733 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 08:50:18,733 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:50:18,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 08:50:18,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:50:18,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:50:18,734 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 08:50:18,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:50:18,734 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:50:18,734 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 08:50:18,735 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 08:50:18,735 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> eda42c9201fdedd9f50669e53ef2af5b1d7cb675 [2018-11-23 08:50:18,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:50:18,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:50:18,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:50:18,769 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:50:18,769 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:50:18,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-23 08:50:18,806 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/data/f2cbeee00/2d0b6f7a235a49f88792caf2166ba2d7/FLAG3af32e8ed [2018-11-23 08:50:19,201 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:50:19,201 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-23 08:50:19,205 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/data/f2cbeee00/2d0b6f7a235a49f88792caf2166ba2d7/FLAG3af32e8ed [2018-11-23 08:50:19,213 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/data/f2cbeee00/2d0b6f7a235a49f88792caf2166ba2d7 [2018-11-23 08:50:19,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:50:19,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:50:19,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:50:19,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:50:19,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:50:19,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19, skipping insertion in model container [2018-11-23 08:50:19,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:50:19,242 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:50:19,348 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:50:19,351 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:50:19,363 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:50:19,375 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:50:19,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19 WrapperNode [2018-11-23 08:50:19,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:50:19,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:50:19,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:50:19,376 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:50:19,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:50:19,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:50:19,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:50:19,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:50:19,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (1/1) ... [2018-11-23 08:50:19,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:50:19,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:50:19,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:50:19,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:50:19,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:50:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 08:50:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:50:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:50:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:50:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 08:50:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:50:19,650 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:50:19,650 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 08:50:19,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:19 BoogieIcfgContainer [2018-11-23 08:50:19,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:50:19,651 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 08:50:19,651 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 08:50:19,654 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 08:50:19,655 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:50:19,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 08:50:19" (1/3) ... [2018-11-23 08:50:19,656 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c6f8b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 08:50:19, skipping insertion in model container [2018-11-23 08:50:19,656 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:50:19,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:19" (2/3) ... [2018-11-23 08:50:19,656 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c6f8b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 08:50:19, skipping insertion in model container [2018-11-23 08:50:19,656 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:50:19,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:19" (3/3) ... [2018-11-23 08:50:19,658 INFO L375 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-23 08:50:19,694 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:50:19,694 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 08:50:19,694 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 08:50:19,694 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 08:50:19,695 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:50:19,695 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:50:19,695 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 08:50:19,695 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:50:19,695 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 08:50:19,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 08:50:19,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-23 08:50:19,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:19,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:19,719 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 08:50:19,720 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 08:50:19,720 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 08:50:19,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 08:50:19,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-23 08:50:19,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:19,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:19,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 08:50:19,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 08:50:19,726 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 4#L19-3true [2018-11-23 08:50:19,726 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 6#L19-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 4#L19-3true [2018-11-23 08:50:19,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 08:50:19,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:19,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:19,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:19,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:19,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:19,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:19,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 08:50:19,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:19,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:19,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:19,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:19,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:19,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 08:50:19,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:19,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:19,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:19,954 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:50:19,955 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:50:19,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:50:19,955 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:50:19,955 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 08:50:19,956 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:50:19,956 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:50:19,956 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:50:19,956 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 08:50:19,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:50:19,956 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:50:19,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:19,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:19,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:19,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:19,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:19,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:19,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:19,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:19,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:20,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:20,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:20,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:20,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:20,151 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:50:20,154 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 08:50:20,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:50:20,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:50:20,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:50:20,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:50:20,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:50:20,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:50:20,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:20,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:20,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:20,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:50:20,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:50:20,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:20,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:20,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:20,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:20,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:20,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:20,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:50:20,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:50:20,254 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 08:50:20,272 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 08:50:20,273 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 08:50:20,275 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 08:50:20,276 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 08:50:20,277 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 08:50:20,277 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1) = -2*ULTIMATE.start_main_~i~0 + 21*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1 Supporting invariants [] [2018-11-23 08:50:20,280 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 08:50:20,284 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 08:50:20,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:20,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:20,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:20,364 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 08:50:20,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2018-11-23 08:50:20,398 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 8 states. [2018-11-23 08:50:20,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 08:50:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 08:50:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-23 08:50:20,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 08:50:20,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:50:20,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 08:50:20,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:50:20,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 08:50:20,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:50:20,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2018-11-23 08:50:20,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:20,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2018-11-23 08:50:20,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-23 08:50:20,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-23 08:50:20,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2018-11-23 08:50:20,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:20,409 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-23 08:50:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2018-11-23 08:50:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 08:50:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 08:50:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-23 08:50:20,426 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-23 08:50:20,426 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-23 08:50:20,426 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 08:50:20,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-11-23 08:50:20,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:20,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:20,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:20,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 08:50:20,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:20,427 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 85#L19-3 assume !(main_~i~0 < 11); 82#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 83#L26-2 [2018-11-23 08:50:20,427 INFO L796 eck$LassoCheckResult]: Loop: 83#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 83#L26-2 [2018-11-23 08:50:20,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:20,428 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-23 08:50:20,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:20,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:20,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:20,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:20,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:50:20,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:50:20,455 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:20,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:20,455 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2018-11-23 08:50:20,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:20,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:20,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:20,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:20,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:50:20,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:50:20,519 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 08:50:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:20,540 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-11-23 08:50:20,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:50:20,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-23 08:50:20,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:20,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-11-23 08:50:20,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 08:50:20,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 08:50:20,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-23 08:50:20,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:20,542 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-23 08:50:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-23 08:50:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-11-23 08:50:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 08:50:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-23 08:50:20,543 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 08:50:20,544 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 08:50:20,544 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 08:50:20,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-23 08:50:20,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:20,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:20,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:20,545 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 08:50:20,545 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:20,545 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 105#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 108#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 109#L19-3 assume !(main_~i~0 < 11); 106#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 107#L26-2 [2018-11-23 08:50:20,545 INFO L796 eck$LassoCheckResult]: Loop: 107#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 107#L26-2 [2018-11-23 08:50:20,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-23 08:50:20,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:20,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:20,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:20,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:20,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:20,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:20,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:20,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:20,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:50:20,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 08:50:20,605 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:20,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2018-11-23 08:50:20,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:20,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:20,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:50:20,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:50:20,655 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-23 08:50:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:20,670 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-23 08:50:20,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:50:20,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-23 08:50:20,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:20,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2018-11-23 08:50:20,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 08:50:20,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 08:50:20,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-11-23 08:50:20,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:20,672 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-23 08:50:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-11-23 08:50:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-11-23 08:50:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 08:50:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-23 08:50:20,674 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-23 08:50:20,674 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-23 08:50:20,674 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 08:50:20,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-23 08:50:20,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:20,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:20,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:20,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-23 08:50:20,675 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:20,675 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 145#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 146#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 150#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 151#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 152#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 153#L19-3 assume !(main_~i~0 < 11); 147#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 148#L26-2 [2018-11-23 08:50:20,675 INFO L796 eck$LassoCheckResult]: Loop: 148#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 148#L26-2 [2018-11-23 08:50:20,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:20,676 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-23 08:50:20,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:20,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:20,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:20,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:20,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:20,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:50:20,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:50:20,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:20,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:20,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:50:20,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 08:50:20,775 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:20,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:20,775 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2018-11-23 08:50:20,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:20,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:20,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:20,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:20,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:50:20,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:50:20,869 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-23 08:50:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:20,908 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 08:50:20,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:50:20,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-11-23 08:50:20,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:20,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 08:50:20,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 08:50:20,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 08:50:20,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-23 08:50:20,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:20,909 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 08:50:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-23 08:50:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-11-23 08:50:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 08:50:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-11-23 08:50:20,910 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-23 08:50:20,910 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-23 08:50:20,910 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 08:50:20,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-11-23 08:50:20,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:20,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:20,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:20,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-23 08:50:20,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:20,911 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 200#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 201#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 207#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 205#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 202#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 203#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 206#L19-3 assume !(main_~i~0 < 11); 197#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 198#L26-2 [2018-11-23 08:50:20,911 INFO L796 eck$LassoCheckResult]: Loop: 198#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 198#L26-2 [2018-11-23 08:50:20,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:20,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-23 08:50:20,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:20,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:20,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:20,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:20,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:20,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:20,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:50:20,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 08:50:20,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:20,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:50:21,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 08:50:21,003 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:21,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,003 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2018-11-23 08:50:21,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:21,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:50:21,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:50:21,060 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-23 08:50:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:21,078 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 08:50:21,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:50:21,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-11-23 08:50:21,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:21,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 08:50:21,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 08:50:21,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 08:50:21,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2018-11-23 08:50:21,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:21,080 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 08:50:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2018-11-23 08:50:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-11-23 08:50:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 08:50:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 08:50:21,081 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 08:50:21,081 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 08:50:21,081 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 08:50:21,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2018-11-23 08:50:21,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:21,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:21,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:21,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-23 08:50:21,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:21,082 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 262#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 263#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 265#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 266#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 267#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 268#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 272#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 271#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 270#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L19-3 assume !(main_~i~0 < 11); 260#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 261#L26-2 [2018-11-23 08:50:21,083 INFO L796 eck$LassoCheckResult]: Loop: 261#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 261#L26-2 [2018-11-23 08:50:21,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,083 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-23 08:50:21,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:21,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:21,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:50:21,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:50:21,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:21,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:50:21,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 08:50:21,198 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:21,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,199 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2018-11-23 08:50:21,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:21,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 08:50:21,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:50:21,248 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-23 08:50:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:21,271 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 08:50:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:50:21,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2018-11-23 08:50:21,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:21,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 08:50:21,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 08:50:21,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 08:50:21,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-11-23 08:50:21,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:21,273 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 08:50:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-11-23 08:50:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-11-23 08:50:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 08:50:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 08:50:21,275 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 08:50:21,275 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 08:50:21,275 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 08:50:21,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-23 08:50:21,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:21,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:21,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:21,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-23 08:50:21,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:21,276 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 336#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 337#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 338#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 339#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 340#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 342#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 348#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 347#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 346#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 345#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 344#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 343#L19-3 assume !(main_~i~0 < 11); 334#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 335#L26-2 [2018-11-23 08:50:21,276 INFO L796 eck$LassoCheckResult]: Loop: 335#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 335#L26-2 [2018-11-23 08:50:21,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-23 08:50:21,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:21,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:21,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:21,330 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 08:50:21,343 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 08:50:21,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:21,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:50:21,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 08:50:21,374 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:21,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2018-11-23 08:50:21,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:50:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:50:21,410 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-23 08:50:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:21,429 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 08:50:21,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 08:50:21,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2018-11-23 08:50:21,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:21,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 08:50:21,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 08:50:21,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 08:50:21,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2018-11-23 08:50:21,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:21,431 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 08:50:21,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2018-11-23 08:50:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-23 08:50:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 08:50:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 08:50:21,433 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 08:50:21,433 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 08:50:21,433 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 08:50:21,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-23 08:50:21,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:21,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:21,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:21,434 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2018-11-23 08:50:21,434 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:21,434 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 420#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 424#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 425#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 426#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 435#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 434#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 433#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 432#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 431#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 430#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 429#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 428#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 427#L19-3 assume !(main_~i~0 < 11); 421#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 422#L26-2 [2018-11-23 08:50:21,434 INFO L796 eck$LassoCheckResult]: Loop: 422#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 422#L26-2 [2018-11-23 08:50:21,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2018-11-23 08:50:21,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:21,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:21,512 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 08:50:21,529 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 08:50:21,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:21,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:50:21,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 08:50:21,553 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:21,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,553 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2018-11-23 08:50:21,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:21,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 08:50:21,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 08:50:21,603 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-23 08:50:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:21,629 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 08:50:21,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:50:21,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-23 08:50:21,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:21,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 08:50:21,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 08:50:21,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 08:50:21,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2018-11-23 08:50:21,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:21,631 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 08:50:21,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2018-11-23 08:50:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-23 08:50:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 08:50:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 08:50:21,632 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 08:50:21,632 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 08:50:21,632 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 08:50:21,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2018-11-23 08:50:21,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:21,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:21,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:21,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2018-11-23 08:50:21,634 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:21,634 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 516#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 520#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 521#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 522#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 533#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 532#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 531#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 530#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 529#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 528#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 527#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 526#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 525#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 524#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 523#L19-3 assume !(main_~i~0 < 11); 517#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 518#L26-2 [2018-11-23 08:50:21,634 INFO L796 eck$LassoCheckResult]: Loop: 518#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 518#L26-2 [2018-11-23 08:50:21,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2018-11-23 08:50:21,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:21,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:21,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:21,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:50:21,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 08:50:21,771 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:21,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2018-11-23 08:50:21,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 08:50:21,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:50:21,821 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-11-23 08:50:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:21,841 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 08:50:21,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 08:50:21,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2018-11-23 08:50:21,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:21,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 08:50:21,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 08:50:21,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 08:50:21,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-23 08:50:21,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:21,843 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 08:50:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-23 08:50:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 08:50:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 08:50:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 08:50:21,844 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 08:50:21,844 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 08:50:21,844 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 08:50:21,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-11-23 08:50:21,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:21,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:21,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:21,845 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2018-11-23 08:50:21,845 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:21,845 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 625#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 626#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 627#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 628#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 630#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 642#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 641#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 640#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 638#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 636#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 635#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 634#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 633#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 632#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 631#L19-3 assume !(main_~i~0 < 11); 622#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 623#L26-2 [2018-11-23 08:50:21,845 INFO L796 eck$LassoCheckResult]: Loop: 623#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 623#L26-2 [2018-11-23 08:50:21,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2018-11-23 08:50:21,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:21,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:21,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:21,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:50:21,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:50:21,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:21,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:21,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:50:21,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 08:50:21,950 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:21,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2018-11-23 08:50:21,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:21,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:22,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 08:50:22,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 08:50:22,002 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-23 08:50:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:22,029 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 08:50:22,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 08:50:22,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-11-23 08:50:22,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:22,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 08:50:22,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 08:50:22,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 08:50:22,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-11-23 08:50:22,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:22,030 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 08:50:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-11-23 08:50:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-23 08:50:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 08:50:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 08:50:22,031 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 08:50:22,031 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 08:50:22,032 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 08:50:22,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2018-11-23 08:50:22,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:22,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:22,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:22,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2018-11-23 08:50:22,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:22,032 INFO L794 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 740#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 741#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 745#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 746#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 747#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 762#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 761#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 760#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 759#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 758#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 757#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 756#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 755#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 754#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 753#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 752#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 751#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 750#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 749#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 748#L19-3 assume !(main_~i~0 < 11); 742#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 743#L26-2 [2018-11-23 08:50:22,033 INFO L796 eck$LassoCheckResult]: Loop: 743#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 743#L26-2 [2018-11-23 08:50:22,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:22,033 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2018-11-23 08:50:22,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:22,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:22,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:22,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:22,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:22,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:22,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:50:22,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 08:50:22,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:22,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:22,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:50:22,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 08:50:22,232 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:22,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:22,233 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2018-11-23 08:50:22,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:22,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:22,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:22,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:22,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 08:50:22,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 08:50:22,274 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-23 08:50:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:22,306 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 08:50:22,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 08:50:22,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-11-23 08:50:22,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:22,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 08:50:22,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 08:50:22,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 08:50:22,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2018-11-23 08:50:22,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:22,311 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 08:50:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2018-11-23 08:50:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-23 08:50:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 08:50:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 08:50:22,312 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 08:50:22,312 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 08:50:22,312 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 08:50:22,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2018-11-23 08:50:22,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:22,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:22,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:22,313 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2018-11-23 08:50:22,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:22,314 INFO L794 eck$LassoCheckResult]: Stem: 874#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 870#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 871#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 875#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 876#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 877#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 894#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 893#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 892#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 891#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 890#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 889#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 885#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 884#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 883#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 881#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 880#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 879#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 878#L19-3 assume !(main_~i~0 < 11); 872#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 873#L26-2 [2018-11-23 08:50:22,314 INFO L796 eck$LassoCheckResult]: Loop: 873#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 873#L26-2 [2018-11-23 08:50:22,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:22,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2018-11-23 08:50:22,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:22,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:22,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:22,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7449072-1c33-4891-a892-707c976f56e7/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:22,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:50:22,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:50:22,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:22,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:22,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:50:22,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 08:50:22,462 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:50:22,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2018-11-23 08:50:22,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:22,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:22,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:22,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:22,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 08:50:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 08:50:22,511 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2018-11-23 08:50:22,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:22,555 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 08:50:22,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 08:50:22,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2018-11-23 08:50:22,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:22,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 08:50:22,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 08:50:22,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 08:50:22,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2018-11-23 08:50:22,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:22,558 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 08:50:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2018-11-23 08:50:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 08:50:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 08:50:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 08:50:22,560 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 08:50:22,560 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 08:50:22,560 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 08:50:22,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2018-11-23 08:50:22,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 08:50:22,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:50:22,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:50:22,561 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2018-11-23 08:50:22,561 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 08:50:22,562 INFO L794 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1010#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1011#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1015#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1016#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1017#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1036#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1035#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1034#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1033#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1032#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1031#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1030#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1029#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1028#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1027#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1026#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1025#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1024#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1023#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1022#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1021#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1020#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1019#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1018#L19-3 assume !(main_~i~0 < 11); 1012#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1013#L26-2 [2018-11-23 08:50:22,562 INFO L796 eck$LassoCheckResult]: Loop: 1013#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1013#L26-2 [2018-11-23 08:50:22,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:22,562 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2018-11-23 08:50:22,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:22,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:22,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:22,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:22,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2018-11-23 08:50:22,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:22,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:22,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:22,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:22,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2018-11-23 08:50:22,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:50:22,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:50:22,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:22,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:50:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:50:28,092 WARN L180 SmtUtils]: Spent 5.42 s on a formula simplification. DAG size of input: 214 DAG size of output: 160 [2018-11-23 08:50:28,264 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-23 08:50:28,266 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:50:28,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:50:28,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:50:28,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:50:28,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 08:50:28,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:50:28,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:50:28,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:50:28,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i_Iteration13_Lasso [2018-11-23 08:50:28,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:50:28,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:50:28,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:28,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:28,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:28,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:28,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:28,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:28,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:28,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:28,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:50:28,533 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-23 08:50:28,563 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:50:28,563 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 08:50:28,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:28,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:28,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:28,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:28,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:28,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:28,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:28,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:28,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:28,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:28,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:28,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:50:28,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:28,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:28,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:28,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:50:28,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:50:28,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:28,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:28,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:28,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:28,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:28,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:28,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:50:28,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:50:28,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:28,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:28,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:28,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:28,572 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:50:28,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:28,583 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 08:50:28,583 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 08:50:28,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:50:28,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:50:28,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:50:28,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:50:28,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:50:28,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:50:28,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:50:28,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:50:28,611 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 08:50:28,615 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 08:50:28,615 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 08:50:28,616 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 08:50:28,616 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 08:50:28,618 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 08:50:28,618 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, ULTIMATE.start_main_~idx_in~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2) = -1*ULTIMATE.start_main_~#in~0.offset - 1*ULTIMATE.start_main_~idx_in~0 + 1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 Supporting invariants [] [2018-11-23 08:50:28,626 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 08:50:28,627 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 08:50:28,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:28,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:28,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:50:28,689 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 08:50:28,690 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 2 states. [2018-11-23 08:50:28,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand 2 states. Result 28 states and 29 transitions. Complement of second has 2 states. [2018-11-23 08:50:28,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 08:50:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 08:50:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2018-11-23 08:50:28,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2018-11-23 08:50:28,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:50:28,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2018-11-23 08:50:28,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:50:28,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2018-11-23 08:50:28,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:50:28,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-11-23 08:50:28,699 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 08:50:28,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-23 08:50:28,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 08:50:28,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 08:50:28,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 08:50:28,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:50:28,699 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:50:28,699 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:50:28,699 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:50:28,699 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 08:50:28,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 08:50:28,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 08:50:28,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 08:50:28,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 08:50:28 BoogieIcfgContainer [2018-11-23 08:50:28,705 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 08:50:28,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:50:28,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:50:28,706 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:50:28,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:19" (3/4) ... [2018-11-23 08:50:28,710 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 08:50:28,710 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:50:28,710 INFO L168 Benchmark]: Toolchain (without parser) took 9494.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 959.1 MB in the beginning and 811.0 MB in the end (delta: 148.1 MB). Peak memory consumption was 366.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:50:28,711 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:50:28,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.26 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:50:28,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.81 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:50:28,712 INFO L168 Benchmark]: Boogie Preprocessor took 53.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:50:28,713 INFO L168 Benchmark]: RCFGBuilder took 197.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:50:28,713 INFO L168 Benchmark]: BuchiAutomizer took 9054.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 811.0 MB in the end (delta: 313.2 MB). Peak memory consumption was 387.6 MB. Max. memory is 11.5 GB. [2018-11-23 08:50:28,714 INFO L168 Benchmark]: Witness Printer took 3.89 ms. Allocated memory is still 1.2 GB. Free memory is still 811.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:50:28,719 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.26 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.81 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 197.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9054.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 811.0 MB in the end (delta: 313.2 MB). Peak memory consumption was 387.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.89 ms. Allocated memory is still 1.2 GB. Free memory is still 811.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 21 * unknown-#length-unknown[in] and consists of 5 locations. One deterministic module has affine ranking function -1 * in + -1 * idx_in + unknown-#length-unknown[in] and consists of 2 locations. 11 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.0s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 8.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 52 SDtfs, 73 SDslu, 57 SDs, 0 SdLazy, 299 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital148 mio100 ax100 hnf100 lsp94 ukn54 mio100 lsp61 div158 bol100 ite103 ukn100 eq156 hnf73 smp97 dnf130 smp98 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 3 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...