./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_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:10:29,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:29,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:29,996 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:29,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:29,999 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:30,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:30,003 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:30,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:30,009 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:30,010 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:30,011 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:30,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:30,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:30,020 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:30,021 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:30,021 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:30,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:30,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:30,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:30,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:30,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:30,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:30,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:30,031 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:30,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:30,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:30,035 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:30,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:30,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:30,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:30,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:30,041 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:30,041 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:30,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:30,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:30,043 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:10:30,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:30,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:30,063 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:30,063 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:30,064 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:30,064 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:30,064 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:30,064 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:30,064 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:30,064 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:30,065 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:30,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:30,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:10:30,065 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:30,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:30,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:10:30,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:30,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:30,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:30,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:30,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:10:30,066 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:30,066 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:30,066 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:30,067 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:30,067 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:30,067 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:30,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:30,067 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:30,067 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:30,068 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:30,073 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_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:10:30,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:30,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:30,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:30,134 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:30,135 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:30,135 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-10-27 06:10:30,185 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/bin-2019/uautomizer/data/62f71c1bd/031398acb242441bb902ec6a4de455b7/FLAGa93335344 [2018-10-27 06:10:30,572 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:30,572 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-10-27 06:10:30,579 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/bin-2019/uautomizer/data/62f71c1bd/031398acb242441bb902ec6a4de455b7/FLAGa93335344 [2018-10-27 06:10:30,591 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/bin-2019/uautomizer/data/62f71c1bd/031398acb242441bb902ec6a4de455b7 [2018-10-27 06:10:30,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:30,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:30,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:30,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:30,600 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:30,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb7a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30, skipping insertion in model container [2018-10-27 06:10:30,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:30,638 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:30,785 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:30,788 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:30,827 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:30,837 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:30,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30 WrapperNode [2018-10-27 06:10:30,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:30,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:30,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:30,838 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:30,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:30,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:30,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:30,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:30,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:30,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:30,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:30,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:30,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:10:31,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:31,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:31,578 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:31,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:31 BoogieIcfgContainer [2018-10-27 06:10:31,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:31,579 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:31,579 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:31,583 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:31,583 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:31,584 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:30" (1/3) ... [2018-10-27 06:10:31,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52d70ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:31, skipping insertion in model container [2018-10-27 06:10:31,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:31,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30" (2/3) ... [2018-10-27 06:10:31,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52d70ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:31, skipping insertion in model container [2018-10-27 06:10:31,586 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:31,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:31" (3/3) ... [2018-10-27 06:10:31,588 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-10-27 06:10:31,646 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:31,647 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:31,647 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:31,647 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:31,647 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:31,647 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:31,648 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:31,648 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:31,648 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:31,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-10-27 06:10:31,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-10-27 06:10:31,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:31,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:31,703 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:31,703 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:31,703 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:31,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-10-27 06:10:31,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-10-27 06:10:31,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:31,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:31,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:31,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:31,714 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-10-27 06:10:31,715 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-10-27 06:10:31,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:31,720 INFO L82 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2018-10-27 06:10:31,722 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:31,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:31,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:31,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:31,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:31,865 INFO L82 PathProgramCache]: Analyzing trace with hash -486457291, now seen corresponding path program 1 times [2018-10-27 06:10:31,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:31,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:31,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:31,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:31,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:31,950 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:31,963 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-10-27 06:10:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:32,401 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2018-10-27 06:10:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:32,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2018-10-27 06:10:32,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2018-10-27 06:10:32,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 90 transitions. [2018-10-27 06:10:32,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-10-27 06:10:32,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-10-27 06:10:32,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 90 transitions. [2018-10-27 06:10:32,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:32,415 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-10-27 06:10:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 90 transitions. [2018-10-27 06:10:32,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-10-27 06:10:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-27 06:10:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2018-10-27 06:10:32,439 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-10-27 06:10:32,439 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-10-27 06:10:32,439 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:32,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 88 transitions. [2018-10-27 06:10:32,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-10-27 06:10:32,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:32,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:32,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:32,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:32,444 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-10-27 06:10:32,445 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-10-27 06:10:32,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash -685617854, now seen corresponding path program 1 times [2018-10-27 06:10:32,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:32,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:32,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:32,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:32,741 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-10-27 06:10:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:32,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:32,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:10:32,743 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:32,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:32,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 1 times [2018-10-27 06:10:32,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:32,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:32,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:32,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:32,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:32,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:32,858 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:32,858 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. cyclomatic complexity: 32 Second operand 5 states. [2018-10-27 06:10:33,285 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-27 06:10:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:33,604 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2018-10-27 06:10:33,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:10:33,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 226 transitions. [2018-10-27 06:10:33,608 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 82 [2018-10-27 06:10:33,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 226 transitions. [2018-10-27 06:10:33,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2018-10-27 06:10:33,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2018-10-27 06:10:33,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 226 transitions. [2018-10-27 06:10:33,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:33,611 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 226 transitions. [2018-10-27 06:10:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 226 transitions. [2018-10-27 06:10:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2018-10-27 06:10:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-27 06:10:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2018-10-27 06:10:33,618 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-10-27 06:10:33,618 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-10-27 06:10:33,618 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:33,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 119 transitions. [2018-10-27 06:10:33,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-10-27 06:10:33,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:33,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:33,620 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:33,620 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:33,620 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-10-27 06:10:33,621 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-10-27 06:10:33,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,621 INFO L82 PathProgramCache]: Analyzing trace with hash 959922624, now seen corresponding path program 1 times [2018-10-27 06:10:33,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:33,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:33,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:33,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:33,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:33,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:33,740 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:33,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 2 times [2018-10-27 06:10:33,740 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:33,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:33,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:33,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:33,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:33,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:33,834 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:33,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:10:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:10:33,834 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. cyclomatic complexity: 37 Second operand 6 states. [2018-10-27 06:10:34,458 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 06:10:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:36,420 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2018-10-27 06:10:36,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:10:36,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 344 transitions. [2018-10-27 06:10:36,424 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 176 [2018-10-27 06:10:36,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 344 transitions. [2018-10-27 06:10:36,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2018-10-27 06:10:36,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2018-10-27 06:10:36,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 344 transitions. [2018-10-27 06:10:36,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:36,428 INFO L705 BuchiCegarLoop]: Abstraction has 230 states and 344 transitions. [2018-10-27 06:10:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 344 transitions. [2018-10-27 06:10:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 155. [2018-10-27 06:10:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-27 06:10:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2018-10-27 06:10:36,442 INFO L728 BuchiCegarLoop]: Abstraction has 155 states and 225 transitions. [2018-10-27 06:10:36,442 INFO L608 BuchiCegarLoop]: Abstraction has 155 states and 225 transitions. [2018-10-27 06:10:36,442 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:36,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 225 transitions. [2018-10-27 06:10:36,444 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 103 [2018-10-27 06:10:36,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:36,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:36,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,445 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,445 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-10-27 06:10:36,445 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-10-27 06:10:36,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,446 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 1 times [2018-10-27 06:10:36,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1892987967, now seen corresponding path program 3 times [2018-10-27 06:10:36,508 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:36,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:36,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:10:36,679 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:36,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:36,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:36,679 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. cyclomatic complexity: 74 Second operand 5 states. [2018-10-27 06:10:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:36,902 INFO L93 Difference]: Finished difference Result 261 states and 372 transitions. [2018-10-27 06:10:36,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:10:36,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 372 transitions. [2018-10-27 06:10:36,905 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 209 [2018-10-27 06:10:36,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 261 states and 372 transitions. [2018-10-27 06:10:36,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 261 [2018-10-27 06:10:36,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 261 [2018-10-27 06:10:36,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 261 states and 372 transitions. [2018-10-27 06:10:36,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:36,911 INFO L705 BuchiCegarLoop]: Abstraction has 261 states and 372 transitions. [2018-10-27 06:10:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states and 372 transitions. [2018-10-27 06:10:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 246. [2018-10-27 06:10:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-27 06:10:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 348 transitions. [2018-10-27 06:10:36,934 INFO L728 BuchiCegarLoop]: Abstraction has 246 states and 348 transitions. [2018-10-27 06:10:36,934 INFO L608 BuchiCegarLoop]: Abstraction has 246 states and 348 transitions. [2018-10-27 06:10:36,934 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:10:36,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 348 transitions. [2018-10-27 06:10:36,935 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 194 [2018-10-27 06:10:36,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:36,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:36,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,937 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-10-27 06:10:36,937 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-10-27 06:10:36,937 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-10-27 06:10:36,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,938 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 2 times [2018-10-27 06:10:36,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:36,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1256298437, now seen corresponding path program 1 times [2018-10-27 06:10:36,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:10:37,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:37,261 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:10:37,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:37,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:10:37,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:37,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-10-27 06:10:37,431 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:37,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:10:37,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:10:37,431 INFO L87 Difference]: Start difference. First operand 246 states and 348 transitions. cyclomatic complexity: 106 Second operand 9 states. [2018-10-27 06:10:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:38,170 INFO L93 Difference]: Finished difference Result 372 states and 475 transitions. [2018-10-27 06:10:38,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:10:38,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 475 transitions. [2018-10-27 06:10:38,173 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 288 [2018-10-27 06:10:38,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 372 states and 475 transitions. [2018-10-27 06:10:38,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2018-10-27 06:10:38,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2018-10-27 06:10:38,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 475 transitions. [2018-10-27 06:10:38,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:38,178 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 475 transitions. [2018-10-27 06:10:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 475 transitions. [2018-10-27 06:10:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 243. [2018-10-27 06:10:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-27 06:10:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 324 transitions. [2018-10-27 06:10:38,190 INFO L728 BuchiCegarLoop]: Abstraction has 243 states and 324 transitions. [2018-10-27 06:10:38,190 INFO L608 BuchiCegarLoop]: Abstraction has 243 states and 324 transitions. [2018-10-27 06:10:38,190 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:38,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 324 transitions. [2018-10-27 06:10:38,191 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 191 [2018-10-27 06:10:38,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:38,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:38,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:38,194 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-10-27 06:10:38,194 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-10-27 06:10:38,194 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-10-27 06:10:38,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,195 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 3 times [2018-10-27 06:10:38,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:38,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:38,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:38,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1320919799, now seen corresponding path program 1 times [2018-10-27 06:10:38,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:38,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 06:10:38,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:38,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:10:38,507 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:38,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:10:38,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:10:38,508 INFO L87 Difference]: Start difference. First operand 243 states and 324 transitions. cyclomatic complexity: 85 Second operand 4 states. [2018-10-27 06:10:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:38,879 INFO L93 Difference]: Finished difference Result 457 states and 602 transitions. [2018-10-27 06:10:38,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:10:38,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 457 states and 602 transitions. [2018-10-27 06:10:38,885 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 397 [2018-10-27 06:10:38,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 457 states to 457 states and 602 transitions. [2018-10-27 06:10:38,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 457 [2018-10-27 06:10:38,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 457 [2018-10-27 06:10:38,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 457 states and 602 transitions. [2018-10-27 06:10:38,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:38,891 INFO L705 BuchiCegarLoop]: Abstraction has 457 states and 602 transitions. [2018-10-27 06:10:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states and 602 transitions. [2018-10-27 06:10:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 326. [2018-10-27 06:10:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-27 06:10:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 447 transitions. [2018-10-27 06:10:38,906 INFO L728 BuchiCegarLoop]: Abstraction has 326 states and 447 transitions. [2018-10-27 06:10:38,906 INFO L608 BuchiCegarLoop]: Abstraction has 326 states and 447 transitions. [2018-10-27 06:10:38,906 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:38,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 447 transitions. [2018-10-27 06:10:38,908 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 274 [2018-10-27 06:10:38,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:38,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:38,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:38,918 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-10-27 06:10:38,919 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-10-27 06:10:38,919 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-10-27 06:10:38,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 4 times [2018-10-27 06:10:38,919 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:38,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:38,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:38,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,951 INFO L82 PathProgramCache]: Analyzing trace with hash 110244339, now seen corresponding path program 1 times [2018-10-27 06:10:38,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:38,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:38,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:38,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:39,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:39,304 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:10:39,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:39,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:10:39,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-10-27 06:10:39,609 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:39,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:10:39,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:10:39,610 INFO L87 Difference]: Start difference. First operand 326 states and 447 transitions. cyclomatic complexity: 125 Second operand 7 states. [2018-10-27 06:10:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:39,990 INFO L93 Difference]: Finished difference Result 479 states and 631 transitions. [2018-10-27 06:10:39,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:10:39,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 479 states and 631 transitions. [2018-10-27 06:10:39,993 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 407 [2018-10-27 06:10:39,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 479 states to 479 states and 631 transitions. [2018-10-27 06:10:39,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 479 [2018-10-27 06:10:39,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 479 [2018-10-27 06:10:39,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 479 states and 631 transitions. [2018-10-27 06:10:39,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:39,997 INFO L705 BuchiCegarLoop]: Abstraction has 479 states and 631 transitions. [2018-10-27 06:10:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states and 631 transitions. [2018-10-27 06:10:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 331. [2018-10-27 06:10:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-27 06:10:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 451 transitions. [2018-10-27 06:10:40,004 INFO L728 BuchiCegarLoop]: Abstraction has 331 states and 451 transitions. [2018-10-27 06:10:40,004 INFO L608 BuchiCegarLoop]: Abstraction has 331 states and 451 transitions. [2018-10-27 06:10:40,004 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:10:40,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331 states and 451 transitions. [2018-10-27 06:10:40,006 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 278 [2018-10-27 06:10:40,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:40,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:40,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:40,007 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-10-27 06:10:40,007 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-10-27 06:10:40,007 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-10-27 06:10:40,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 5 times [2018-10-27 06:10:40,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:40,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:40,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:40,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash 927892789, now seen corresponding path program 2 times [2018-10-27 06:10:40,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:40,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:40,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:40,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 06:10:40,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:40,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:10:40,197 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:40,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:40,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:40,197 INFO L87 Difference]: Start difference. First operand 331 states and 451 transitions. cyclomatic complexity: 124 Second operand 5 states. [2018-10-27 06:10:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:40,817 INFO L93 Difference]: Finished difference Result 670 states and 950 transitions. [2018-10-27 06:10:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:10:40,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 950 transitions. [2018-10-27 06:10:40,822 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 591 [2018-10-27 06:10:40,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 670 states and 950 transitions. [2018-10-27 06:10:40,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 670 [2018-10-27 06:10:40,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 670 [2018-10-27 06:10:40,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 670 states and 950 transitions. [2018-10-27 06:10:40,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:40,828 INFO L705 BuchiCegarLoop]: Abstraction has 670 states and 950 transitions. [2018-10-27 06:10:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states and 950 transitions. [2018-10-27 06:10:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 531. [2018-10-27 06:10:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-10-27 06:10:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 783 transitions. [2018-10-27 06:10:40,841 INFO L728 BuchiCegarLoop]: Abstraction has 531 states and 783 transitions. [2018-10-27 06:10:40,841 INFO L608 BuchiCegarLoop]: Abstraction has 531 states and 783 transitions. [2018-10-27 06:10:40,841 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:10:40,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 531 states and 783 transitions. [2018-10-27 06:10:40,845 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 470 [2018-10-27 06:10:40,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:40,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:40,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:40,847 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-10-27 06:10:40,847 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-10-27 06:10:40,847 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-10-27 06:10:40,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 6 times [2018-10-27 06:10:40,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:40,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,875 INFO L82 PathProgramCache]: Analyzing trace with hash -625713779, now seen corresponding path program 1 times [2018-10-27 06:10:40,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:40,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:40,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:40,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 82 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 06:10:41,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:41,020 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:10:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:41,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-27 06:10:41,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:10:41,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-10-27 06:10:41,287 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:41,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:10:41,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:10:41,288 INFO L87 Difference]: Start difference. First operand 531 states and 783 transitions. cyclomatic complexity: 256 Second operand 8 states. [2018-10-27 06:10:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:43,200 INFO L93 Difference]: Finished difference Result 1479 states and 2081 transitions. [2018-10-27 06:10:43,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 06:10:43,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1479 states and 2081 transitions. [2018-10-27 06:10:43,209 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1342 [2018-10-27 06:10:43,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1479 states to 1445 states and 2047 transitions. [2018-10-27 06:10:43,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1445 [2018-10-27 06:10:43,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1445 [2018-10-27 06:10:43,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1445 states and 2047 transitions. [2018-10-27 06:10:43,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:43,224 INFO L705 BuchiCegarLoop]: Abstraction has 1445 states and 2047 transitions. [2018-10-27 06:10:43,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states and 2047 transitions. [2018-10-27 06:10:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1346. [2018-10-27 06:10:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2018-10-27 06:10:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1929 transitions. [2018-10-27 06:10:43,253 INFO L728 BuchiCegarLoop]: Abstraction has 1346 states and 1929 transitions. [2018-10-27 06:10:43,253 INFO L608 BuchiCegarLoop]: Abstraction has 1346 states and 1929 transitions. [2018-10-27 06:10:43,253 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:10:43,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1346 states and 1929 transitions. [2018-10-27 06:10:43,261 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1278 [2018-10-27 06:10:43,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:43,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:43,263 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:43,266 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-10-27 06:10:43,266 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-10-27 06:10:43,266 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-10-27 06:10:43,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:43,267 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 7 times [2018-10-27 06:10:43,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:43,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:43,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:43,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:43,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:43,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1313734941, now seen corresponding path program 1 times [2018-10-27 06:10:43,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:43,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 83 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-27 06:10:43,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:43,593 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:10:43,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:43,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 110 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 06:10:44,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:44,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2018-10-27 06:10:44,730 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:44,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:10:44,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:10:44,730 INFO L87 Difference]: Start difference. First operand 1346 states and 1929 transitions. cyclomatic complexity: 591 Second operand 10 states. [2018-10-27 06:10:45,583 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 06:10:46,114 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-10-27 06:10:46,503 WARN L179 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-10-27 06:10:51,287 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-10-27 06:10:57,039 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-10-27 06:11:11,214 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-10-27 06:11:13,423 WARN L179 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:11:15,053 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 06:11:19,564 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-27 06:11:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:34,835 INFO L93 Difference]: Finished difference Result 3885 states and 5127 transitions. [2018-10-27 06:11:34,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-27 06:11:34,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3885 states and 5127 transitions. [2018-10-27 06:11:34,852 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 3330 [2018-10-27 06:11:34,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3885 states to 3819 states and 5056 transitions. [2018-10-27 06:11:34,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3819 [2018-10-27 06:11:34,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3819 [2018-10-27 06:11:34,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3819 states and 5056 transitions. [2018-10-27 06:11:34,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:34,880 INFO L705 BuchiCegarLoop]: Abstraction has 3819 states and 5056 transitions. [2018-10-27 06:11:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3819 states and 5056 transitions. [2018-10-27 06:11:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3819 to 2184. [2018-10-27 06:11:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2018-10-27 06:11:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2941 transitions. [2018-10-27 06:11:34,928 INFO L728 BuchiCegarLoop]: Abstraction has 2184 states and 2941 transitions. [2018-10-27 06:11:34,928 INFO L608 BuchiCegarLoop]: Abstraction has 2184 states and 2941 transitions. [2018-10-27 06:11:34,929 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:11:34,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2184 states and 2941 transitions. [2018-10-27 06:11:34,938 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1974 [2018-10-27 06:11:34,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:34,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:34,939 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:34,939 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-10-27 06:11:34,939 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-10-27 06:11:34,939 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-10-27 06:11:34,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash -363513735, now seen corresponding path program 1 times [2018-10-27 06:11:34,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:34,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:34,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:35,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:35,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 06:11:35,098 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:35,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash 992049913, now seen corresponding path program 1 times [2018-10-27 06:11:35,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:35,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:35,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:35,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-27 06:11:35,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:35,317 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:11:35,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:35,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 96 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 06:11:47,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:47,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-10-27 06:11:47,443 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:47,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:11:47,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:11:47,443 INFO L87 Difference]: Start difference. First operand 2184 states and 2941 transitions. cyclomatic complexity: 771 Second operand 8 states. [2018-10-27 06:11:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:49,763 INFO L93 Difference]: Finished difference Result 4991 states and 6615 transitions. [2018-10-27 06:11:49,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:11:49,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4991 states and 6615 transitions. [2018-10-27 06:11:49,782 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 4364 [2018-10-27 06:11:49,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4991 states to 4952 states and 6566 transitions. [2018-10-27 06:11:49,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4952 [2018-10-27 06:11:49,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4952 [2018-10-27 06:11:49,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4952 states and 6566 transitions. [2018-10-27 06:11:49,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:49,813 INFO L705 BuchiCegarLoop]: Abstraction has 4952 states and 6566 transitions. [2018-10-27 06:11:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4952 states and 6566 transitions. [2018-10-27 06:11:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4952 to 3120. [2018-10-27 06:11:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2018-10-27 06:11:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 4183 transitions. [2018-10-27 06:11:49,878 INFO L728 BuchiCegarLoop]: Abstraction has 3120 states and 4183 transitions. [2018-10-27 06:11:49,879 INFO L608 BuchiCegarLoop]: Abstraction has 3120 states and 4183 transitions. [2018-10-27 06:11:49,879 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:11:49,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3120 states and 4183 transitions. [2018-10-27 06:11:49,891 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 2761 [2018-10-27 06:11:49,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:49,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:49,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:49,892 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-10-27 06:11:49,892 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-10-27 06:11:49,894 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-10-27 06:11:49,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2138521097, now seen corresponding path program 1 times [2018-10-27 06:11:49,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:49,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:49,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:49,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:50,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:50,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 06:11:50,182 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:50,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash 638961531, now seen corresponding path program 2 times [2018-10-27 06:11:50,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:50,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:50,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-27 06:11:50,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:50,385 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:11:50,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:11:50,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:11:50,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:50,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 96 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 06:11:50,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:50,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-10-27 06:11:50,521 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:11:50,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:11:50,521 INFO L87 Difference]: Start difference. First operand 3120 states and 4183 transitions. cyclomatic complexity: 1086 Second operand 8 states. [2018-10-27 06:11:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:52,178 INFO L93 Difference]: Finished difference Result 3693 states and 4856 transitions. [2018-10-27 06:11:52,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:11:52,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3693 states and 4856 transitions. [2018-10-27 06:11:52,187 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 3136 [2018-10-27 06:11:52,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3693 states to 3672 states and 4827 transitions. [2018-10-27 06:11:52,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3672 [2018-10-27 06:11:52,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3672 [2018-10-27 06:11:52,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3672 states and 4827 transitions. [2018-10-27 06:11:52,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:52,209 INFO L705 BuchiCegarLoop]: Abstraction has 3672 states and 4827 transitions. [2018-10-27 06:11:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states and 4827 transitions. [2018-10-27 06:11:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3194. [2018-10-27 06:11:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2018-10-27 06:11:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4264 transitions. [2018-10-27 06:11:52,266 INFO L728 BuchiCegarLoop]: Abstraction has 3194 states and 4264 transitions. [2018-10-27 06:11:52,266 INFO L608 BuchiCegarLoop]: Abstraction has 3194 states and 4264 transitions. [2018-10-27 06:11:52,266 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:11:52,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3194 states and 4264 transitions. [2018-10-27 06:11:52,275 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 2840 [2018-10-27 06:11:52,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:52,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:52,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:52,277 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-10-27 06:11:52,277 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-10-27 06:11:52,278 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-10-27 06:11:52,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:52,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2138521123, now seen corresponding path program 1 times [2018-10-27 06:11:52,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:52,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:52,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:52,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:52,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:52,297 INFO L82 PathProgramCache]: Analyzing trace with hash -159596241, now seen corresponding path program 1 times [2018-10-27 06:11:52,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:52,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:52,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:52,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 56 proven. 58 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 06:11:52,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:52,431 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:11:52,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:52,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 88 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 06:11:52,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:52,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-10-27 06:11:52,534 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:52,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 06:11:52,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-27 06:11:52,534 INFO L87 Difference]: Start difference. First operand 3194 states and 4264 transitions. cyclomatic complexity: 1094 Second operand 12 states. [2018-10-27 06:11:57,036 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-10-27 06:12:09,119 WARN L179 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2018-10-27 06:12:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:22,501 INFO L93 Difference]: Finished difference Result 7526 states and 9531 transitions. [2018-10-27 06:12:22,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-27 06:12:22,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7526 states and 9531 transitions. [2018-10-27 06:12:22,523 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 5929 [2018-10-27 06:12:22,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7526 states to 7441 states and 9444 transitions. [2018-10-27 06:12:22,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7441 [2018-10-27 06:12:22,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7441 [2018-10-27 06:12:22,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7441 states and 9444 transitions. [2018-10-27 06:12:22,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:22,572 INFO L705 BuchiCegarLoop]: Abstraction has 7441 states and 9444 transitions. [2018-10-27 06:12:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7441 states and 9444 transitions. [2018-10-27 06:12:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7441 to 3880. [2018-10-27 06:12:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3880 states. [2018-10-27 06:12:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 5142 transitions. [2018-10-27 06:12:22,666 INFO L728 BuchiCegarLoop]: Abstraction has 3880 states and 5142 transitions. [2018-10-27 06:12:22,666 INFO L608 BuchiCegarLoop]: Abstraction has 3880 states and 5142 transitions. [2018-10-27 06:12:22,666 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:12:22,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3880 states and 5142 transitions. [2018-10-27 06:12:22,679 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 3562 [2018-10-27 06:12:22,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:22,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:22,680 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:22,680 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-10-27 06:12:22,682 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-10-27 06:12:22,683 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-10-27 06:12:22,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2138521123, now seen corresponding path program 2 times [2018-10-27 06:12:22,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:22,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:22,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1689900615, now seen corresponding path program 1 times [2018-10-27 06:12:22,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:22,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:22,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:22,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 112 proven. 172 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 06:12:22,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:22,985 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:12:22,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:23,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:23,590 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 06:12:23,840 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-27 06:12:24,348 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 06:12:24,605 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 06:12:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 154 proven. 12 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-10-27 06:12:25,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:12:25,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-10-27 06:12:25,601 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 06:12:25,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=195, Unknown=4, NotChecked=0, Total=272 [2018-10-27 06:12:25,601 INFO L87 Difference]: Start difference. First operand 3880 states and 5142 transitions. cyclomatic complexity: 1285 Second operand 17 states. [2018-10-27 06:12:28,463 WARN L179 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-27 06:12:29,324 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2018-10-27 06:12:30,191 WARN L179 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2018-10-27 06:12:31,061 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 22 [2018-10-27 06:12:32,135 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 19 [2018-10-27 06:12:32,357 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 23 [2018-10-27 06:12:33,019 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2018-10-27 06:12:35,522 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-10-27 06:12:35,935 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2018-10-27 06:12:37,505 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 51 DAG size of output: 19 [2018-10-27 06:12:39,067 WARN L179 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-10-27 06:12:40,833 WARN L179 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-10-27 06:12:45,116 WARN L179 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-10-27 06:12:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:45,130 INFO L93 Difference]: Finished difference Result 5641 states and 6737 transitions. [2018-10-27 06:12:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 06:12:45,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5641 states and 6737 transitions. [2018-10-27 06:12:45,147 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 3693 [2018-10-27 06:12:45,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5641 states to 5362 states and 6113 transitions. [2018-10-27 06:12:45,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5362 [2018-10-27 06:12:45,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5362 [2018-10-27 06:12:45,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5362 states and 6113 transitions. [2018-10-27 06:12:45,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:45,175 INFO L705 BuchiCegarLoop]: Abstraction has 5362 states and 6113 transitions. [2018-10-27 06:12:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states and 6113 transitions. [2018-10-27 06:12:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 2431. [2018-10-27 06:12:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2431 states. [2018-10-27 06:12:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3027 transitions. [2018-10-27 06:12:45,224 INFO L728 BuchiCegarLoop]: Abstraction has 2431 states and 3027 transitions. [2018-10-27 06:12:45,224 INFO L608 BuchiCegarLoop]: Abstraction has 2431 states and 3027 transitions. [2018-10-27 06:12:45,224 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:12:45,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2431 states and 3027 transitions. [2018-10-27 06:12:45,233 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 2163 [2018-10-27 06:12:45,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:45,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:45,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:45,234 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-10-27 06:12:45,234 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-10-27 06:12:45,235 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-10-27 06:12:45,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:45,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1131542760, now seen corresponding path program 1 times [2018-10-27 06:12:45,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:45,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:45,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:45,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:45,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:45,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:45,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:45,374 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:12:45,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:45,374 INFO L82 PathProgramCache]: Analyzing trace with hash 808760997, now seen corresponding path program 1 times [2018-10-27 06:12:45,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:45,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:45,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:45,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:45,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 263 proven. 185 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 06:12:46,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:46,525 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:12:46,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:46,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 115 proven. 99 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-10-27 06:12:52,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:12:52,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2018-10-27 06:12:52,956 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:52,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:52,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:52,956 INFO L87 Difference]: Start difference. First operand 2431 states and 3027 transitions. cyclomatic complexity: 609 Second operand 3 states. [2018-10-27 06:12:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:52,962 INFO L93 Difference]: Finished difference Result 2113 states and 2631 transitions. [2018-10-27 06:12:52,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:52,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2113 states and 2631 transitions. [2018-10-27 06:12:52,968 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1918 [2018-10-27 06:12:52,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2113 states to 2113 states and 2631 transitions. [2018-10-27 06:12:52,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2113 [2018-10-27 06:12:52,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2113 [2018-10-27 06:12:52,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2113 states and 2631 transitions. [2018-10-27 06:12:52,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:52,980 INFO L705 BuchiCegarLoop]: Abstraction has 2113 states and 2631 transitions. [2018-10-27 06:12:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states and 2631 transitions. [2018-10-27 06:12:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2113. [2018-10-27 06:12:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2018-10-27 06:12:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2631 transitions. [2018-10-27 06:12:53,008 INFO L728 BuchiCegarLoop]: Abstraction has 2113 states and 2631 transitions. [2018-10-27 06:12:53,008 INFO L608 BuchiCegarLoop]: Abstraction has 2113 states and 2631 transitions. [2018-10-27 06:12:53,008 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-10-27 06:12:53,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2113 states and 2631 transitions. [2018-10-27 06:12:53,015 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1918 [2018-10-27 06:12:53,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:53,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:53,018 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-10-27 06:12:53,018 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-10-27 06:12:53,018 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-10-27 06:12:53,019 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-10-27 06:12:53,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1001408861, now seen corresponding path program 1 times [2018-10-27 06:12:53,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:53,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:53,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:53,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:53,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:53,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash -691355045, now seen corresponding path program 2 times [2018-10-27 06:12:53,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:53,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 283 proven. 185 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 06:13:09,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:09,822 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:13:09,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:13:09,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:13:09,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:09,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:10,093 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-10-27 06:13:11,115 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 06:13:11,675 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 06:13:11,977 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 06:13:12,285 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 06:13:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 1 not checked. [2018-10-27 06:13:12,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:12,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-10-27 06:13:12,429 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:13:12,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 06:13:12,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=203, Unknown=5, NotChecked=30, Total=306 [2018-10-27 06:13:12,429 INFO L87 Difference]: Start difference. First operand 2113 states and 2631 transitions. cyclomatic complexity: 529 Second operand 18 states. [2018-10-27 06:13:13,114 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 06:13:13,794 WARN L179 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-27 06:13:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:20,454 INFO L93 Difference]: Finished difference Result 2706 states and 2842 transitions. [2018-10-27 06:13:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 06:13:20,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2706 states and 2842 transitions. [2018-10-27 06:13:20,463 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 250 [2018-10-27 06:13:20,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2706 states to 2645 states and 2768 transitions. [2018-10-27 06:13:20,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2645 [2018-10-27 06:13:20,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2645 [2018-10-27 06:13:20,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2645 states and 2768 transitions. [2018-10-27 06:13:20,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:13:20,476 INFO L705 BuchiCegarLoop]: Abstraction has 2645 states and 2768 transitions. [2018-10-27 06:13:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states and 2768 transitions. [2018-10-27 06:13:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 524. [2018-10-27 06:13:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-27 06:13:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 577 transitions. [2018-10-27 06:13:20,490 INFO L728 BuchiCegarLoop]: Abstraction has 524 states and 577 transitions. [2018-10-27 06:13:20,490 INFO L608 BuchiCegarLoop]: Abstraction has 524 states and 577 transitions. [2018-10-27 06:13:20,490 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-10-27 06:13:20,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 524 states and 577 transitions. [2018-10-27 06:13:20,492 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2018-10-27 06:13:20,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:20,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:20,496 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-10-27 06:13:20,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:20,497 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-10-27 06:13:20,497 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-10-27 06:13:20,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:20,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1480154629, now seen corresponding path program 1 times [2018-10-27 06:13:20,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:20,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:20,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 06:13:20,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:20,683 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:13:20,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:20,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:13:20,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:20,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-10-27 06:13:20,767 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:20,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:20,768 INFO L82 PathProgramCache]: Analyzing trace with hash -461293119, now seen corresponding path program 1 times [2018-10-27 06:13:20,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:20,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:20,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:20,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:20,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:20,847 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:20,848 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:20,848 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:20,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:20,848 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:13:20,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:20,848 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:20,848 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:20,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration17_Loop [2018-10-27 06:13:20,849 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:20,849 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:20,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:21,056 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:21,057 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:13:21,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:13:21,065 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:13:21,121 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:13:21,121 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:13:22,322 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:13:22,324 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:22,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:22,324 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:22,324 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:22,325 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:13:22,325 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:22,325 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:22,325 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:22,325 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration17_Loop [2018-10-27 06:13:22,325 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:22,325 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:22,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:22,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:22,622 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2018-10-27 06:13:22,685 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:22,689 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:22,690 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-10-27 06:13:22,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:22,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:22,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:22,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,700 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-10-27 06:13:22,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:22,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:22,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:22,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,702 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:13:22,703 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-10-27 06:13:22,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:22,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,704 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:22,712 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:22,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,718 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-10-27 06:13:22,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:22,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,718 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:22,719 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:22,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,733 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:13:22,733 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-10-27 06:13:22,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:22,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,734 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:22,736 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:22,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,750 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-10-27 06:13:22,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:22,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,752 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:22,753 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:22,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,755 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:13:22,755 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-10-27 06:13:22,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:22,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,756 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:22,758 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:22,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,766 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-10-27 06:13:22,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:22,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,767 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:22,768 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:22,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,769 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:13:22,770 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-10-27 06:13:22,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:22,770 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:22,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,771 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:22,775 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:22,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,786 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-10-27 06:13:22,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:22,787 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:22,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,787 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:22,789 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:22,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,790 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:13:22,791 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-10-27 06:13:22,791 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:22,791 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:13:22,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,792 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:22,797 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:22,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,811 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-10-27 06:13:22,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:22,812 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:13:22,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,812 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:22,814 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:22,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,817 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:13:22,817 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-10-27 06:13:22,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:22,818 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:22,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,818 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:22,824 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:22,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,838 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-10-27 06:13:22,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:22,849 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:22,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,849 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:22,852 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:22,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,854 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:13:22,855 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-10-27 06:13:22,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:22,855 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:22,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,856 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:22,858 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:22,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,872 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-10-27 06:13:22,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:22,872 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:22,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,874 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:22,875 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:22,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,879 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:13:22,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-10-27 06:13:22,880 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:22,880 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:22,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,880 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:13:22,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:22,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,936 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-10-27 06:13:22,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:22,936 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:22,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:22,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:22,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:22,937 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:13:22,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:22,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:22,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:22,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:13:22,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:13:22,947 INFO L87 Difference]: Start difference. First operand 524 states and 577 transitions. cyclomatic complexity: 56 Second operand 10 states. [2018-10-27 06:13:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:24,261 INFO L93 Difference]: Finished difference Result 520 states and 553 transitions. [2018-10-27 06:13:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 06:13:24,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 520 states and 553 transitions. [2018-10-27 06:13:24,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 69 [2018-10-27 06:13:24,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 520 states to 506 states and 539 transitions. [2018-10-27 06:13:24,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 506 [2018-10-27 06:13:24,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 506 [2018-10-27 06:13:24,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 506 states and 539 transitions. [2018-10-27 06:13:24,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:13:24,265 INFO L705 BuchiCegarLoop]: Abstraction has 506 states and 539 transitions. [2018-10-27 06:13:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 539 transitions. [2018-10-27 06:13:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 359. [2018-10-27 06:13:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-27 06:13:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 386 transitions. [2018-10-27 06:13:24,274 INFO L728 BuchiCegarLoop]: Abstraction has 359 states and 386 transitions. [2018-10-27 06:13:24,274 INFO L608 BuchiCegarLoop]: Abstraction has 359 states and 386 transitions. [2018-10-27 06:13:24,274 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-10-27 06:13:24,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 359 states and 386 transitions. [2018-10-27 06:13:24,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2018-10-27 06:13:24,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:24,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:24,276 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-10-27 06:13:24,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:24,276 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-10-27 06:13:24,276 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-10-27 06:13:24,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash -634732666, now seen corresponding path program 1 times [2018-10-27 06:13:24,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:24,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:24,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:24,613 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-27 06:13:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 06:13:24,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:24,772 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:13:24,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:24,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 06:13:25,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:25,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-10-27 06:13:25,100 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:25,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1054624155, now seen corresponding path program 1 times [2018-10-27 06:13:25,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:25,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:25,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:25,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:25,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:25,195 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:25,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:25,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:25,195 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:25,195 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:13:25,195 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:25,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:25,196 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:25,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration18_Loop [2018-10-27 06:13:25,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:25,196 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:25,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:25,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:25,338 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:25,338 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:13:25,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:13:25,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:13:25,348 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:13:25,348 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_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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) [2018-10-27 06:13:25,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:13:25,388 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:13:25,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:13:25,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:13:35,950 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:13:35,952 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:35,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:35,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:35,953 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:35,953 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:13:35,953 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:35,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:35,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:35,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration18_Loop [2018-10-27 06:13:35,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:35,953 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:35,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:35,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,224 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2018-10-27 06:13:36,268 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:36,268 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:36,268 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-10-27 06:13:36,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:36,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:36,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:36,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,271 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-10-27 06:13:36,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:36,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:36,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:36,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,281 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:13:36,281 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-10-27 06:13:36,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:36,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,282 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:36,283 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:36,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,284 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-10-27 06:13:36,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:36,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,301 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:36,302 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:36,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,306 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:13:36,306 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-10-27 06:13:36,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:36,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,307 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:36,308 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:36,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,317 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-10-27 06:13:36,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:36,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,318 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:36,319 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:36,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,325 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:13:36,328 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-10-27 06:13:36,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:36,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,329 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:36,330 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:36,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,331 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-10-27 06:13:36,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:36,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,332 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:36,346 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:36,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,355 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:13:36,355 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-10-27 06:13:36,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:36,356 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:36,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,356 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:36,357 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:36,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,359 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-10-27 06:13:36,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:36,359 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:36,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,360 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:36,369 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:36,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,380 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:13:36,381 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-10-27 06:13:36,381 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:36,382 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:13:36,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,382 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:36,383 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:36,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,397 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-10-27 06:13:36,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:36,398 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:13:36,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,398 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:36,401 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:36,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,411 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:13:36,412 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-10-27 06:13:36,412 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:36,412 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:36,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,413 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:36,415 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:36,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,416 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-10-27 06:13:36,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:36,417 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:36,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,418 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:36,429 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:36,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,466 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:13:36,466 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-10-27 06:13:36,466 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:36,467 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:36,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,475 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:36,475 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:36,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,479 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-10-27 06:13:36,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:36,480 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:36,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,480 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:36,484 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:36,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,500 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:13:36,500 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-10-27 06:13:36,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:36,502 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:36,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,502 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:13:36,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:36,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,515 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-10-27 06:13:36,515 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:36,516 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:36,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:36,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:36,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:36,516 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:13:36,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:36,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:36,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:13:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:13:36,556 INFO L87 Difference]: Start difference. First operand 359 states and 386 transitions. cyclomatic complexity: 30 Second operand 10 states. [2018-10-27 06:13:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:37,928 INFO L93 Difference]: Finished difference Result 457 states and 477 transitions. [2018-10-27 06:13:37,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:13:37,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 457 states and 477 transitions. [2018-10-27 06:13:37,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-10-27 06:13:37,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 457 states to 449 states and 469 transitions. [2018-10-27 06:13:37,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2018-10-27 06:13:37,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2018-10-27 06:13:37,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 449 states and 469 transitions. [2018-10-27 06:13:37,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:13:37,932 INFO L705 BuchiCegarLoop]: Abstraction has 449 states and 469 transitions. [2018-10-27 06:13:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states and 469 transitions. [2018-10-27 06:13:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 301. [2018-10-27 06:13:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-27 06:13:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2018-10-27 06:13:37,944 INFO L728 BuchiCegarLoop]: Abstraction has 301 states and 319 transitions. [2018-10-27 06:13:37,944 INFO L608 BuchiCegarLoop]: Abstraction has 301 states and 319 transitions. [2018-10-27 06:13:37,944 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-10-27 06:13:37,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 319 transitions. [2018-10-27 06:13:37,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-10-27 06:13:37,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:37,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:37,946 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-10-27 06:13:37,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:37,946 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-10-27 06:13:37,946 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-10-27 06:13:37,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1199200319, now seen corresponding path program 1 times [2018-10-27 06:13:37,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:37,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:37,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:37,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:38,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:38,001 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 2 times [2018-10-27 06:13:38,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:38,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:38,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:38,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:38,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:38,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1043021157, now seen corresponding path program 2 times [2018-10-27 06:13:38,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:38,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:38,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:38,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:38,635 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-10-27 06:13:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 57 proven. 37 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-27 06:13:38,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:38,895 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:13:38,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:13:38,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 06:13:38,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:38,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-27 06:13:39,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:39,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-10-27 06:13:39,260 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-10-27 06:13:39,334 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:39,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:39,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:39,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:39,335 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:13:39,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:39,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:39,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:39,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration19_Loop [2018-10-27 06:13:39,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:39,335 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:39,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:39,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:39,476 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-10-27 06:13:39,675 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 06:13:39,688 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:39,688 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:13:39,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:13:39,692 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb20ac6-7917-444a-b03a-ad5a35ee1b8b/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-10-27 06:13:39,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:13:39,747 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:13:42,435 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:13:42,437 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:42,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:42,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:42,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:42,438 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:13:42,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:42,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:42,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:42,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration19_Loop [2018-10-27 06:13:42,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:42,438 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:42,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:42,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:42,676 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:42,676 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:42,677 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-10-27 06:13:42,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:42,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:42,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:42,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,680 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-10-27 06:13:42,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:42,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:42,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:42,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,698 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:13:42,698 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-10-27 06:13:42,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:42,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,699 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:42,699 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:42,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,703 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-10-27 06:13:42,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:42,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,704 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:42,704 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:42,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,708 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:13:42,708 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-10-27 06:13:42,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:42,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,725 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:42,725 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:42,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,727 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-10-27 06:13:42,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:42,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,728 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:42,728 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:42,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,735 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:13:42,735 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-10-27 06:13:42,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:42,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,736 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:42,736 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:42,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,753 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-10-27 06:13:42,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:42,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,754 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:42,755 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:42,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,760 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:13:42,761 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-10-27 06:13:42,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:42,761 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:42,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,762 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:42,762 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:42,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,764 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-10-27 06:13:42,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:42,776 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:42,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,777 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:13:42,778 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:13:42,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,794 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:13:42,794 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-10-27 06:13:42,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:42,795 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:13:42,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,796 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:42,797 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:42,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,799 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,799 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-10-27 06:13:42,799 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:42,800 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:13:42,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,800 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:42,802 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:42,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,821 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:13:42,821 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-10-27 06:13:42,822 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:42,822 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:42,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:42,824 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:42,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,836 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-10-27 06:13:42,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:42,837 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:42,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,837 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:13:42,840 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:13:42,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,861 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:13:42,861 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-10-27 06:13:42,861 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:42,862 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:42,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,862 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:42,863 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:42,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,878 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-10-27 06:13:42,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:42,879 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:13:42,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,879 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:13:42,880 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:13:42,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,894 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:13:42,895 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-10-27 06:13:42,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:42,895 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:42,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,896 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:13:42,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:42,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,903 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-10-27 06:13:42,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:13:42,903 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:13:42,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:42,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:42,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:42,904 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:13:42,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:42,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:42,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:42,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 06:13:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-10-27 06:13:42,931 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. cyclomatic complexity: 20 Second operand 16 states. [2018-10-27 06:13:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:44,223 INFO L93 Difference]: Finished difference Result 280 states and 296 transitions. [2018-10-27 06:13:44,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:13:44,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 280 states and 296 transitions. [2018-10-27 06:13:44,226 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:13:44,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 280 states to 0 states and 0 transitions. [2018-10-27 06:13:44,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:13:44,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:13:44,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:13:44,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:13:44,226 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:44,226 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:44,226 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:44,227 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-10-27 06:13:44,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:13:44,227 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:13:44,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:13:44,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:13:44 BoogieIcfgContainer [2018-10-27 06:13:44,235 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:13:44,235 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:13:44,235 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:13:44,236 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:13:44,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:31" (3/4) ... [2018-10-27 06:13:44,243 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:13:44,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:13:44,244 INFO L168 Benchmark]: Toolchain (without parser) took 193649.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 954.4 MB in the beginning and 1.0 GB in the end (delta: -56.0 MB). Peak memory consumption was 231.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:44,244 INFO L168 Benchmark]: CDTParser took 1.54 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:13:44,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.99 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:44,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.21 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:13:44,245 INFO L168 Benchmark]: Boogie Preprocessor took 20.55 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:44,246 INFO L168 Benchmark]: RCFGBuilder took 688.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:44,246 INFO L168 Benchmark]: BuchiAutomizer took 192656.26 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.4 MB). Peak memory consumption was 250.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:44,247 INFO L168 Benchmark]: Witness Printer took 7.39 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:13:44,253 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.54 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.99 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.21 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.55 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 688.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 192656.26 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.4 MB). Peak memory consumption was 250.2 MB. Max. memory is 11.5 GB. * Witness Printer took 7.39 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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 192.6s and 20 iterations. TraceHistogramMax:9. Analysis of lassos took 67.8s. Construction of modules took 68.8s. Büchi inclusion checks took 54.7s. Highest rank in rank-based complementation 0. Minimization of det autom 19. Minimization of nondet autom 0. Automata minimization 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 13660 StatesRemovedByMinimization, 17 NontrivialMinimizations. Non-live state removal took 0.2s 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, 5442 SDslu, 2583 SDs, 0 SdLazy, 8927 SolverSat, 1075 SolverUnsat, 73 SolverUnknown, 0 SolverNotchecked, 68.8s 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: 55ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 14.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...