./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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 889a23428ce9b0e3800ffce916f37e53fe302b49 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:45:50,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:45:50,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:45:50,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:45:50,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:45:50,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:45:50,112 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:45:50,114 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:45:50,115 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:45:50,115 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:45:50,116 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:45:50,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:45:50,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:45:50,117 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:45:50,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:45:50,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:45:50,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:45:50,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:45:50,122 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:45:50,123 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:45:50,123 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:45:50,124 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:45:50,126 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:45:50,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:45:50,126 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:45:50,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:45:50,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:45:50,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:45:50,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:45:50,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:45:50,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:45:50,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:45:50,130 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:45:50,130 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:45:50,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:45:50,131 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:45:50,132 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:45:50,143 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:45:50,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:45:50,144 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:45:50,144 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:45:50,144 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:45:50,144 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:45:50,144 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:45:50,144 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:45:50,145 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:45:50,145 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:45:50,145 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:45:50,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:45:50,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:45:50,145 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:45:50,145 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:45:50,145 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:45:50,146 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:45:50,146 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:45:50,146 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:45:50,146 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:45:50,146 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:45:50,146 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:45:50,146 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:45:50,146 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:45:50,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:45:50,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:45:50,147 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:45:50,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:45:50,147 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:45:50,147 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:45:50,147 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:45:50,148 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_f320e383-64f8-4263-b771-8c24755bdcd2/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 -> 889a23428ce9b0e3800ffce916f37e53fe302b49 [2018-11-10 07:45:50,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:45:50,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:45:50,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:45:50,182 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:45:50,182 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:45:50,183 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 07:45:50,228 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/data/c6b566579/1dfbafd8307447df9a51d15d0f0b7e94/FLAG81f7ffe5a [2018-11-10 07:45:50,536 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:45:50,537 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 07:45:50,542 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/data/c6b566579/1dfbafd8307447df9a51d15d0f0b7e94/FLAG81f7ffe5a [2018-11-10 07:45:50,552 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/data/c6b566579/1dfbafd8307447df9a51d15d0f0b7e94 [2018-11-10 07:45:50,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:45:50,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:45:50,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:45:50,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:45:50,559 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:45:50,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784dcdd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50, skipping insertion in model container [2018-11-10 07:45:50,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:45:50,585 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:45:50,708 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:45:50,711 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:45:50,734 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:45:50,745 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:45:50,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50 WrapperNode [2018-11-10 07:45:50,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:45:50,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:45:50,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:45:50,747 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:45:50,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:45:50,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:45:50,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:45:50,775 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:45:50,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (1/1) ... [2018-11-10 07:45:50,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:45:50,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:45:50,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:45:50,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:45:50,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:45:50,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:45:50,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:45:51,049 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:45:51,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:45:51 BoogieIcfgContainer [2018-11-10 07:45:51,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:45:51,050 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:45:51,050 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:45:51,053 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:45:51,053 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:45:51,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:45:50" (1/3) ... [2018-11-10 07:45:51,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@715ebf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:45:51, skipping insertion in model container [2018-11-10 07:45:51,054 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:45:51,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:45:50" (2/3) ... [2018-11-10 07:45:51,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@715ebf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:45:51, skipping insertion in model container [2018-11-10 07:45:51,054 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:45:51,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:45:51" (3/3) ... [2018-11-10 07:45:51,056 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 07:45:51,095 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:45:51,096 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:45:51,096 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:45:51,096 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:45:51,096 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:45:51,096 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:45:51,096 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:45:51,096 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:45:51,096 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:45:51,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 07:45:51,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 07:45:51,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:51,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:51,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:45:51,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:51,126 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:45:51,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 07:45:51,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 07:45:51,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:51,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:51,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:45:51,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:51,134 INFO L793 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10#L40true assume !(mp_add_~a3~0 % 256 == 0); 8#L40-1true mp_add_~nb~0 := 4; 31#L50true assume !(mp_add_~b3~0 % 256 == 0); 28#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23#L61-3true [2018-11-10 07:45:51,134 INFO L795 eck$LassoCheckResult]: Loop: 23#L61-3true assume true; 29#L61-1true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39#L64true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35#L64-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 26#L70true assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14#L76-1true assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 3#L80-1true assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 24#L81-1true assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 7#L82-1true assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 33#L83-1true mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 23#L61-3true [2018-11-10 07:45:51,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:51,138 INFO L82 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2018-11-10 07:45:51,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:51,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:51,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:51,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:51,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:51,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash -486457291, now seen corresponding path program 1 times [2018-11-10 07:45:51,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:51,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:51,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:51,286 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-10 07:45:51,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:45:51,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:45:51,290 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:45:51,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:45:51,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:45:51,301 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-11-10 07:45:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:45:51,440 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2018-11-10 07:45:51,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:45:51,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2018-11-10 07:45:51,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2018-11-10 07:45:51,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 90 transitions. [2018-11-10 07:45:51,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 07:45:51,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-10 07:45:51,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 90 transitions. [2018-11-10 07:45:51,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:51,449 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-11-10 07:45:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 90 transitions. [2018-11-10 07:45:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-10 07:45:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 07:45:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2018-11-10 07:45:51,475 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-10 07:45:51,475 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-10 07:45:51,475 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:45:51,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 88 transitions. [2018-11-10 07:45:51,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 07:45:51,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:51,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:51,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:51,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:51,477 INFO L793 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 131#L40 assume !(mp_add_~a3~0 % 256 == 0); 128#L40-1 mp_add_~nb~0 := 4; 129#L50 assume !(mp_add_~b3~0 % 256 == 0); 140#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 147#L61-3 assume true; 148#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 151#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 145#L64-1 [2018-11-10 07:45:51,478 INFO L795 eck$LassoCheckResult]: Loop: 145#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 134#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 138#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 120#L80-1 assume !(mp_add_~i~0 % 256 == 1); 121#L81-1 assume !(mp_add_~i~0 % 256 == 2); 126#L82-1 assume !(mp_add_~i~0 % 256 == 3); 127#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 153#L61-3 assume true; 170#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 167#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 168#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 136#L65-2 assume !(mp_add_~i~0 % 256 == 1); 137#L66-1 assume !(mp_add_~i~0 % 256 == 2); 144#L67-1 assume !(mp_add_~i~0 % 256 == 3); 145#L64-1 [2018-11-10 07:45:51,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash -685617854, now seen corresponding path program 1 times [2018-11-10 07:45:51,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:51,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:51,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:51,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:51,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:51,571 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-10 07:45:51,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:45:51,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:45:51,572 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:45:51,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 1 times [2018-11-10 07:45:51,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:51,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:51,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:51,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:51,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:51,644 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-10 07:45:51,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:45:51,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:45:51,645 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:45:51,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:45:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:45:51,646 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. cyclomatic complexity: 32 Second operand 5 states. [2018-11-10 07:45:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:45:51,883 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2018-11-10 07:45:51,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:45:51,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 226 transitions. [2018-11-10 07:45:51,886 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 82 [2018-11-10 07:45:51,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 226 transitions. [2018-11-10 07:45:51,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2018-11-10 07:45:51,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2018-11-10 07:45:51,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 226 transitions. [2018-11-10 07:45:51,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:51,888 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 226 transitions. [2018-11-10 07:45:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 226 transitions. [2018-11-10 07:45:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2018-11-10 07:45:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-10 07:45:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2018-11-10 07:45:51,892 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-10 07:45:51,892 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-10 07:45:51,893 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:45:51,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 119 transitions. [2018-11-10 07:45:51,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 07:45:51,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:51,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:51,894 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:51,894 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:51,894 INFO L793 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 358#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 359#L42 assume !(mp_add_~a2~0 % 256 == 0); 385#L40-1 mp_add_~nb~0 := 4; 382#L50 assume !(mp_add_~b3~0 % 256 == 0); 365#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 400#L61-3 assume true; 398#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 399#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 384#L64-1 [2018-11-10 07:45:51,894 INFO L795 eck$LassoCheckResult]: Loop: 384#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 357#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 363#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 344#L80-1 assume !(mp_add_~i~0 % 256 == 1); 345#L81-1 assume !(mp_add_~i~0 % 256 == 2); 350#L82-1 assume !(mp_add_~i~0 % 256 == 3); 351#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 374#L61-3 assume true; 375#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 395#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 387#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 367#L65-2 assume !(mp_add_~i~0 % 256 == 1); 390#L66-1 assume !(mp_add_~i~0 % 256 == 2); 391#L67-1 assume !(mp_add_~i~0 % 256 == 3); 384#L64-1 [2018-11-10 07:45:51,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash 959922624, now seen corresponding path program 1 times [2018-11-10 07:45:51,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:51,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:51,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:51,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:51,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:52,010 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-10 07:45:52,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:45:52,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:45:52,011 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:45:52,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 2 times [2018-11-10 07:45:52,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:52,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:52,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:52,067 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-10 07:45:52,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:45:52,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:45:52,067 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:45:52,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:45:52,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:45:52,068 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. cyclomatic complexity: 37 Second operand 6 states. [2018-11-10 07:45:52,416 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-10 07:45:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:45:54,211 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2018-11-10 07:45:54,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:45:54,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 344 transitions. [2018-11-10 07:45:54,215 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 176 [2018-11-10 07:45:54,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 344 transitions. [2018-11-10 07:45:54,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2018-11-10 07:45:54,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2018-11-10 07:45:54,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 344 transitions. [2018-11-10 07:45:54,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:54,219 INFO L705 BuchiCegarLoop]: Abstraction has 230 states and 344 transitions. [2018-11-10 07:45:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 344 transitions. [2018-11-10 07:45:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 155. [2018-11-10 07:45:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-10 07:45:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2018-11-10 07:45:54,229 INFO L728 BuchiCegarLoop]: Abstraction has 155 states and 225 transitions. [2018-11-10 07:45:54,229 INFO L608 BuchiCegarLoop]: Abstraction has 155 states and 225 transitions. [2018-11-10 07:45:54,230 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:45:54,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 225 transitions. [2018-11-10 07:45:54,231 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 103 [2018-11-10 07:45:54,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:54,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:54,232 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:54,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:54,233 INFO L793 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 693#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 688#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 690#L42 assume !(mp_add_~a2~0 % 256 == 0); 715#L40-1 mp_add_~nb~0 := 4; 794#L50 assume !(mp_add_~b3~0 % 256 == 0); 791#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 790#L61-3 assume true; 789#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 788#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 787#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 772#L65-2 [2018-11-10 07:45:54,233 INFO L795 eck$LassoCheckResult]: Loop: 772#L65-2 assume !(mp_add_~i~0 % 256 == 1); 786#L66-1 assume !(mp_add_~i~0 % 256 == 2); 785#L67-1 assume !(mp_add_~i~0 % 256 == 3); 782#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 780#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 779#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 753#L80-1 assume !(mp_add_~i~0 % 256 == 1); 778#L81-1 assume !(mp_add_~i~0 % 256 == 2); 777#L82-1 assume !(mp_add_~i~0 % 256 == 3); 776#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 775#L61-3 assume true; 774#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 773#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 764#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 772#L65-2 [2018-11-10 07:45:54,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 1 times [2018-11-10 07:45:54,233 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:54,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:54,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:54,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:45:54,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:54,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1892987967, now seen corresponding path program 3 times [2018-11-10 07:45:54,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:54,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:54,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:54,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:54,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:54,336 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-10 07:45:54,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:45:54,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:45:54,336 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:45:54,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:45:54,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:45:54,336 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. cyclomatic complexity: 74 Second operand 5 states. [2018-11-10 07:45:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:45:54,478 INFO L93 Difference]: Finished difference Result 261 states and 372 transitions. [2018-11-10 07:45:54,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:45:54,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 372 transitions. [2018-11-10 07:45:54,480 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 209 [2018-11-10 07:45:54,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 261 states and 372 transitions. [2018-11-10 07:45:54,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 261 [2018-11-10 07:45:54,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 261 [2018-11-10 07:45:54,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 261 states and 372 transitions. [2018-11-10 07:45:54,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:54,484 INFO L705 BuchiCegarLoop]: Abstraction has 261 states and 372 transitions. [2018-11-10 07:45:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states and 372 transitions. [2018-11-10 07:45:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 246. [2018-11-10 07:45:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-10 07:45:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 348 transitions. [2018-11-10 07:45:54,495 INFO L728 BuchiCegarLoop]: Abstraction has 246 states and 348 transitions. [2018-11-10 07:45:54,495 INFO L608 BuchiCegarLoop]: Abstraction has 246 states and 348 transitions. [2018-11-10 07:45:54,495 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:45:54,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 348 transitions. [2018-11-10 07:45:54,497 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 194 [2018-11-10 07:45:54,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:54,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:54,498 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:54,498 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:54,498 INFO L793 eck$LassoCheckResult]: Stem: 1144#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1112#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1114#L42 assume !(mp_add_~a2~0 % 256 == 0); 1108#L40-1 mp_add_~nb~0 := 4; 1109#L50 assume !(mp_add_~b3~0 % 256 == 0); 1136#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1137#L61-3 assume true; 1332#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1328#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1327#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1326#L65-2 [2018-11-10 07:45:54,498 INFO L795 eck$LassoCheckResult]: Loop: 1326#L65-2 assume !(mp_add_~i~0 % 256 == 1); 1324#L66-1 assume !(mp_add_~i~0 % 256 == 2); 1321#L67-1 assume !(mp_add_~i~0 % 256 == 3); 1317#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1313#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1118#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 1119#L80-1 assume !(mp_add_~i~0 % 256 == 1); 1339#L81-1 assume !(mp_add_~i~0 % 256 == 2); 1104#L82-1 assume !(mp_add_~i~0 % 256 == 3); 1105#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1129#L61-3 assume true; 1130#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1138#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1122#L65 assume !(mp_add_~i~0 % 256 == 0); 1115#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 1116#L66-1 assume !(mp_add_~i~0 % 256 == 2); 1125#L67-1 assume !(mp_add_~i~0 % 256 == 3); 1126#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1340#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1342#L76-1 assume !(mp_add_~i~0 % 256 == 0); 1297#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 1296#L81-1 assume !(mp_add_~i~0 % 256 == 2); 1295#L82-1 assume !(mp_add_~i~0 % 256 == 3); 1249#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1250#L61-3 assume true; 1149#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1150#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1330#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1134#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1135#L76-1 assume !(mp_add_~i~0 % 256 == 0); 1292#L80-1 assume !(mp_add_~i~0 % 256 == 1); 1283#L81-1 assume !(mp_add_~i~0 % 256 == 2); 1281#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 1282#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1152#L61-3 assume true; 1153#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1293#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1305#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1326#L65-2 [2018-11-10 07:45:54,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 2 times [2018-11-10 07:45:54,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:54,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:54,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:54,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:45:54,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:54,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:54,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1256298437, now seen corresponding path program 1 times [2018-11-10 07:45:54,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:54,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:54,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:54,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:45:54,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 07:45:54,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:45:54,710 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:45:54,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:54,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:45:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 07:45:54,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:45:54,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-11-10 07:45:54,836 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:45:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:45:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:45:54,837 INFO L87 Difference]: Start difference. First operand 246 states and 348 transitions. cyclomatic complexity: 106 Second operand 9 states. [2018-11-10 07:45:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:45:55,167 INFO L93 Difference]: Finished difference Result 372 states and 475 transitions. [2018-11-10 07:45:55,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:45:55,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 475 transitions. [2018-11-10 07:45:55,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 288 [2018-11-10 07:45:55,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 372 states and 475 transitions. [2018-11-10 07:45:55,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2018-11-10 07:45:55,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2018-11-10 07:45:55,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 475 transitions. [2018-11-10 07:45:55,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:55,171 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 475 transitions. [2018-11-10 07:45:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 475 transitions. [2018-11-10 07:45:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 243. [2018-11-10 07:45:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-10 07:45:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 324 transitions. [2018-11-10 07:45:55,179 INFO L728 BuchiCegarLoop]: Abstraction has 243 states and 324 transitions. [2018-11-10 07:45:55,179 INFO L608 BuchiCegarLoop]: Abstraction has 243 states and 324 transitions. [2018-11-10 07:45:55,179 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:45:55,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 324 transitions. [2018-11-10 07:45:55,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 191 [2018-11-10 07:45:55,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:55,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:55,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:55,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:55,181 INFO L793 eck$LassoCheckResult]: Stem: 1885#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1858#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1860#L42 assume !(mp_add_~a2~0 % 256 == 0); 1854#L40-1 mp_add_~nb~0 := 4; 1855#L50 assume !(mp_add_~b3~0 % 256 == 0); 1867#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2047#L61-3 assume true; 2046#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2045#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2044#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1998#L65-2 [2018-11-10 07:45:55,182 INFO L795 eck$LassoCheckResult]: Loop: 1998#L65-2 assume !(mp_add_~i~0 % 256 == 1); 2043#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2042#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2039#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2037#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2036#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 1974#L80-1 assume !(mp_add_~i~0 % 256 == 1); 2035#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2034#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2033#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2032#L61-3 assume true; 2031#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2030#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2029#L65 assume !(mp_add_~i~0 % 256 == 0); 2028#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 1997#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2026#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2024#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2022#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2021#L76-1 assume !(mp_add_~i~0 % 256 == 0); 2019#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 1972#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2017#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2015#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2012#L61-3 assume true; 1889#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1884#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1872#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1857#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1864#L76-1 assume !(mp_add_~i~0 % 256 == 0); 1865#L80-1 assume !(mp_add_~i~0 % 256 == 1); 1985#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 1969#L82-1 assume !(mp_add_~i~0 % 256 == 3); 1918#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1919#L61-3 assume true; 1906#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1908#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1981#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1998#L65-2 [2018-11-10 07:45:55,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:55,182 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 3 times [2018-11-10 07:45:55,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:55,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:55,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:55,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:55,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1320919799, now seen corresponding path program 1 times [2018-11-10 07:45:55,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:55,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:45:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 07:45:55,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:45:55,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:45:55,240 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:45:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:45:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:45:55,240 INFO L87 Difference]: Start difference. First operand 243 states and 324 transitions. cyclomatic complexity: 85 Second operand 4 states. [2018-11-10 07:45:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:45:55,285 INFO L93 Difference]: Finished difference Result 457 states and 602 transitions. [2018-11-10 07:45:55,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:45:55,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 457 states and 602 transitions. [2018-11-10 07:45:55,288 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 397 [2018-11-10 07:45:55,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 457 states to 457 states and 602 transitions. [2018-11-10 07:45:55,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 457 [2018-11-10 07:45:55,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 457 [2018-11-10 07:45:55,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 457 states and 602 transitions. [2018-11-10 07:45:55,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:55,292 INFO L705 BuchiCegarLoop]: Abstraction has 457 states and 602 transitions. [2018-11-10 07:45:55,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states and 602 transitions. [2018-11-10 07:45:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 326. [2018-11-10 07:45:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-10 07:45:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 447 transitions. [2018-11-10 07:45:55,301 INFO L728 BuchiCegarLoop]: Abstraction has 326 states and 447 transitions. [2018-11-10 07:45:55,301 INFO L608 BuchiCegarLoop]: Abstraction has 326 states and 447 transitions. [2018-11-10 07:45:55,301 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:45:55,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 447 transitions. [2018-11-10 07:45:55,303 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 274 [2018-11-10 07:45:55,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:55,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:55,304 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:55,304 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:55,304 INFO L793 eck$LassoCheckResult]: Stem: 2598#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2569#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2564#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2566#L42 assume !(mp_add_~a2~0 % 256 == 0); 2560#L40-1 mp_add_~nb~0 := 4; 2561#L50 assume !(mp_add_~b3~0 % 256 == 0); 2587#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2588#L61-3 assume true; 2589#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2590#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2599#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2613#L65-2 [2018-11-10 07:45:55,304 INFO L795 eck$LassoCheckResult]: Loop: 2613#L65-2 assume !(mp_add_~i~0 % 256 == 1); 2601#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2578#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2579#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2568#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2572#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 2552#L80-1 assume !(mp_add_~i~0 % 256 == 1); 2553#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2558#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2559#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2582#L61-3 assume true; 2583#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2757#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2575#L65 assume !(mp_add_~i~0 % 256 == 0); 2570#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 2571#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2836#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2835#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2833#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2832#L76-1 assume !(mp_add_~i~0 % 256 == 0); 2830#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 2636#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2828#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2827#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2826#L61-3 assume true; 2824#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2823#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 2822#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2817#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2818#L76-1 assume !(mp_add_~i~0 % 256 == 0); 2840#L80-1 assume !(mp_add_~i~0 % 256 == 1); 2779#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 2628#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2625#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2622#L61-3 assume true; 2623#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2615#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2616#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2613#L65-2 [2018-11-10 07:45:55,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:55,304 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 4 times [2018-11-10 07:45:55,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:55,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:55,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:55,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:55,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:55,323 INFO L82 PathProgramCache]: Analyzing trace with hash 110244339, now seen corresponding path program 1 times [2018-11-10 07:45:55,323 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:55,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:55,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:45:55,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:55,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:45:55,379 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:45:55,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:55,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:45:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:55,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:45:55,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-11-10 07:45:55,494 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:45:55,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:45:55,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:45:55,495 INFO L87 Difference]: Start difference. First operand 326 states and 447 transitions. cyclomatic complexity: 125 Second operand 7 states. [2018-11-10 07:45:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:45:55,618 INFO L93 Difference]: Finished difference Result 479 states and 631 transitions. [2018-11-10 07:45:55,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:45:55,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 479 states and 631 transitions. [2018-11-10 07:45:55,620 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 407 [2018-11-10 07:45:55,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 479 states to 479 states and 631 transitions. [2018-11-10 07:45:55,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 479 [2018-11-10 07:45:55,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 479 [2018-11-10 07:45:55,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 479 states and 631 transitions. [2018-11-10 07:45:55,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:55,622 INFO L705 BuchiCegarLoop]: Abstraction has 479 states and 631 transitions. [2018-11-10 07:45:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states and 631 transitions. [2018-11-10 07:45:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 331. [2018-11-10 07:45:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-10 07:45:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 451 transitions. [2018-11-10 07:45:55,627 INFO L728 BuchiCegarLoop]: Abstraction has 331 states and 451 transitions. [2018-11-10 07:45:55,628 INFO L608 BuchiCegarLoop]: Abstraction has 331 states and 451 transitions. [2018-11-10 07:45:55,628 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:45:55,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331 states and 451 transitions. [2018-11-10 07:45:55,629 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 278 [2018-11-10 07:45:55,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:55,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:55,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:55,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:55,630 INFO L793 eck$LassoCheckResult]: Stem: 3525#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3495#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3491#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3492#L42 assume !(mp_add_~a2~0 % 256 == 0); 3521#L40-1 mp_add_~nb~0 := 4; 3517#L50 assume !(mp_add_~b3~0 % 256 == 0); 3498#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3506#L61-3 assume true; 3507#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3523#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3524#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3493#L65-2 [2018-11-10 07:45:55,630 INFO L795 eck$LassoCheckResult]: Loop: 3493#L65-2 assume !(mp_add_~i~0 % 256 == 1); 3494#L66-1 assume !(mp_add_~i~0 % 256 == 2); 3503#L67-1 assume !(mp_add_~i~0 % 256 == 3); 3504#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3509#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3496#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 3478#L80-1 assume !(mp_add_~i~0 % 256 == 1); 3479#L81-1 assume !(mp_add_~i~0 % 256 == 2); 3484#L82-1 assume !(mp_add_~i~0 % 256 == 3); 3485#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 3701#L61-3 assume true; 3700#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3699#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3698#L65 assume !(mp_add_~i~0 % 256 == 0); 3697#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 3678#L66-1 assume !(mp_add_~i~0 % 256 == 2); 3695#L67-1 assume !(mp_add_~i~0 % 256 == 3); 3693#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3690#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3689#L76-1 assume !(mp_add_~i~0 % 256 == 0); 3688#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 3636#L81-1 assume !(mp_add_~i~0 % 256 == 2); 3687#L82-1 assume !(mp_add_~i~0 % 256 == 3); 3684#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 3682#L61-3 assume true; 3679#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3665#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 3666#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3800#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3652#L76-1 assume !(mp_add_~i~0 % 256 == 0); 3708#L80-1 assume !(mp_add_~i~0 % 256 == 1); 3703#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 3614#L82-1 assume !(mp_add_~i~0 % 256 == 3); 3558#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 3556#L61-3 assume true; 3552#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3553#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3646#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3493#L65-2 [2018-11-10 07:45:55,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 5 times [2018-11-10 07:45:55,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:55,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:55,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:55,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:55,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash 927892789, now seen corresponding path program 2 times [2018-11-10 07:45:55,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:55,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:45:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 07:45:55,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:45:55,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:45:55,683 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:45:55,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:45:55,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:45:55,684 INFO L87 Difference]: Start difference. First operand 331 states and 451 transitions. cyclomatic complexity: 124 Second operand 5 states. [2018-11-10 07:45:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:45:55,852 INFO L93 Difference]: Finished difference Result 670 states and 950 transitions. [2018-11-10 07:45:55,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:45:55,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 950 transitions. [2018-11-10 07:45:55,856 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 591 [2018-11-10 07:45:55,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 670 states and 950 transitions. [2018-11-10 07:45:55,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 670 [2018-11-10 07:45:55,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 670 [2018-11-10 07:45:55,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 670 states and 950 transitions. [2018-11-10 07:45:55,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:55,860 INFO L705 BuchiCegarLoop]: Abstraction has 670 states and 950 transitions. [2018-11-10 07:45:55,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states and 950 transitions. [2018-11-10 07:45:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 531. [2018-11-10 07:45:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-11-10 07:45:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 783 transitions. [2018-11-10 07:45:55,870 INFO L728 BuchiCegarLoop]: Abstraction has 531 states and 783 transitions. [2018-11-10 07:45:55,871 INFO L608 BuchiCegarLoop]: Abstraction has 531 states and 783 transitions. [2018-11-10 07:45:55,871 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:45:55,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 531 states and 783 transitions. [2018-11-10 07:45:55,873 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 470 [2018-11-10 07:45:55,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:55,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:55,874 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:55,874 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:55,874 INFO L793 eck$LassoCheckResult]: Stem: 4534#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4503#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 4504#L42 assume !(mp_add_~a2~0 % 256 == 0); 4530#L40-1 mp_add_~nb~0 := 4; 4816#L50 assume !(mp_add_~b3~0 % 256 == 0); 4524#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4525#L61-3 assume true; 4526#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4527#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4995#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4936#L65-2 [2018-11-10 07:45:55,874 INFO L795 eck$LassoCheckResult]: Loop: 4936#L65-2 assume !(mp_add_~i~0 % 256 == 1); 4994#L66-1 assume !(mp_add_~i~0 % 256 == 2); 4993#L67-1 assume !(mp_add_~i~0 % 256 == 3); 4990#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4988#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4967#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 4614#L80-1 assume !(mp_add_~i~0 % 256 == 1); 4966#L81-1 assume !(mp_add_~i~0 % 256 == 2); 4965#L82-1 assume !(mp_add_~i~0 % 256 == 3); 4964#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 4959#L61-3 assume true; 4960#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4532#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4533#L65 assume !(mp_add_~i~0 % 256 == 0); 4505#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 4506#L66-1 assume !(mp_add_~i~0 % 256 == 2); 4516#L67-1 assume !(mp_add_~i~0 % 256 == 3); 4517#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4502#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4997#L76-1 assume !(mp_add_~i~0 % 256 == 0); 4490#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 4491#L81-1 assume !(mp_add_~i~0 % 256 == 2); 4496#L82-1 assume !(mp_add_~i~0 % 256 == 3); 4497#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 4963#L61-3 assume true; 4957#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4958#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4962#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4961#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4944#L76-1 assume !(mp_add_~i~0 % 256 == 0); 4955#L80-1 assume !(mp_add_~i~0 % 256 == 1); 4939#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 4578#L82-1 assume !(mp_add_~i~0 % 256 == 3); 4872#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 4924#L61-3 assume true; 4923#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4922#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4921#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4919#L71 assume !(mp_add_~i~0 % 256 == 0); 4920#L71-2 assume !(mp_add_~i~0 % 256 == 1); 4909#L72-1 assume !(mp_add_~i~0 % 256 == 2); 4910#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 4885#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4907#L76-1 assume !(mp_add_~i~0 % 256 == 0); 4905#L80-1 assume !(mp_add_~i~0 % 256 == 1); 4903#L81-1 assume !(mp_add_~i~0 % 256 == 2); 4900#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 4899#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 4898#L61-3 assume true; 4896#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4892#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4887#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4883#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4879#L76-1 assume !(mp_add_~i~0 % 256 == 0); 4877#L80-1 assume !(mp_add_~i~0 % 256 == 1); 4875#L81-1 assume !(mp_add_~i~0 % 256 == 2); 4873#L82-1 assume !(mp_add_~i~0 % 256 == 3); 4562#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 4563#L61-3 assume true; 4556#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4557#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4640#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4936#L65-2 [2018-11-10 07:45:55,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 6 times [2018-11-10 07:45:55,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:55,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:55,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:45:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:55,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash -625713779, now seen corresponding path program 1 times [2018-11-10 07:45:55,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:55,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:45:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 82 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:45:55,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:45:55,953 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:45:55,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:55,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:45:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 07:45:56,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:45:56,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-10 07:45:56,053 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:45:56,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:45:56,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:45:56,053 INFO L87 Difference]: Start difference. First operand 531 states and 783 transitions. cyclomatic complexity: 256 Second operand 8 states. [2018-11-10 07:45:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:45:56,558 INFO L93 Difference]: Finished difference Result 1479 states and 2081 transitions. [2018-11-10 07:45:56,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:45:56,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1479 states and 2081 transitions. [2018-11-10 07:45:56,566 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1342 [2018-11-10 07:45:56,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1479 states to 1445 states and 2047 transitions. [2018-11-10 07:45:56,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1445 [2018-11-10 07:45:56,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1445 [2018-11-10 07:45:56,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1445 states and 2047 transitions. [2018-11-10 07:45:56,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:56,577 INFO L705 BuchiCegarLoop]: Abstraction has 1445 states and 2047 transitions. [2018-11-10 07:45:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states and 2047 transitions. [2018-11-10 07:45:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1346. [2018-11-10 07:45:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2018-11-10 07:45:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1929 transitions. [2018-11-10 07:45:56,600 INFO L728 BuchiCegarLoop]: Abstraction has 1346 states and 1929 transitions. [2018-11-10 07:45:56,600 INFO L608 BuchiCegarLoop]: Abstraction has 1346 states and 1929 transitions. [2018-11-10 07:45:56,600 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:45:56,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1346 states and 1929 transitions. [2018-11-10 07:45:56,605 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1278 [2018-11-10 07:45:56,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:56,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:56,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:56,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:56,606 INFO L793 eck$LassoCheckResult]: Stem: 6751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6726#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6722#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 6723#L42 assume !(mp_add_~a2~0 % 256 == 0); 6748#L40-1 mp_add_~nb~0 := 4; 6744#L50 assume !(mp_add_~b3~0 % 256 == 0); 6729#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 7143#L61-3 assume true; 7141#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7140#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7094#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7066#L65-2 [2018-11-10 07:45:56,606 INFO L795 eck$LassoCheckResult]: Loop: 7066#L65-2 assume !(mp_add_~i~0 % 256 == 1); 7091#L66-1 assume !(mp_add_~i~0 % 256 == 2); 7087#L67-1 assume !(mp_add_~i~0 % 256 == 3); 7088#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7070#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6841#L71-2 assume !(mp_add_~i~0 % 256 == 1); 7069#L72-1 assume !(mp_add_~i~0 % 256 == 2); 7057#L73-1 assume !(mp_add_~i~0 % 256 == 3); 7056#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7052#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 6870#L80-1 assume !(mp_add_~i~0 % 256 == 1); 7051#L81-1 assume !(mp_add_~i~0 % 256 == 2); 7050#L82-1 assume !(mp_add_~i~0 % 256 == 3); 7049#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 7048#L61-3 assume true; 7047#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7046#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7045#L65 assume !(mp_add_~i~0 % 256 == 0); 7044#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 6953#L66-1 assume !(mp_add_~i~0 % 256 == 2); 7043#L67-1 assume !(mp_add_~i~0 % 256 == 3); 7041#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7040#L71 assume !(mp_add_~i~0 % 256 == 0); 7039#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 6838#L72-1 assume !(mp_add_~i~0 % 256 == 2); 7038#L73-1 assume !(mp_add_~i~0 % 256 == 3); 7037#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7035#L76-1 assume !(mp_add_~i~0 % 256 == 0); 7033#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 6868#L81-1 assume !(mp_add_~i~0 % 256 == 2); 7031#L82-1 assume !(mp_add_~i~0 % 256 == 3); 7029#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 7027#L61-3 assume true; 7024#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7019#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7020#L65 assume !(mp_add_~i~0 % 256 == 0); 7023#L65-2 assume !(mp_add_~i~0 % 256 == 1); 7022#L66-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 7017#L67-1 assume !(mp_add_~i~0 % 256 == 3); 7018#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 7158#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7157#L76-1 assume !(mp_add_~i~0 % 256 == 0); 7155#L80-1 assume !(mp_add_~i~0 % 256 == 1); 7151#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 7083#L82-1 assume !(mp_add_~i~0 % 256 == 3); 7150#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 7149#L61-3 assume true; 7146#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7144#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7142#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6998#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7136#L76-1 assume !(mp_add_~i~0 % 256 == 0); 7134#L80-1 assume !(mp_add_~i~0 % 256 == 1); 7133#L81-1 assume !(mp_add_~i~0 % 256 == 2); 7131#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 7130#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 7129#L61-3 assume true; 7128#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7127#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7126#L65 assume !(mp_add_~i~0 % 256 == 0); 7120#L65-2 assume !(mp_add_~i~0 % 256 == 1); 7116#L66-1 assume !(mp_add_~i~0 % 256 == 2); 7114#L67-1 assume !(mp_add_~i~0 % 256 == 3); 7110#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6902#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7086#L76-1 assume !(mp_add_~i~0 % 256 == 0); 7084#L80-1 assume !(mp_add_~i~0 % 256 == 1); 7082#L81-1 assume !(mp_add_~i~0 % 256 == 2); 7081#L82-1 assume !(mp_add_~i~0 % 256 == 3); 7080#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 7079#L61-3 assume true; 7078#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7076#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7077#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7066#L65-2 [2018-11-10 07:45:56,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 7 times [2018-11-10 07:45:56,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:56,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:56,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:56,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:56,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1313734941, now seen corresponding path program 1 times [2018-11-10 07:45:56,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:56,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:56,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 83 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 07:45:56,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:45:56,691 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:45:56,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:56,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:45:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 110 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 07:45:56,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:45:56,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2018-11-10 07:45:56,983 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:45:56,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:45:56,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:45:56,984 INFO L87 Difference]: Start difference. First operand 1346 states and 1929 transitions. cyclomatic complexity: 591 Second operand 10 states. [2018-11-10 07:45:57,815 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-10 07:45:58,271 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-11-10 07:45:58,648 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-11-10 07:46:03,083 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-10 07:46:21,842 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-11-10 07:46:23,960 WARN L179 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-10 07:46:25,553 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 07:46:29,606 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-10 07:46:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:46:42,593 INFO L93 Difference]: Finished difference Result 3885 states and 5127 transitions. [2018-11-10 07:46:42,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-10 07:46:42,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3885 states and 5127 transitions. [2018-11-10 07:46:42,609 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 3330 [2018-11-10 07:46:42,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3885 states to 3819 states and 5056 transitions. [2018-11-10 07:46:42,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3819 [2018-11-10 07:46:42,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3819 [2018-11-10 07:46:42,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3819 states and 5056 transitions. [2018-11-10 07:46:42,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:46:42,632 INFO L705 BuchiCegarLoop]: Abstraction has 3819 states and 5056 transitions. [2018-11-10 07:46:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3819 states and 5056 transitions. [2018-11-10 07:46:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3819 to 2184. [2018-11-10 07:46:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2018-11-10 07:46:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2941 transitions. [2018-11-10 07:46:42,677 INFO L728 BuchiCegarLoop]: Abstraction has 2184 states and 2941 transitions. [2018-11-10 07:46:42,677 INFO L608 BuchiCegarLoop]: Abstraction has 2184 states and 2941 transitions. [2018-11-10 07:46:42,677 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 07:46:42,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2184 states and 2941 transitions. [2018-11-10 07:46:42,686 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1974 [2018-11-10 07:46:42,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:46:42,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:46:42,687 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:46:42,687 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:46:42,687 INFO L793 eck$LassoCheckResult]: Stem: 12350#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12319#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 12315#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 12316#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 12349#L44 assume !(mp_add_~a1~0 % 256 == 0); 12353#L40-1 mp_add_~nb~0 := 4; 12407#L50 assume !(mp_add_~b3~0 % 256 == 0); 12408#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 13484#L61-3 assume true; 13795#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13796#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 13258#L64-1 [2018-11-10 07:46:42,687 INFO L795 eck$LassoCheckResult]: Loop: 13258#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 13869#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 13564#L71-2 assume !(mp_add_~i~0 % 256 == 1); 14327#L72-1 assume !(mp_add_~i~0 % 256 == 2); 14328#L73-1 assume !(mp_add_~i~0 % 256 == 3); 14322#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14323#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 14318#L80-1 assume !(mp_add_~i~0 % 256 == 1); 14319#L81-1 assume !(mp_add_~i~0 % 256 == 2); 14307#L82-1 assume !(mp_add_~i~0 % 256 == 3); 14304#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 14300#L61-3 assume true; 14301#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14349#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 14406#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14186#L71 assume !(mp_add_~i~0 % 256 == 0); 14154#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 13562#L72-1 assume !(mp_add_~i~0 % 256 == 2); 14152#L73-1 assume !(mp_add_~i~0 % 256 == 3); 14149#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14147#L76-1 assume !(mp_add_~i~0 % 256 == 0); 14128#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 13576#L81-1 assume !(mp_add_~i~0 % 256 == 2); 14127#L82-1 assume !(mp_add_~i~0 % 256 == 3); 14126#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 14125#L61-3 assume true; 14123#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14124#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 14185#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14184#L71 assume !(mp_add_~i~0 % 256 == 0); 14183#L71-2 assume !(mp_add_~i~0 % 256 == 1); 14090#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 14088#L73-1 assume !(mp_add_~i~0 % 256 == 3); 14084#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 14082#L76-1 assume !(mp_add_~i~0 % 256 == 0); 14078#L80-1 assume !(mp_add_~i~0 % 256 == 1); 14070#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 13593#L82-1 assume !(mp_add_~i~0 % 256 == 3); 13636#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 13827#L61-3 assume true; 13811#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13812#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 13777#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 13774#L71 assume !(mp_add_~i~0 % 256 == 0); 13772#L71-2 assume !(mp_add_~i~0 % 256 == 1); 13770#L72-1 assume !(mp_add_~i~0 % 256 == 2); 13631#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 13604#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 13629#L76-1 assume !(mp_add_~i~0 % 256 == 0); 13628#L80-1 assume !(mp_add_~i~0 % 256 == 1); 13627#L81-1 assume !(mp_add_~i~0 % 256 == 2); 13625#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 13624#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 13623#L61-3 assume true; 13622#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13619#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 13615#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 13616#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 13809#L76-1 assume !(mp_add_~i~0 % 256 == 0); 13807#L80-1 assume !(mp_add_~i~0 % 256 == 1); 13805#L81-1 assume !(mp_add_~i~0 % 256 == 2); 13803#L82-1 assume !(mp_add_~i~0 % 256 == 3); 13802#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 13797#L61-3 assume true; 13798#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13256#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 13258#L64-1 [2018-11-10 07:46:42,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:46:42,688 INFO L82 PathProgramCache]: Analyzing trace with hash -363513735, now seen corresponding path program 1 times [2018-11-10 07:46:42,688 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:46:42,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:46:42,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:42,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:46:42,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:42,761 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-10 07:46:42,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:46:42,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:46:42,761 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:46:42,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:46:42,762 INFO L82 PathProgramCache]: Analyzing trace with hash 992049913, now seen corresponding path program 1 times [2018-11-10 07:46:42,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:46:42,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:46:42,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:42,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:46:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-10 07:46:42,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:46:42,899 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:46:42,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:46:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:42,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:46:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 96 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 07:46:54,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:46:54,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-11-10 07:46:54,815 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:46:54,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:46:54,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:46:54,815 INFO L87 Difference]: Start difference. First operand 2184 states and 2941 transitions. cyclomatic complexity: 771 Second operand 8 states. [2018-11-10 07:46:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:46:55,743 INFO L93 Difference]: Finished difference Result 4991 states and 6615 transitions. [2018-11-10 07:46:55,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 07:46:55,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4991 states and 6615 transitions. [2018-11-10 07:46:55,759 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 4364 [2018-11-10 07:46:55,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4991 states to 4952 states and 6566 transitions. [2018-11-10 07:46:55,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4952 [2018-11-10 07:46:55,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4952 [2018-11-10 07:46:55,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4952 states and 6566 transitions. [2018-11-10 07:46:55,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:46:55,786 INFO L705 BuchiCegarLoop]: Abstraction has 4952 states and 6566 transitions. [2018-11-10 07:46:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4952 states and 6566 transitions. [2018-11-10 07:46:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4952 to 3120. [2018-11-10 07:46:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2018-11-10 07:46:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 4183 transitions. [2018-11-10 07:46:55,844 INFO L728 BuchiCegarLoop]: Abstraction has 3120 states and 4183 transitions. [2018-11-10 07:46:55,844 INFO L608 BuchiCegarLoop]: Abstraction has 3120 states and 4183 transitions. [2018-11-10 07:46:55,844 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 07:46:55,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3120 states and 4183 transitions. [2018-11-10 07:46:55,853 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 2761 [2018-11-10 07:46:55,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:46:55,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:46:55,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:46:55,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:46:55,854 INFO L793 eck$LassoCheckResult]: Stem: 19756#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 19722#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 19718#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 19719#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 19754#L44 assume mp_add_~a1~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 19759#L40-1 mp_add_~nb~0 := 4; 19801#L50 assume !(mp_add_~b3~0 % 256 == 0); 19802#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 21142#L61-3 assume true; 21159#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 21158#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21115#L64-1 [2018-11-10 07:46:55,854 INFO L795 eck$LassoCheckResult]: Loop: 21115#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21174#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 21064#L71-2 assume !(mp_add_~i~0 % 256 == 1); 22235#L72-1 assume !(mp_add_~i~0 % 256 == 2); 22234#L73-1 assume !(mp_add_~i~0 % 256 == 3); 22233#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22231#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 22229#L80-1 assume !(mp_add_~i~0 % 256 == 1); 22227#L81-1 assume !(mp_add_~i~0 % 256 == 2); 22225#L82-1 assume !(mp_add_~i~0 % 256 == 3); 22223#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 22221#L61-3 assume true; 22218#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22158#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22159#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22152#L71 assume !(mp_add_~i~0 % 256 == 0); 22150#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 20893#L72-1 assume !(mp_add_~i~0 % 256 == 2); 22149#L73-1 assume !(mp_add_~i~0 % 256 == 3); 22144#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22145#L76-1 assume !(mp_add_~i~0 % 256 == 0); 22217#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 19819#L81-1 assume !(mp_add_~i~0 % 256 == 2); 22216#L82-1 assume !(mp_add_~i~0 % 256 == 3); 22215#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 22214#L61-3 assume true; 22213#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22212#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22061#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22060#L71 assume !(mp_add_~i~0 % 256 == 0); 22057#L71-2 assume !(mp_add_~i~0 % 256 == 1); 22056#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 22054#L73-1 assume !(mp_add_~i~0 % 256 == 3); 22052#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22048#L76-1 assume !(mp_add_~i~0 % 256 == 0); 22047#L80-1 assume !(mp_add_~i~0 % 256 == 1); 22044#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 22043#L82-1 assume !(mp_add_~i~0 % 256 == 3); 22042#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 22040#L61-3 assume true; 22037#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22036#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21981#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22033#L71 assume !(mp_add_~i~0 % 256 == 0); 22030#L71-2 assume !(mp_add_~i~0 % 256 == 1); 22028#L72-1 assume !(mp_add_~i~0 % 256 == 2); 21265#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 21046#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 21263#L76-1 assume !(mp_add_~i~0 % 256 == 0); 21482#L80-1 assume !(mp_add_~i~0 % 256 == 1); 21480#L81-1 assume !(mp_add_~i~0 % 256 == 2); 21478#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 21477#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21476#L61-3 assume true; 21382#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 21383#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21977#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22041#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 20880#L76-1 assume !(mp_add_~i~0 % 256 == 0); 20881#L80-1 assume !(mp_add_~i~0 % 256 == 1); 20875#L81-1 assume !(mp_add_~i~0 % 256 == 2); 20877#L82-1 assume !(mp_add_~i~0 % 256 == 3); 21164#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 22205#L61-3 assume true; 22204#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22203#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21115#L64-1 [2018-11-10 07:46:55,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:46:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2138521097, now seen corresponding path program 1 times [2018-11-10 07:46:55,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:46:55,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:46:55,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:55,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:46:55,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:55,921 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-10 07:46:55,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:46:55,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:46:55,921 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:46:55,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:46:55,922 INFO L82 PathProgramCache]: Analyzing trace with hash 638961531, now seen corresponding path program 2 times [2018-11-10 07:46:55,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:46:55,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:46:55,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:55,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:46:55,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-10 07:46:56,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:46:56,078 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:46:56,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:46:56,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:46:56,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:46:56,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:46:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 96 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 07:46:56,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:46:56,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-11-10 07:46:56,204 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:46:56,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:46:56,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:46:56,204 INFO L87 Difference]: Start difference. First operand 3120 states and 4183 transitions. cyclomatic complexity: 1086 Second operand 8 states. [2018-11-10 07:46:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:46:57,868 INFO L93 Difference]: Finished difference Result 3693 states and 4856 transitions. [2018-11-10 07:46:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:46:57,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3693 states and 4856 transitions. [2018-11-10 07:46:57,875 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 3136 [2018-11-10 07:46:57,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3693 states to 3672 states and 4827 transitions. [2018-11-10 07:46:57,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3672 [2018-11-10 07:46:57,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3672 [2018-11-10 07:46:57,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3672 states and 4827 transitions. [2018-11-10 07:46:57,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:46:57,886 INFO L705 BuchiCegarLoop]: Abstraction has 3672 states and 4827 transitions. [2018-11-10 07:46:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states and 4827 transitions. [2018-11-10 07:46:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3194. [2018-11-10 07:46:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2018-11-10 07:46:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4264 transitions. [2018-11-10 07:46:57,918 INFO L728 BuchiCegarLoop]: Abstraction has 3194 states and 4264 transitions. [2018-11-10 07:46:57,918 INFO L608 BuchiCegarLoop]: Abstraction has 3194 states and 4264 transitions. [2018-11-10 07:46:57,918 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 07:46:57,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3194 states and 4264 transitions. [2018-11-10 07:46:57,923 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 2840 [2018-11-10 07:46:57,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:46:57,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:46:57,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:46:57,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:46:57,924 INFO L793 eck$LassoCheckResult]: Stem: 26792#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 26761#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 26757#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 26758#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 26791#L44 assume mp_add_~a1~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 26796#L40-1 mp_add_~nb~0 := 4; 27234#L50 assume !(mp_add_~b3~0 % 256 == 0); 26779#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 26780#L61-3 assume true; 29235#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29234#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28549#L65 [2018-11-10 07:46:57,925 INFO L795 eck$LassoCheckResult]: Loop: 28549#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29231#L65-2 assume !(mp_add_~i~0 % 256 == 1); 29230#L66-1 assume !(mp_add_~i~0 % 256 == 2); 29228#L67-1 assume !(mp_add_~i~0 % 256 == 3); 29227#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27774#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 27773#L71-2 assume !(mp_add_~i~0 % 256 == 1); 27771#L72-1 assume !(mp_add_~i~0 % 256 == 2); 27772#L73-1 assume !(mp_add_~i~0 % 256 == 3); 29588#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29586#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 29584#L80-1 assume !(mp_add_~i~0 % 256 == 1); 29582#L81-1 assume !(mp_add_~i~0 % 256 == 2); 29580#L82-1 assume !(mp_add_~i~0 % 256 == 3); 29578#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 29576#L61-3 assume true; 29573#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29383#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29384#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29381#L71 assume !(mp_add_~i~0 % 256 == 0); 29380#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 29284#L72-1 assume !(mp_add_~i~0 % 256 == 2); 29379#L73-1 assume !(mp_add_~i~0 % 256 == 3); 29377#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29376#L76-1 assume !(mp_add_~i~0 % 256 == 0); 29374#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 29266#L81-1 assume !(mp_add_~i~0 % 256 == 2); 29372#L82-1 assume !(mp_add_~i~0 % 256 == 3); 29370#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 29368#L61-3 assume true; 29366#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29363#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29362#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29361#L71 assume !(mp_add_~i~0 % 256 == 0); 29360#L71-2 assume !(mp_add_~i~0 % 256 == 1); 29357#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 29354#L73-1 assume !(mp_add_~i~0 % 256 == 3); 29352#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29351#L76-1 assume !(mp_add_~i~0 % 256 == 0); 29349#L80-1 assume !(mp_add_~i~0 % 256 == 1); 29330#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 29261#L82-1 assume !(mp_add_~i~0 % 256 == 3); 29306#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 29327#L61-3 assume true; 29326#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29325#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29323#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29320#L71 assume !(mp_add_~i~0 % 256 == 0); 29318#L71-2 assume !(mp_add_~i~0 % 256 == 1); 29316#L72-1 assume !(mp_add_~i~0 % 256 == 2); 29313#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 29276#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29311#L76-1 assume !(mp_add_~i~0 % 256 == 0); 29309#L80-1 assume !(mp_add_~i~0 % 256 == 1); 29307#L81-1 assume !(mp_add_~i~0 % 256 == 2); 29303#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 29302#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 29300#L61-3 assume true; 29298#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29296#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29293#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29294#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29529#L76-1 assume !(mp_add_~i~0 % 256 == 0); 29527#L80-1 assume !(mp_add_~i~0 % 256 == 1); 29525#L81-1 assume !(mp_add_~i~0 % 256 == 2); 27780#L82-1 assume !(mp_add_~i~0 % 256 == 3); 27779#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 27758#L61-3 assume true; 27759#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29229#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28549#L65 [2018-11-10 07:46:57,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:46:57,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2138521123, now seen corresponding path program 1 times [2018-11-10 07:46:57,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:46:57,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:46:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:57,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:46:57,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:46:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:46:57,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:46:57,935 INFO L82 PathProgramCache]: Analyzing trace with hash -159596241, now seen corresponding path program 1 times [2018-11-10 07:46:57,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:46:57,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:46:57,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:57,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:46:57,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:46:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 56 proven. 58 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 07:46:58,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:46:58,022 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:46:58,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:46:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:58,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:46:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 88 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 07:46:58,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:46:58,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-11-10 07:46:58,163 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:46:58,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 07:46:58,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-10 07:46:58,163 INFO L87 Difference]: Start difference. First operand 3194 states and 4264 transitions. cyclomatic complexity: 1094 Second operand 12 states. [2018-11-10 07:47:00,835 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-11-10 07:47:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:47:14,087 INFO L93 Difference]: Finished difference Result 7526 states and 9531 transitions. [2018-11-10 07:47:14,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-10 07:47:14,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7526 states and 9531 transitions. [2018-11-10 07:47:14,100 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 5929 [2018-11-10 07:47:14,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7526 states to 7441 states and 9444 transitions. [2018-11-10 07:47:14,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7441 [2018-11-10 07:47:14,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7441 [2018-11-10 07:47:14,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7441 states and 9444 transitions. [2018-11-10 07:47:14,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:47:14,119 INFO L705 BuchiCegarLoop]: Abstraction has 7441 states and 9444 transitions. [2018-11-10 07:47:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7441 states and 9444 transitions. [2018-11-10 07:47:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7441 to 3880. [2018-11-10 07:47:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3880 states. [2018-11-10 07:47:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 5142 transitions. [2018-11-10 07:47:14,163 INFO L728 BuchiCegarLoop]: Abstraction has 3880 states and 5142 transitions. [2018-11-10 07:47:14,163 INFO L608 BuchiCegarLoop]: Abstraction has 3880 states and 5142 transitions. [2018-11-10 07:47:14,164 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 07:47:14,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3880 states and 5142 transitions. [2018-11-10 07:47:14,170 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 3562 [2018-11-10 07:47:14,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:47:14,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:47:14,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:47:14,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:47:14,171 INFO L793 eck$LassoCheckResult]: Stem: 37925#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 37892#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 37887#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37889#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37922#L44 assume mp_add_~a1~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37883#L40-1 mp_add_~nb~0 := 4; 37884#L50 assume !(mp_add_~b3~0 % 256 == 0); 38624#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 38623#L61-3 assume true; 38622#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 38621#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 38617#L65 [2018-11-10 07:47:14,172 INFO L795 eck$LassoCheckResult]: Loop: 38617#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 38618#L65-2 assume !(mp_add_~i~0 % 256 == 1); 40024#L66-1 assume !(mp_add_~i~0 % 256 == 2); 40023#L67-1 assume !(mp_add_~i~0 % 256 == 3); 40022#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40021#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 40020#L71-2 assume !(mp_add_~i~0 % 256 == 1); 40019#L72-1 assume !(mp_add_~i~0 % 256 == 2); 40018#L73-1 assume !(mp_add_~i~0 % 256 == 3); 40016#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 40017#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 40081#L80-1 assume !(mp_add_~i~0 % 256 == 1); 40080#L81-1 assume !(mp_add_~i~0 % 256 == 2); 40079#L82-1 assume !(mp_add_~i~0 % 256 == 3); 40078#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 40077#L61-3 assume true; 40076#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40075#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40074#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40073#L71 assume !(mp_add_~i~0 % 256 == 0); 40072#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 39899#L72-1 assume !(mp_add_~i~0 % 256 == 2); 40049#L73-1 assume !(mp_add_~i~0 % 256 == 3); 40071#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 40003#L76-1 assume !(mp_add_~i~0 % 256 == 0); 40070#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 39891#L81-1 assume !(mp_add_~i~0 % 256 == 2); 40069#L82-1 assume !(mp_add_~i~0 % 256 == 3); 40067#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 40066#L61-3 assume true; 40058#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40059#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40054#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40055#L71 assume !(mp_add_~i~0 % 256 == 0); 40050#L71-2 assume !(mp_add_~i~0 % 256 == 1); 40051#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 40065#L73-1 assume !(mp_add_~i~0 % 256 == 3); 40064#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39983#L76-1 assume !(mp_add_~i~0 % 256 == 0); 40045#L80-1 assume !(mp_add_~i~0 % 256 == 1); 40041#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 39889#L82-1 assume !(mp_add_~i~0 % 256 == 3); 40040#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 40039#L61-3 assume true; 40038#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40037#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40036#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40035#L71 assume !(mp_add_~i~0 % 256 == 0); 40034#L71-2 assume !(mp_add_~i~0 % 256 == 1); 40033#L72-1 assume !(mp_add_~i~0 % 256 == 2); 40032#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 39895#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39961#L76-1 assume !(mp_add_~i~0 % 256 == 0); 40031#L80-1 assume !(mp_add_~i~0 % 256 == 1); 40030#L81-1 assume !(mp_add_~i~0 % 256 == 2); 40029#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 39887#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 40026#L61-3 assume true; 39998#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39997#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39996#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39995#L71 assume !(mp_add_~i~0 % 256 == 0); 39994#L71-2 assume !(mp_add_~i~0 % 256 == 1); 39993#L72-1 assume !(mp_add_~i~0 % 256 == 2); 39944#L73-1 assume !(mp_add_~i~0 % 256 == 3); 39943#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39923#L76-1 assume !(mp_add_~i~0 % 256 == 0); 39922#L80-1 assume !(mp_add_~i~0 % 256 == 1); 39921#L81-1 assume !(mp_add_~i~0 % 256 == 2); 39920#L82-1 assume !(mp_add_~i~0 % 256 == 3); 39919#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 39918#L61-3 assume true; 39917#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39916#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39915#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39914#L71 assume !(mp_add_~i~0 % 256 == 0); 39913#L71-2 assume !(mp_add_~i~0 % 256 == 1); 39912#L72-1 assume !(mp_add_~i~0 % 256 == 2); 39911#L73-1 assume !(mp_add_~i~0 % 256 == 3); 39910#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39909#L76-1 assume !(mp_add_~i~0 % 256 == 0); 39908#L80-1 assume !(mp_add_~i~0 % 256 == 1); 39907#L81-1 assume !(mp_add_~i~0 % 256 == 2); 39906#L82-1 assume !(mp_add_~i~0 % 256 == 3); 39905#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 39904#L61-3 assume true; 39903#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39902#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39882#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39900#L71 assume !(mp_add_~i~0 % 256 == 0); 39898#L71-2 assume !(mp_add_~i~0 % 256 == 1); 39896#L72-1 assume !(mp_add_~i~0 % 256 == 2); 39894#L73-1 assume !(mp_add_~i~0 % 256 == 3); 39893#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39892#L76-1 assume !(mp_add_~i~0 % 256 == 0); 39890#L80-1 assume !(mp_add_~i~0 % 256 == 1); 39888#L81-1 assume !(mp_add_~i~0 % 256 == 2); 39886#L82-1 assume !(mp_add_~i~0 % 256 == 3); 39885#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 39884#L61-3 assume true; 39883#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39881#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 38617#L65 [2018-11-10 07:47:14,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:47:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2138521123, now seen corresponding path program 2 times [2018-11-10 07:47:14,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:47:14,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:47:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:14,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:14,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:47:14,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1689900615, now seen corresponding path program 1 times [2018-11-10 07:47:14,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:47:14,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:47:14,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:14,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:47:14,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 112 proven. 172 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 07:47:14,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:47:14,334 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:47:14,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:14,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:47:14,890 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-10 07:47:15,133 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-10 07:47:15,452 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-10 07:47:15,701 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-10 07:47:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 154 proven. 12 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-10 07:47:16,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:47:16,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-10 07:47:16,045 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:47:16,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 07:47:16,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=197, Unknown=2, NotChecked=0, Total=272 [2018-11-10 07:47:16,054 INFO L87 Difference]: Start difference. First operand 3880 states and 5142 transitions. cyclomatic complexity: 1285 Second operand 17 states. [2018-11-10 07:47:17,939 WARN L179 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-10 07:47:19,038 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2018-11-10 07:47:22,842 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-11-10 07:47:23,494 WARN L179 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2018-11-10 07:47:24,465 WARN L179 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 19 [2018-11-10 07:47:25,660 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-10 07:47:28,215 WARN L179 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-10 07:47:31,335 WARN L179 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-11-10 07:47:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:47:31,346 INFO L93 Difference]: Finished difference Result 5641 states and 6737 transitions. [2018-11-10 07:47:31,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 07:47:31,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5641 states and 6737 transitions. [2018-11-10 07:47:31,358 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 3693 [2018-11-10 07:47:31,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5641 states to 5362 states and 6113 transitions. [2018-11-10 07:47:31,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5362 [2018-11-10 07:47:31,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5362 [2018-11-10 07:47:31,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5362 states and 6113 transitions. [2018-11-10 07:47:31,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:47:31,379 INFO L705 BuchiCegarLoop]: Abstraction has 5362 states and 6113 transitions. [2018-11-10 07:47:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states and 6113 transitions. [2018-11-10 07:47:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 2431. [2018-11-10 07:47:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2431 states. [2018-11-10 07:47:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3027 transitions. [2018-11-10 07:47:31,412 INFO L728 BuchiCegarLoop]: Abstraction has 2431 states and 3027 transitions. [2018-11-10 07:47:31,412 INFO L608 BuchiCegarLoop]: Abstraction has 2431 states and 3027 transitions. [2018-11-10 07:47:31,412 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 07:47:31,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2431 states and 3027 transitions. [2018-11-10 07:47:31,417 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 2163 [2018-11-10 07:47:31,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:47:31,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:47:31,419 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:47:31,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:47:31,419 INFO L793 eck$LassoCheckResult]: Stem: 47846#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 47823#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 47818#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 47820#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 47845#L44 assume !(mp_add_~a1~0 % 256 == 0); 47847#L40-1 mp_add_~nb~0 := 4; 47839#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 47841#L52 assume !(mp_add_~b2~0 % 256 == 0); 47828#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 49601#L61-3 assume true; 49599#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 49600#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 49598#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 47852#L65-2 [2018-11-10 07:47:31,419 INFO L795 eck$LassoCheckResult]: Loop: 47852#L65-2 assume !(mp_add_~i~0 % 256 == 1); 49597#L66-1 assume !(mp_add_~i~0 % 256 == 2); 49596#L67-1 assume !(mp_add_~i~0 % 256 == 3); 49595#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 49594#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 49593#L71-2 assume !(mp_add_~i~0 % 256 == 1); 49592#L72-1 assume !(mp_add_~i~0 % 256 == 2); 49591#L73-1 assume !(mp_add_~i~0 % 256 == 3); 49589#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 49587#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 49588#L80-1 assume !(mp_add_~i~0 % 256 == 1); 49583#L81-1 assume !(mp_add_~i~0 % 256 == 2); 49584#L82-1 assume !(mp_add_~i~0 % 256 == 3); 49579#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 49580#L61-3 assume true; 49575#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 49576#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 49573#L65 assume !(mp_add_~i~0 % 256 == 0); 49451#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 49448#L66-1 assume !(mp_add_~i~0 % 256 == 2); 49446#L67-1 assume !(mp_add_~i~0 % 256 == 3); 49443#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 49442#L71 assume !(mp_add_~i~0 % 256 == 0); 49441#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 49440#L72-1 assume !(mp_add_~i~0 % 256 == 2); 49439#L73-1 assume !(mp_add_~i~0 % 256 == 3); 49437#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 49436#L76-1 assume !(mp_add_~i~0 % 256 == 0); 49435#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 49434#L81-1 assume !(mp_add_~i~0 % 256 == 2); 49433#L82-1 assume !(mp_add_~i~0 % 256 == 3); 49432#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 49431#L61-3 assume true; 49430#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 49429#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 49428#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 49427#L71 assume !(mp_add_~i~0 % 256 == 0); 49426#L71-2 assume !(mp_add_~i~0 % 256 == 1); 49425#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 49424#L73-1 assume !(mp_add_~i~0 % 256 == 3); 49423#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 49364#L76-1 assume !(mp_add_~i~0 % 256 == 0); 49365#L80-1 assume !(mp_add_~i~0 % 256 == 1); 49355#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 48157#L82-1 assume !(mp_add_~i~0 % 256 == 3); 49349#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 49350#L61-3 assume true; 49343#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 49344#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 49336#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 49337#L71 assume !(mp_add_~i~0 % 256 == 0); 49301#L71-2 assume !(mp_add_~i~0 % 256 == 1); 49302#L72-1 assume !(mp_add_~i~0 % 256 == 2); 49250#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 49251#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 49414#L76-1 assume !(mp_add_~i~0 % 256 == 0); 49415#L80-1 assume !(mp_add_~i~0 % 256 == 1); 49405#L81-1 assume !(mp_add_~i~0 % 256 == 2); 49406#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 48837#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 48838#L61-3 assume true; 49366#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 49367#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48829#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48830#L71 assume !(mp_add_~i~0 % 256 == 0); 49334#L71-2 assume !(mp_add_~i~0 % 256 == 1); 49335#L72-1 assume !(mp_add_~i~0 % 256 == 2); 49320#L73-1 assume !(mp_add_~i~0 % 256 == 3); 48818#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 48819#L76-1 assume !(mp_add_~i~0 % 256 == 0); 48814#L80-1 assume !(mp_add_~i~0 % 256 == 1); 48815#L81-1 assume !(mp_add_~i~0 % 256 == 2); 48809#L82-1 assume !(mp_add_~i~0 % 256 == 3); 48810#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 50188#L61-3 assume true; 50187#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 50186#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 50185#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 50184#L71 assume !(mp_add_~i~0 % 256 == 0); 50183#L71-2 assume !(mp_add_~i~0 % 256 == 1); 49260#L72-1 assume !(mp_add_~i~0 % 256 == 2); 49256#L73-1 assume !(mp_add_~i~0 % 256 == 3); 49257#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 49252#L76-1 assume !(mp_add_~i~0 % 256 == 0); 49253#L80-1 assume !(mp_add_~i~0 % 256 == 1); 49146#L81-1 assume !(mp_add_~i~0 % 256 == 2); 49125#L82-1 assume !(mp_add_~i~0 % 256 == 3); 48246#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 48247#L61-3 assume true; 48242#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 48243#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48238#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48239#L71 assume !(mp_add_~i~0 % 256 == 0); 48234#L71-2 assume !(mp_add_~i~0 % 256 == 1); 48235#L72-1 assume !(mp_add_~i~0 % 256 == 2); 48230#L73-1 assume !(mp_add_~i~0 % 256 == 3); 48231#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 48226#L76-1 assume !(mp_add_~i~0 % 256 == 0); 48227#L80-1 assume !(mp_add_~i~0 % 256 == 1); 48222#L81-1 assume !(mp_add_~i~0 % 256 == 2); 48223#L82-1 assume !(mp_add_~i~0 % 256 == 3); 48218#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 48219#L61-3 assume true; 48214#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 48215#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48210#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48211#L71 assume !(mp_add_~i~0 % 256 == 0); 48206#L71-2 assume !(mp_add_~i~0 % 256 == 1); 48207#L72-1 assume !(mp_add_~i~0 % 256 == 2); 48201#L73-1 assume !(mp_add_~i~0 % 256 == 3); 48203#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 48197#L76-1 assume !(mp_add_~i~0 % 256 == 0); 48198#L80-1 assume !(mp_add_~i~0 % 256 == 1); 48193#L81-1 assume !(mp_add_~i~0 % 256 == 2); 48194#L82-1 assume !(mp_add_~i~0 % 256 == 3); 48189#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 48190#L61-3 assume true; 48185#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 48186#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48182#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48183#L71 assume !(mp_add_~i~0 % 256 == 0); 48178#L71-2 assume !(mp_add_~i~0 % 256 == 1); 48179#L72-1 assume !(mp_add_~i~0 % 256 == 2); 48172#L73-1 assume !(mp_add_~i~0 % 256 == 3); 48174#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 48164#L76-1 assume !(mp_add_~i~0 % 256 == 0); 48165#L80-1 assume !(mp_add_~i~0 % 256 == 1); 48156#L81-1 assume !(mp_add_~i~0 % 256 == 2); 48158#L82-1 assume !(mp_add_~i~0 % 256 == 3); 47866#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 47867#L61-3 assume true; 47997#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 47998#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 47851#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 47852#L65-2 [2018-11-10 07:47:31,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:47:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1131542760, now seen corresponding path program 1 times [2018-11-10 07:47:31,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:47:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:47:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:31,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:31,448 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-10 07:47:31,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:47:31,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:47:31,448 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:47:31,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:47:31,449 INFO L82 PathProgramCache]: Analyzing trace with hash 808760997, now seen corresponding path program 1 times [2018-11-10 07:47:31,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:47:31,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:47:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:31,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:31,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 263 proven. 185 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 07:47:32,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:47:32,538 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:47:32,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:32,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:47:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 115 proven. 99 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-11-10 07:47:37,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:47:37,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2018-11-10 07:47:37,316 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:47:37,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:47:37,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:47:37,317 INFO L87 Difference]: Start difference. First operand 2431 states and 3027 transitions. cyclomatic complexity: 609 Second operand 3 states. [2018-11-10 07:47:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:47:37,321 INFO L93 Difference]: Finished difference Result 2113 states and 2631 transitions. [2018-11-10 07:47:37,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:47:37,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2113 states and 2631 transitions. [2018-11-10 07:47:37,325 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1918 [2018-11-10 07:47:37,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2113 states to 2113 states and 2631 transitions. [2018-11-10 07:47:37,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2113 [2018-11-10 07:47:37,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2113 [2018-11-10 07:47:37,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2113 states and 2631 transitions. [2018-11-10 07:47:37,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:47:37,331 INFO L705 BuchiCegarLoop]: Abstraction has 2113 states and 2631 transitions. [2018-11-10 07:47:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states and 2631 transitions. [2018-11-10 07:47:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2113. [2018-11-10 07:47:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2018-11-10 07:47:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2631 transitions. [2018-11-10 07:47:37,342 INFO L728 BuchiCegarLoop]: Abstraction has 2113 states and 2631 transitions. [2018-11-10 07:47:37,342 INFO L608 BuchiCegarLoop]: Abstraction has 2113 states and 2631 transitions. [2018-11-10 07:47:37,342 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 07:47:37,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2113 states and 2631 transitions. [2018-11-10 07:47:37,345 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1918 [2018-11-10 07:47:37,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:47:37,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:47:37,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:47:37,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:47:37,346 INFO L793 eck$LassoCheckResult]: Stem: 52813#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 52790#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 52785#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 52787#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 52812#L44 assume !(mp_add_~a1~0 % 256 == 0); 52816#L40-1 mp_add_~nb~0 := 4; 52808#L50 assume !(mp_add_~b3~0 % 256 == 0); 52809#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 52828#L61-3 assume true; 52829#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 52824#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 52825#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 54090#L65-2 assume !(mp_add_~i~0 % 256 == 1); 54089#L66-1 assume !(mp_add_~i~0 % 256 == 2); 54088#L67-1 assume !(mp_add_~i~0 % 256 == 3); 54087#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 54086#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 54085#L71-2 assume !(mp_add_~i~0 % 256 == 1); 54084#L72-1 assume !(mp_add_~i~0 % 256 == 2); 54083#L73-1 assume !(mp_add_~i~0 % 256 == 3); 54081#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 54082#L76-1 [2018-11-10 07:47:37,346 INFO L795 eck$LassoCheckResult]: Loop: 54082#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 54735#L80-1 assume !(mp_add_~i~0 % 256 == 1); 54734#L81-1 assume !(mp_add_~i~0 % 256 == 2); 54728#L82-1 assume !(mp_add_~i~0 % 256 == 3); 54718#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 54716#L61-3 assume true; 54714#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 54711#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 54038#L65 assume !(mp_add_~i~0 % 256 == 0); 54031#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 54030#L66-1 assume !(mp_add_~i~0 % 256 == 2); 54029#L67-1 assume !(mp_add_~i~0 % 256 == 3); 54028#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 54027#L71 assume !(mp_add_~i~0 % 256 == 0); 54026#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 54025#L72-1 assume !(mp_add_~i~0 % 256 == 2); 54024#L73-1 assume !(mp_add_~i~0 % 256 == 3); 54022#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 54021#L76-1 assume !(mp_add_~i~0 % 256 == 0); 54020#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 54019#L81-1 assume !(mp_add_~i~0 % 256 == 2); 54018#L82-1 assume !(mp_add_~i~0 % 256 == 3); 54017#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 54016#L61-3 assume true; 54015#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 54014#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 54013#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 54012#L71 assume !(mp_add_~i~0 % 256 == 0); 54011#L71-2 assume !(mp_add_~i~0 % 256 == 1); 54010#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 54009#L73-1 assume !(mp_add_~i~0 % 256 == 3); 54007#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 54006#L76-1 assume !(mp_add_~i~0 % 256 == 0); 54005#L80-1 assume !(mp_add_~i~0 % 256 == 1); 54004#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 53901#L82-1 assume !(mp_add_~i~0 % 256 == 3); 53902#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 53897#L61-3 assume true; 53898#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 53893#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 53894#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 53889#L71 assume !(mp_add_~i~0 % 256 == 0); 53890#L71-2 assume !(mp_add_~i~0 % 256 == 1); 53885#L72-1 assume !(mp_add_~i~0 % 256 == 2); 53886#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 54002#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 54003#L76-1 assume !(mp_add_~i~0 % 256 == 0); 53996#L80-1 assume !(mp_add_~i~0 % 256 == 1); 53997#L81-1 assume !(mp_add_~i~0 % 256 == 2); 53991#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 53943#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 53985#L61-3 assume true; 53986#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 53979#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 53980#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 53973#L71 assume !(mp_add_~i~0 % 256 == 0); 53974#L71-2 assume !(mp_add_~i~0 % 256 == 1); 53968#L72-1 assume !(mp_add_~i~0 % 256 == 2); 53955#L73-1 assume !(mp_add_~i~0 % 256 == 3); 53953#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 53951#L76-1 assume !(mp_add_~i~0 % 256 == 0); 53949#L80-1 assume !(mp_add_~i~0 % 256 == 1); 53947#L81-1 assume !(mp_add_~i~0 % 256 == 2); 53944#L82-1 assume !(mp_add_~i~0 % 256 == 3); 53945#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 54756#L61-3 assume true; 54755#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 54754#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 54753#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 54752#L71 assume !(mp_add_~i~0 % 256 == 0); 54751#L71-2 assume !(mp_add_~i~0 % 256 == 1); 54750#L72-1 assume !(mp_add_~i~0 % 256 == 2); 54749#L73-1 assume !(mp_add_~i~0 % 256 == 3); 54748#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 54747#L76-1 assume !(mp_add_~i~0 % 256 == 0); 54746#L80-1 assume !(mp_add_~i~0 % 256 == 1); 53817#L81-1 assume !(mp_add_~i~0 % 256 == 2); 53816#L82-1 assume !(mp_add_~i~0 % 256 == 3); 53815#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 53814#L61-3 assume true; 53813#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 53812#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 53811#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 53810#L71 assume !(mp_add_~i~0 % 256 == 0); 53809#L71-2 assume !(mp_add_~i~0 % 256 == 1); 53808#L72-1 assume !(mp_add_~i~0 % 256 == 2); 53807#L73-1 assume !(mp_add_~i~0 % 256 == 3); 53806#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 53805#L76-1 assume !(mp_add_~i~0 % 256 == 0); 53804#L80-1 assume !(mp_add_~i~0 % 256 == 1); 53803#L81-1 assume !(mp_add_~i~0 % 256 == 2); 53802#L82-1 assume !(mp_add_~i~0 % 256 == 3); 53801#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 53800#L61-3 assume true; 53799#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 53798#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 53797#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 53796#L71 assume !(mp_add_~i~0 % 256 == 0); 53795#L71-2 assume !(mp_add_~i~0 % 256 == 1); 53794#L72-1 assume !(mp_add_~i~0 % 256 == 2); 53793#L73-1 assume !(mp_add_~i~0 % 256 == 3); 53792#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 53791#L76-1 assume !(mp_add_~i~0 % 256 == 0); 53790#L80-1 assume !(mp_add_~i~0 % 256 == 1); 53789#L81-1 assume !(mp_add_~i~0 % 256 == 2); 53788#L82-1 assume !(mp_add_~i~0 % 256 == 3); 53787#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 53786#L61-3 assume true; 53785#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 53784#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 53766#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 53782#L71 assume !(mp_add_~i~0 % 256 == 0); 53781#L71-2 assume !(mp_add_~i~0 % 256 == 1); 53779#L72-1 assume !(mp_add_~i~0 % 256 == 2); 53777#L73-1 assume !(mp_add_~i~0 % 256 == 3); 53776#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 53775#L76-1 assume !(mp_add_~i~0 % 256 == 0); 53774#L80-1 assume !(mp_add_~i~0 % 256 == 1); 53772#L81-1 assume !(mp_add_~i~0 % 256 == 2); 53770#L82-1 assume !(mp_add_~i~0 % 256 == 3); 53769#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 53768#L61-3 assume true; 53767#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 53765#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 52821#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 52822#L65-2 assume !(mp_add_~i~0 % 256 == 1); 54822#L66-1 assume !(mp_add_~i~0 % 256 == 2); 54821#L67-1 assume !(mp_add_~i~0 % 256 == 3); 54820#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 54819#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 54818#L71-2 assume !(mp_add_~i~0 % 256 == 1); 54817#L72-1 assume !(mp_add_~i~0 % 256 == 2); 54816#L73-1 assume !(mp_add_~i~0 % 256 == 3); 54815#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 54082#L76-1 [2018-11-10 07:47:37,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:47:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1001408861, now seen corresponding path program 1 times [2018-11-10 07:47:37,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:47:37,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:47:37,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:37,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:37,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:37,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:47:37,364 INFO L82 PathProgramCache]: Analyzing trace with hash -691355045, now seen corresponding path program 2 times [2018-11-10 07:47:37,364 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:47:37,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:47:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:37,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 283 proven. 185 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 07:47:37,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:47:37,921 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/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-10 07:47:37,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:47:37,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:47:37,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:47:37,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:47:38,162 WARN L854 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_mp_add_~nb~0 Int)) (< (mod c_ULTIMATE.start_mp_add_~i~0 256) (mod ULTIMATE.start_mp_add_~nb~0 256))) is different from true [2018-11-10 07:47:39,065 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-10 07:47:39,312 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-10 07:47:39,563 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 07:47:39,843 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 07:47:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 1 not checked. [2018-11-10 07:47:39,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:47:39,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-11-10 07:47:39,949 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:47:39,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 07:47:39,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=4, NotChecked=30, Total=306 [2018-11-10 07:47:39,949 INFO L87 Difference]: Start difference. First operand 2113 states and 2631 transitions. cyclomatic complexity: 529 Second operand 18 states. [2018-11-10 07:47:40,558 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-10 07:47:41,125 WARN L179 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-11-10 07:47:43,407 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-10 07:47:45,609 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2018-11-10 07:47:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:47:47,224 INFO L93 Difference]: Finished difference Result 2706 states and 2842 transitions. [2018-11-10 07:47:47,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 07:47:47,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2706 states and 2842 transitions. [2018-11-10 07:47:47,229 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 250 [2018-11-10 07:47:47,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2706 states to 2645 states and 2768 transitions. [2018-11-10 07:47:47,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2645 [2018-11-10 07:47:47,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2645 [2018-11-10 07:47:47,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2645 states and 2768 transitions. [2018-11-10 07:47:47,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:47:47,236 INFO L705 BuchiCegarLoop]: Abstraction has 2645 states and 2768 transitions. [2018-11-10 07:47:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states and 2768 transitions. [2018-11-10 07:47:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 524. [2018-11-10 07:47:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-11-10 07:47:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 577 transitions. [2018-11-10 07:47:47,247 INFO L728 BuchiCegarLoop]: Abstraction has 524 states and 577 transitions. [2018-11-10 07:47:47,247 INFO L608 BuchiCegarLoop]: Abstraction has 524 states and 577 transitions. [2018-11-10 07:47:47,247 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 07:47:47,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 524 states and 577 transitions. [2018-11-10 07:47:47,248 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2018-11-10 07:47:47,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:47:47,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:47:47,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:47:47,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:47:47,249 INFO L793 eck$LassoCheckResult]: Stem: 58102#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 58084#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 58079#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 58081#L42 assume !(mp_add_~a2~0 % 256 == 0); 58099#L40-1 mp_add_~nb~0 := 4; 58179#L50 assume !(mp_add_~b3~0 % 256 == 0); 58175#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 58176#L61-3 assume true; 58171#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 58172#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 58167#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 58168#L65-2 assume !(mp_add_~i~0 % 256 == 1); 58163#L66-1 assume !(mp_add_~i~0 % 256 == 2); 58164#L67-1 assume !(mp_add_~i~0 % 256 == 3); 58159#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 58160#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 58155#L71-2 assume !(mp_add_~i~0 % 256 == 1); 58156#L72-1 assume !(mp_add_~i~0 % 256 == 2); 58151#L73-1 assume !(mp_add_~i~0 % 256 == 3); 58152#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 58211#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 58212#L80-1 assume !(mp_add_~i~0 % 256 == 1); 58207#L81-1 assume !(mp_add_~i~0 % 256 == 2); 58208#L82-1 assume !(mp_add_~i~0 % 256 == 3); 58203#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 58204#L61-3 assume true; 58199#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 58200#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 58195#L65 assume !(mp_add_~i~0 % 256 == 0); 58196#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 58189#L66-1 assume !(mp_add_~i~0 % 256 == 2); 58190#L67-1 assume !(mp_add_~i~0 % 256 == 3); 58181#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 58182#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 58433#L76-1 assume !(mp_add_~i~0 % 256 == 0); 58431#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 58427#L81-1 assume !(mp_add_~i~0 % 256 == 2); 58426#L82-1 assume !(mp_add_~i~0 % 256 == 3); 58422#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 58418#L61-3 assume true; 58417#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 58413#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 58409#L65 assume !(mp_add_~i~0 % 256 == 0); 58408#L65-2 assume !(mp_add_~i~0 % 256 == 1); 58404#L66-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 58401#L67-1 assume !(mp_add_~i~0 % 256 == 3); 58394#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 58388#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 58386#L76-1 assume !(mp_add_~i~0 % 256 == 0); 58387#L80-1 assume !(mp_add_~i~0 % 256 == 1); 58382#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 58249#L82-1 [2018-11-10 07:47:47,249 INFO L795 eck$LassoCheckResult]: Loop: 58249#L82-1 assume !(mp_add_~i~0 % 256 == 3); 58247#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 58246#L61-3 assume true; 58245#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 58244#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 58086#L65 assume !(mp_add_~i~0 % 256 == 0); 58087#L65-2 assume !(mp_add_~i~0 % 256 == 1); 58103#L66-1 assume !(mp_add_~i~0 % 256 == 2); 58088#L67-1 assume !(mp_add_~i~0 % 256 == 3); 58089#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 58098#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 58588#L76-1 assume !(mp_add_~i~0 % 256 == 0); 58582#L80-1 assume !(mp_add_~i~0 % 256 == 1); 58383#L81-1 assume !(mp_add_~i~0 % 256 == 2); 58249#L82-1 [2018-11-10 07:47:47,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:47:47,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1480154629, now seen corresponding path program 1 times [2018-11-10 07:47:47,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:47:47,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:47:47,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:47,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:47:47,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 07:47:47,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:47:47,370 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:47:47,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:47,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:47:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:47:47,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:47:47,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-10 07:47:47,468 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:47:47,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:47:47,469 INFO L82 PathProgramCache]: Analyzing trace with hash -461293119, now seen corresponding path program 1 times [2018-11-10 07:47:47,469 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:47:47,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:47:47,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:47,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:47,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:47,588 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:47:47,589 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:47:47,589 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:47:47,589 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:47:47,590 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:47:47,590 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:47:47,590 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:47:47,590 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:47:47,590 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration17_Loop [2018-11-10 07:47:47,590 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:47:47,590 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:47:47,603 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-10 07:47:47,619 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-10 07:47:47,774 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:47:47,774 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:47:47,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:47:47,778 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:47:47,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:47:47,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:47:48,869 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:47:48,871 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:47:48,871 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:47:48,871 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:47:48,871 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:47:48,871 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:47:48,871 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:47:48,871 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:47:48,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:47:48,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration17_Loop [2018-11-10 07:47:48,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:47:48,871 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:47:48,872 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-10 07:47:48,884 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-10 07:47:48,999 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:47:49,002 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:47:49,003 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-10 07:47:49,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:49,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:47:49,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:47:49,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,012 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-10 07:47:49,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:49,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:47:49,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:47:49,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,015 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 07:47:49,015 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-10 07:47:49,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:49,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,016 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:47:49,018 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:47:49,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,024 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-10 07:47:49,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:49,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,025 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:47:49,026 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:47:49,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,028 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 07:47:49,028 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-10 07:47:49,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:49,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,029 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:49,031 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:49,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,041 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-10 07:47:49,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:49,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,042 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:49,043 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:49,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,044 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 07:47:49,044 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-10 07:47:49,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:49,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,045 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:47:49,048 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:47:49,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,053 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-10 07:47:49,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:49,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,054 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:47:49,055 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:47:49,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,056 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 07:47:49,056 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-10 07:47:49,057 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:49,057 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:47:49,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,057 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:47:49,060 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:47:49,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,070 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-10 07:47:49,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:49,070 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:47:49,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,071 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:47:49,072 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:47:49,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,073 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 07:47:49,074 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-10 07:47:49,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:49,074 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 07:47:49,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,075 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:49,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:49,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,092 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-10 07:47:49,092 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:49,092 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 07:47:49,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,093 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:49,095 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:49,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,097 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 07:47:49,097 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-10 07:47:49,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:49,098 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:47:49,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,098 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:47:49,103 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:47:49,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,117 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-10 07:47:49,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:49,118 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:47:49,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,118 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:47:49,120 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:47:49,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,122 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 07:47:49,122 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-10 07:47:49,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:49,123 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:47:49,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,123 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:49,124 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:49,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,132 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-10 07:47:49,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:49,133 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:47:49,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,133 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:49,134 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:49,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,137 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 07:47:49,138 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-10 07:47:49,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:49,138 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:47:49,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,139 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 07:47:49,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:47:49,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,159 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-10 07:47:49,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:49,159 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:47:49,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:49,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:49,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:49,160 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 07:47:49,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:47:49,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:49,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:49,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:47:49,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:47:49,167 INFO L87 Difference]: Start difference. First operand 524 states and 577 transitions. cyclomatic complexity: 56 Second operand 10 states. [2018-11-10 07:47:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:47:49,489 INFO L93 Difference]: Finished difference Result 520 states and 553 transitions. [2018-11-10 07:47:49,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:47:49,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 520 states and 553 transitions. [2018-11-10 07:47:49,490 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 69 [2018-11-10 07:47:49,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 520 states to 506 states and 539 transitions. [2018-11-10 07:47:49,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 506 [2018-11-10 07:47:49,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 506 [2018-11-10 07:47:49,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 506 states and 539 transitions. [2018-11-10 07:47:49,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:47:49,491 INFO L705 BuchiCegarLoop]: Abstraction has 506 states and 539 transitions. [2018-11-10 07:47:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 539 transitions. [2018-11-10 07:47:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 359. [2018-11-10 07:47:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-10 07:47:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 386 transitions. [2018-11-10 07:47:49,493 INFO L728 BuchiCegarLoop]: Abstraction has 359 states and 386 transitions. [2018-11-10 07:47:49,493 INFO L608 BuchiCegarLoop]: Abstraction has 359 states and 386 transitions. [2018-11-10 07:47:49,494 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 07:47:49,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 359 states and 386 transitions. [2018-11-10 07:47:49,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2018-11-10 07:47:49,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:47:49,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:47:49,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:47:49,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:47:49,495 INFO L793 eck$LassoCheckResult]: Stem: 59319#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 59301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 59296#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 59298#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 59318#L44 assume mp_add_~a1~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 59322#L40-1 mp_add_~nb~0 := 4; 59368#L50 assume !(mp_add_~b3~0 % 256 == 0); 59367#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 59366#L61-3 assume true; 59365#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 59364#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 59323#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 59324#L65-2 assume !(mp_add_~i~0 % 256 == 1); 59334#L66-1 assume !(mp_add_~i~0 % 256 == 2); 59307#L67-1 assume !(mp_add_~i~0 % 256 == 3); 59308#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 59625#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 59624#L71-2 assume !(mp_add_~i~0 % 256 == 1); 59623#L72-1 assume !(mp_add_~i~0 % 256 == 2); 59622#L73-1 assume !(mp_add_~i~0 % 256 == 3); 59620#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 59619#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 59618#L80-1 assume !(mp_add_~i~0 % 256 == 1); 59617#L81-1 assume !(mp_add_~i~0 % 256 == 2); 59616#L82-1 assume !(mp_add_~i~0 % 256 == 3); 59615#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 59614#L61-3 assume true; 59613#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 59612#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 59611#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 59609#L71 assume !(mp_add_~i~0 % 256 == 0); 59607#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 59606#L72-1 assume !(mp_add_~i~0 % 256 == 2); 59605#L73-1 assume !(mp_add_~i~0 % 256 == 3); 59603#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 59602#L76-1 assume !(mp_add_~i~0 % 256 == 0); 59601#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 59600#L81-1 assume !(mp_add_~i~0 % 256 == 2); 59599#L82-1 assume !(mp_add_~i~0 % 256 == 3); 59598#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 59597#L61-3 assume true; 59596#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 59595#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 59593#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 59591#L71 assume !(mp_add_~i~0 % 256 == 0); 59589#L71-2 assume !(mp_add_~i~0 % 256 == 1); 59588#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 59586#L73-1 assume !(mp_add_~i~0 % 256 == 3); 59583#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 59581#L76-1 assume !(mp_add_~i~0 % 256 == 0); 59579#L80-1 assume !(mp_add_~i~0 % 256 == 1); 59577#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 59575#L82-1 assume !(mp_add_~i~0 % 256 == 3); 59573#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 59571#L61-3 assume true; 59569#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 59567#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 59565#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 59564#L71 assume !(mp_add_~i~0 % 256 == 0); 59563#L71-2 assume !(mp_add_~i~0 % 256 == 1); 59556#L72-1 assume !(mp_add_~i~0 % 256 == 2); 59545#L73-1 assume !(mp_add_~i~0 % 256 == 3); 59300#L70 [2018-11-10 07:47:49,495 INFO L795 eck$LassoCheckResult]: Loop: 59300#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 59304#L76-1 assume !(mp_add_~i~0 % 256 == 0); 59287#L80-1 assume !(mp_add_~i~0 % 256 == 1); 59288#L81-1 assume !(mp_add_~i~0 % 256 == 2); 59291#L82-1 assume !(mp_add_~i~0 % 256 == 3); 59292#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 59309#L61-3 assume true; 59310#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 59313#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 59316#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 59295#L71 assume !(mp_add_~i~0 % 256 == 0); 59289#L71-2 assume !(mp_add_~i~0 % 256 == 1); 59290#L72-1 assume !(mp_add_~i~0 % 256 == 2); 59299#L73-1 assume !(mp_add_~i~0 % 256 == 3); 59300#L70 [2018-11-10 07:47:49,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:47:49,495 INFO L82 PathProgramCache]: Analyzing trace with hash -634732666, now seen corresponding path program 1 times [2018-11-10 07:47:49,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:47:49,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:47:49,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:49,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:49,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 07:47:49,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:47:49,548 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:47:49,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:49,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:47:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 07:47:49,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:47:49,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-11-10 07:47:49,689 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:47:49,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:47:49,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1054624155, now seen corresponding path program 1 times [2018-11-10 07:47:49,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:47:49,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:47:49,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:49,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:47:49,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:47:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:49,753 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:47:49,753 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:47:49,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:47:49,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:47:49,753 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:47:49,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:47:49,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:47:49,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:47:49,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration18_Loop [2018-11-10 07:47:49,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:47:49,754 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:47:49,754 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-10 07:47:49,762 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-10 07:47:49,873 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:47:49,873 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:47:49,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:47:49,878 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:47:49,884 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:47:49,884 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:47:49,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:47:49,902 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:47:49,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:47:49,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:47:59,748 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:47:59,750 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:47:59,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:47:59,750 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:47:59,750 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:47:59,750 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:47:59,750 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:47:59,751 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:47:59,751 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:47:59,751 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration18_Loop [2018-11-10 07:47:59,751 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:47:59,751 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:47:59,751 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-10 07:47:59,757 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-10 07:47:59,902 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:47:59,902 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:47:59,902 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-10 07:47:59,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:59,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:47:59,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:47:59,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,904 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-10 07:47:59,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:59,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:47:59,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:47:59,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,906 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 07:47:59,907 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-10 07:47:59,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:59,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,907 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:47:59,907 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:47:59,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,908 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-10 07:47:59,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:59,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,909 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:47:59,909 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:47:59,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,911 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 07:47:59,912 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-10 07:47:59,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:59,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,912 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:59,913 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:59,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,914 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-10 07:47:59,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:59,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,915 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:59,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:59,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,919 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 07:47:59,920 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-10 07:47:59,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:59,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,921 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:47:59,921 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:47:59,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,922 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-10 07:47:59,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:47:59,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,923 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:47:59,924 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:47:59,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,929 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 07:47:59,929 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-10 07:47:59,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:59,930 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:47:59,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,930 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:47:59,931 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:47:59,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,932 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-10 07:47:59,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:59,933 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:47:59,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,933 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:47:59,934 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:47:59,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,940 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 07:47:59,940 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-10 07:47:59,941 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:59,941 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 07:47:59,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,941 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:59,942 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:59,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,944 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-10 07:47:59,945 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:59,945 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 07:47:59,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,945 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:59,947 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:59,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,955 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 07:47:59,955 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-10 07:47:59,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:59,956 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:47:59,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,956 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:47:59,958 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:47:59,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,960 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-10 07:47:59,960 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:59,961 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:47:59,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,961 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:47:59,964 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:47:59,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,986 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 07:47:59,986 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-10 07:47:59,986 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:59,986 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:47:59,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,987 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:59,987 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:59,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:47:59,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:47:59,991 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-10 07:47:59,991 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:47:59,991 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:47:59,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:47:59,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:47:59,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:47:59,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:47:59,993 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:47:59,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:00,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:00,001 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 07:48:00,001 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-10 07:48:00,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:00,001 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:48:00,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:00,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:00,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:00,002 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 07:48:00,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:48:00,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:00,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:00,008 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-10 07:48:00,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:00,009 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:48:00,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:00,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:00,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:00,009 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 07:48:00,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:48:00,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:00,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:00,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:48:00,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:48:00,026 INFO L87 Difference]: Start difference. First operand 359 states and 386 transitions. cyclomatic complexity: 30 Second operand 10 states. [2018-11-10 07:48:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:00,698 INFO L93 Difference]: Finished difference Result 457 states and 477 transitions. [2018-11-10 07:48:00,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 07:48:00,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 457 states and 477 transitions. [2018-11-10 07:48:00,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 07:48:00,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 457 states to 449 states and 469 transitions. [2018-11-10 07:48:00,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2018-11-10 07:48:00,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2018-11-10 07:48:00,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 449 states and 469 transitions. [2018-11-10 07:48:00,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:00,702 INFO L705 BuchiCegarLoop]: Abstraction has 449 states and 469 transitions. [2018-11-10 07:48:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states and 469 transitions. [2018-11-10 07:48:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 301. [2018-11-10 07:48:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-11-10 07:48:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2018-11-10 07:48:00,705 INFO L728 BuchiCegarLoop]: Abstraction has 301 states and 319 transitions. [2018-11-10 07:48:00,705 INFO L608 BuchiCegarLoop]: Abstraction has 301 states and 319 transitions. [2018-11-10 07:48:00,705 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 07:48:00,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 319 transitions. [2018-11-10 07:48:00,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 07:48:00,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:00,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:00,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:00,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:00,707 INFO L793 eck$LassoCheckResult]: Stem: 60359#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 60338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 60333#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 60335#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 60358#L44 assume mp_add_~a1~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 60330#L40-1 mp_add_~nb~0 := 4; 60331#L50 assume !(mp_add_~b3~0 % 256 == 0); 60350#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 60351#L61-3 assume true; 60476#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 60475#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 60473#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 60474#L65-2 assume !(mp_add_~i~0 % 256 == 1); 60544#L66-1 assume !(mp_add_~i~0 % 256 == 2); 60344#L67-1 assume !(mp_add_~i~0 % 256 == 3); 60345#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 60599#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 60600#L71-2 assume !(mp_add_~i~0 % 256 == 1); 60609#L72-1 assume !(mp_add_~i~0 % 256 == 2); 60608#L73-1 assume !(mp_add_~i~0 % 256 == 3); 60607#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 60606#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 60605#L80-1 assume !(mp_add_~i~0 % 256 == 1); 60604#L81-1 assume !(mp_add_~i~0 % 256 == 2); 60603#L82-1 assume !(mp_add_~i~0 % 256 == 3); 60602#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 60601#L61-3 assume true; 60352#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 60353#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 60598#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 60597#L71 assume !(mp_add_~i~0 % 256 == 0); 60596#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 60595#L72-1 assume !(mp_add_~i~0 % 256 == 2); 60594#L73-1 assume !(mp_add_~i~0 % 256 == 3); 60593#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 60578#L76-1 assume !(mp_add_~i~0 % 256 == 0); 60577#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 60575#L81-1 assume !(mp_add_~i~0 % 256 == 2); 60573#L82-1 assume !(mp_add_~i~0 % 256 == 3); 60571#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 60569#L61-3 assume true; 60568#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 60567#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 60566#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 60565#L71 assume !(mp_add_~i~0 % 256 == 0); 60564#L71-2 assume !(mp_add_~i~0 % 256 == 1); 60563#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 60562#L73-1 assume !(mp_add_~i~0 % 256 == 3); 60561#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 60560#L76-1 assume !(mp_add_~i~0 % 256 == 0); 60621#L80-1 assume !(mp_add_~i~0 % 256 == 1); 60620#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 60619#L82-1 assume !(mp_add_~i~0 % 256 == 3); 60618#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 60617#L61-3 assume true; 60616#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 60615#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 60614#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 60613#L71 assume !(mp_add_~i~0 % 256 == 0); 60612#L71-2 assume !(mp_add_~i~0 % 256 == 1); 60611#L72-1 assume !(mp_add_~i~0 % 256 == 2); 60545#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 60349#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 60341#L76-1 assume !(mp_add_~i~0 % 256 == 0); 60324#L80-1 assume !(mp_add_~i~0 % 256 == 1); 60325#L81-1 assume !(mp_add_~i~0 % 256 == 2); 60348#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 60329#L83-1 [2018-11-10 07:48:00,707 INFO L795 eck$LassoCheckResult]: Loop: 60329#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 60346#L61-3 assume true; 60347#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 60360#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 60356#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 60332#L71 assume !(mp_add_~i~0 % 256 == 0); 60326#L71-2 assume !(mp_add_~i~0 % 256 == 1); 60327#L72-1 assume !(mp_add_~i~0 % 256 == 2); 60336#L73-1 assume !(mp_add_~i~0 % 256 == 3); 60337#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 60624#L76-1 assume !(mp_add_~i~0 % 256 == 0); 60623#L80-1 assume !(mp_add_~i~0 % 256 == 1); 60622#L81-1 assume !(mp_add_~i~0 % 256 == 2); 60328#L82-1 assume !(mp_add_~i~0 % 256 == 3); 60329#L83-1 [2018-11-10 07:48:00,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1199200319, now seen corresponding path program 1 times [2018-11-10 07:48:00,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:00,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:00,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:00,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 2 times [2018-11-10 07:48:00,737 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:00,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:00,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:00,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:00,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:00,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1043021157, now seen corresponding path program 2 times [2018-11-10 07:48:00,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:00,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:00,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:00,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:00,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 57 proven. 37 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 07:48:01,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:48:01,050 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:48:01,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:48:01,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 07:48:01,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:48:01,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:48:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-10 07:48:01,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:48:01,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-11-10 07:48:01,281 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:48:01,282 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:48:01,282 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:48:01,282 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:48:01,282 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:48:01,282 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:48:01,282 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:48:01,282 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:48:01,282 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration19_Loop [2018-11-10 07:48:01,282 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:48:01,282 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:48:01,283 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-10 07:48:01,293 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-10 07:48:01,418 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:48:01,418 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:48:01,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:48:01,423 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f320e383-64f8-4263-b771-8c24755bdcd2/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:48:01,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:48:01,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:48:03,707 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:48:03,708 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:48:03,708 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:48:03,708 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:48:03,708 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:48:03,709 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:48:03,709 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:48:03,709 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:48:03,709 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:48:03,709 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration19_Loop [2018-11-10 07:48:03,709 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:48:03,709 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:48:03,709 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-10 07:48:03,717 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-10 07:48:03,840 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:48:03,840 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:48:03,841 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-10 07:48:03,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:48:03,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:48:03,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:48:03,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,843 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-10 07:48:03,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:48:03,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:48:03,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:48:03,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,845 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 07:48:03,846 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-10 07:48:03,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:48:03,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,846 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:48:03,847 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:48:03,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,848 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-10 07:48:03,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:48:03,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,849 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:48:03,849 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:48:03,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,852 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 07:48:03,852 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-10 07:48:03,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:48:03,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,853 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:48:03,853 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:48:03,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,854 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-10 07:48:03,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:48:03,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:48:03,856 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:48:03,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,859 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 07:48:03,859 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-10 07:48:03,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:48:03,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,860 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:48:03,861 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:48:03,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,862 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-10 07:48:03,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:48:03,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,863 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:48:03,864 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:48:03,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,868 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 07:48:03,868 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-10 07:48:03,868 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:03,868 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:48:03,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,869 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:48:03,869 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:48:03,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,871 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-10 07:48:03,871 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:03,871 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:48:03,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,872 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:48:03,872 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:48:03,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,879 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 07:48:03,879 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-10 07:48:03,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:03,880 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 07:48:03,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,880 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:48:03,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:48:03,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,883 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-10 07:48:03,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:03,883 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 07:48:03,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,884 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:48:03,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:48:03,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,893 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 07:48:03,893 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-10 07:48:03,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:03,894 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:48:03,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,894 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:48:03,896 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:48:03,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,897 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-10 07:48:03,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:03,898 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:48:03,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,898 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:48:03,900 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:48:03,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,911 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 07:48:03,911 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-10 07:48:03,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:03,911 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:48:03,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,912 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:48:03,913 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:48:03,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,915 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-10 07:48:03,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:03,916 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:48:03,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,916 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:48:03,917 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:48:03,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,922 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 07:48:03,922 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-10 07:48:03,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:03,923 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:48:03,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,923 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 07:48:03,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:48:03,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,928 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-10 07:48:03,929 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:48:03,929 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:48:03,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:48:03,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:48:03,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:48:03,929 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 07:48:03,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:48:03,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:48:03,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:48:03,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 07:48:03,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:48:03,943 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. cyclomatic complexity: 20 Second operand 16 states. [2018-11-10 07:48:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:04,500 INFO L93 Difference]: Finished difference Result 280 states and 296 transitions. [2018-11-10 07:48:04,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:48:04,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 280 states and 296 transitions. [2018-11-10 07:48:04,501 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:48:04,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 280 states to 0 states and 0 transitions. [2018-11-10 07:48:04,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:48:04,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:48:04,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:48:04,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:04,501 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:48:04,501 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:48:04,501 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:48:04,501 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 07:48:04,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:48:04,502 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:48:04,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:48:04,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:48:04 BoogieIcfgContainer [2018-11-10 07:48:04,506 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:48:04,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:48:04,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:48:04,507 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:48:04,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:45:51" (3/4) ... [2018-11-10 07:48:04,510 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:48:04,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:48:04,510 INFO L168 Benchmark]: Toolchain (without parser) took 133954.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.3 MB). Free memory was 960.3 MB in the beginning and 1.2 GB in the end (delta: -284.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:48:04,511 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:48:04,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 945.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:48:04,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.70 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:48:04,511 INFO L168 Benchmark]: Boogie Preprocessor took 54.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -233.6 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:48:04,512 INFO L168 Benchmark]: RCFGBuilder took 220.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:48:04,512 INFO L168 Benchmark]: BuchiAutomizer took 133455.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.9 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -89.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:48:04,512 INFO L168 Benchmark]: Witness Printer took 3.20 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:48:04,515 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 945.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.70 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -233.6 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 220.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 133455.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.9 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -89.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.20 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (19 trivial, 0 deterministic, 0 nondeterministic). 19 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 133.4s and 20 iterations. TraceHistogramMax:9. Analysis of lassos took 40.5s. Construction of modules took 55.1s. Büchi inclusion checks took 37.0s. Highest rank in rank-based complementation 0. Minimization of det autom 19. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 13660 StatesRemovedByMinimization, 17 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 3880 states and ocurred in iteration 13. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 994 SDtfs, 5440 SDslu, 2583 SDs, 0 SdLazy, 8924 SolverSat, 1075 SolverUnsat, 71 SolverUnknown, 0 SolverNotchecked, 55.1s Time LassoAnalysisResults: nont0 unkn0 SFLI11 SFLT0 conc1 concLT0 SILN0 SILU2 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital64 mio100 ax100 hnf96 lsp82 ukn100 mio100 lsp100 div384 bol100 ite100 ukn100 eq145 hnf47 smp67 dnf100 smp100 tf102 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 21ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 13.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...