./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/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 a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:28,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:28,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:28,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:28,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:28,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:28,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:28,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:28,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:28,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:28,234 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:28,234 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:28,235 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:28,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:28,236 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:28,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:28,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:28,239 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:28,240 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:28,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:28,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:28,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:28,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:28,244 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:28,244 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:28,245 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:28,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:28,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:28,246 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:28,247 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:28,247 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:28,248 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:28,248 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:28,248 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:28,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:28,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:28,249 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 08:34:28,257 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:28,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:28,258 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:28,258 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:28,258 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:28,258 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:34:28,259 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:34:28,259 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:34:28,259 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:34:28,259 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:34:28,259 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:34:28,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:28,259 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:34:28,259 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:34:28,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:28,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:34:28,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:28,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:34:28,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:34:28,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:34:28,260 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:34:28,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:28,261 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:34:28,261 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:28,261 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:34:28,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:28,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:28,261 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:34:28,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:28,262 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:28,262 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:34:28,262 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:34:28,263 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_d35ccca7-4cfb-4278-885b-0e79011b1678/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 -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-11-18 08:34:28,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:28,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:28,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:28,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:28,297 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:28,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-18 08:34:28,336 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/data/1be0a06ec/48db4e30b69041e1adb4fd4a6dc693ad/FLAGbe7556ac6 [2018-11-18 08:34:28,665 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:28,665 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-18 08:34:28,670 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/data/1be0a06ec/48db4e30b69041e1adb4fd4a6dc693ad/FLAGbe7556ac6 [2018-11-18 08:34:29,094 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/data/1be0a06ec/48db4e30b69041e1adb4fd4a6dc693ad [2018-11-18 08:34:29,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:29,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:34:29,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:29,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:29,100 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:29,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25989349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29, skipping insertion in model container [2018-11-18 08:34:29,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:29,126 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:29,248 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:29,250 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:29,270 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:29,278 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:29,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29 WrapperNode [2018-11-18 08:34:29,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:29,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:29,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:34:29,280 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:34:29,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:29,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:29,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:29,314 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:29,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:29,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:29,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:29,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:29,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:29,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:29,645 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:29,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:29 BoogieIcfgContainer [2018-11-18 08:34:29,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:29,645 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:34:29,646 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:34:29,649 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:34:29,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:29,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:34:29" (1/3) ... [2018-11-18 08:34:29,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16cc13d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:29, skipping insertion in model container [2018-11-18 08:34:29,651 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:29,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (2/3) ... [2018-11-18 08:34:29,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16cc13d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:29, skipping insertion in model container [2018-11-18 08:34:29,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:29,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:29" (3/3) ... [2018-11-18 08:34:29,654 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-18 08:34:29,700 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:29,701 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:34:29,701 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:34:29,701 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:34:29,701 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:29,701 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:29,701 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:34:29,701 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:29,701 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:34:29,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-18 08:34:29,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-18 08:34:29,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:29,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:29,736 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:34:29,736 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:29,737 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:34:29,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-18 08:34:29,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-18 08:34:29,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:29,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:29,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:34:29,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:29,746 INFO L794 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~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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 !(0 == mp_add_~a3~0 % 256); 8#L40-1true mp_add_~nb~0 := 4; 31#L50true assume !(0 == mp_add_~b3~0 % 256); 28#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23#L61-3true [2018-11-18 08:34:29,746 INFO L796 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) || 0 != mp_add_~carry~0 % 65536);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 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14#L76-1true assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3#L80-1true assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 24#L81-1true assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7#L82-1true assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 33#L83-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23#L61-3true [2018-11-18 08:34:29,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:29,751 INFO L82 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2018-11-18 08:34:29,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:29,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:29,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:29,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:29,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:29,849 INFO L82 PathProgramCache]: Analyzing trace with hash -486457291, now seen corresponding path program 1 times [2018-11-18 08:34:29,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:29,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:29,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:29,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:29,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:29,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:29,900 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:29,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:29,916 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-11-18 08:34:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,071 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2018-11-18 08:34:30,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2018-11-18 08:34:30,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2018-11-18 08:34:30,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 90 transitions. [2018-11-18 08:34:30,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-18 08:34:30,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-18 08:34:30,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 90 transitions. [2018-11-18 08:34:30,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:30,080 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-11-18 08:34:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 90 transitions. [2018-11-18 08:34:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-18 08:34:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 08:34:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2018-11-18 08:34:30,104 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-18 08:34:30,105 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-18 08:34:30,105 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:34:30,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 88 transitions. [2018-11-18 08:34:30,106 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-18 08:34:30,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:30,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:30,107 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,107 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,107 INFO L794 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~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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 !(0 == mp_add_~a3~0 % 256); 128#L40-1 mp_add_~nb~0 := 4; 129#L50 assume !(0 == mp_add_~b3~0 % 256); 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) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 151#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 145#L64-1 [2018-11-18 08:34:30,107 INFO L796 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 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 138#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 120#L80-1 assume !(1 == mp_add_~i~0 % 256); 121#L81-1 assume !(2 == mp_add_~i~0 % 256); 126#L82-1 assume !(3 == mp_add_~i~0 % 256); 127#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 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) || 0 != mp_add_~carry~0 % 65536);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 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 136#L65-2 assume !(1 == mp_add_~i~0 % 256); 137#L66-1 assume !(2 == mp_add_~i~0 % 256); 144#L67-1 assume !(3 == mp_add_~i~0 % 256); 145#L64-1 [2018-11-18 08:34:30,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash -685617854, now seen corresponding path program 1 times [2018-11-18 08:34:30,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:30,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:30,263 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:30,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 1 times [2018-11-18 08:34:30,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:30,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:30,330 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:30,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:34:30,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:30,331 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. cyclomatic complexity: 32 Second operand 5 states. [2018-11-18 08:34:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,699 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2018-11-18 08:34:30,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:34:30,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 226 transitions. [2018-11-18 08:34:30,702 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 82 [2018-11-18 08:34:30,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 226 transitions. [2018-11-18 08:34:30,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2018-11-18 08:34:30,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2018-11-18 08:34:30,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 226 transitions. [2018-11-18 08:34:30,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:30,705 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 226 transitions. [2018-11-18 08:34:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 226 transitions. [2018-11-18 08:34:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2018-11-18 08:34:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 08:34:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2018-11-18 08:34:30,710 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-18 08:34:30,710 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-18 08:34:30,710 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:34:30,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 119 transitions. [2018-11-18 08:34:30,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-18 08:34:30,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:30,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:30,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,713 INFO L794 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 363#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 359#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 360#L42 assume !(0 == mp_add_~a2~0 % 256); 386#L40-1 mp_add_~nb~0 := 4; 383#L50 assume !(0 == mp_add_~b3~0 % 256); 366#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 401#L61-3 assume true; 399#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 400#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 385#L64-1 [2018-11-18 08:34:30,713 INFO L796 eck$LassoCheckResult]: Loop: 385#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 358#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 364#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 345#L80-1 assume !(1 == mp_add_~i~0 % 256); 346#L81-1 assume !(2 == mp_add_~i~0 % 256); 351#L82-1 assume !(3 == mp_add_~i~0 % 256); 352#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 375#L61-3 assume true; 376#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 396#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 388#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 368#L65-2 assume !(1 == mp_add_~i~0 % 256); 391#L66-1 assume !(2 == mp_add_~i~0 % 256); 392#L67-1 assume !(3 == mp_add_~i~0 % 256); 385#L64-1 [2018-11-18 08:34:30,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,714 INFO L82 PathProgramCache]: Analyzing trace with hash 959922624, now seen corresponding path program 1 times [2018-11-18 08:34:30,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:30,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:34:30,793 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:30,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 2 times [2018-11-18 08:34:30,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:30,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:30,850 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:30,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:34:30,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:34:30,851 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. cyclomatic complexity: 37 Second operand 6 states. [2018-11-18 08:34:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:31,196 INFO L93 Difference]: Finished difference Result 251 states and 375 transitions. [2018-11-18 08:34:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:34:31,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 375 transitions. [2018-11-18 08:34:31,199 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 197 [2018-11-18 08:34:31,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 251 states and 375 transitions. [2018-11-18 08:34:31,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 251 [2018-11-18 08:34:31,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2018-11-18 08:34:31,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 375 transitions. [2018-11-18 08:34:31,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:31,203 INFO L705 BuchiCegarLoop]: Abstraction has 251 states and 375 transitions. [2018-11-18 08:34:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 375 transitions. [2018-11-18 08:34:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 176. [2018-11-18 08:34:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 08:34:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 268 transitions. [2018-11-18 08:34:31,214 INFO L728 BuchiCegarLoop]: Abstraction has 176 states and 268 transitions. [2018-11-18 08:34:31,214 INFO L608 BuchiCegarLoop]: Abstraction has 176 states and 268 transitions. [2018-11-18 08:34:31,214 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:34:31,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 268 transitions. [2018-11-18 08:34:31,216 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 141 [2018-11-18 08:34:31,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:31,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:31,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,217 INFO L794 eck$LassoCheckResult]: Stem: 742#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 715#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 710#L40 assume !(0 == mp_add_~a3~0 % 256); 711#L40-1 mp_add_~nb~0 := 4; 735#L50 assume !(0 == mp_add_~b3~0 % 256); 718#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 823#L61-3 assume true; 822#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 821#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 820#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 790#L65-2 [2018-11-18 08:34:31,217 INFO L796 eck$LassoCheckResult]: Loop: 790#L65-2 assume !(1 == mp_add_~i~0 % 256); 819#L66-1 assume !(2 == mp_add_~i~0 % 256); 818#L67-1 assume !(3 == mp_add_~i~0 % 256); 815#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 813#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 812#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 779#L80-1 assume !(1 == mp_add_~i~0 % 256); 777#L81-1 assume !(2 == mp_add_~i~0 % 256); 798#L82-1 assume !(3 == mp_add_~i~0 % 256); 797#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 796#L61-3 assume true; 794#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 791#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 786#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 790#L65-2 [2018-11-18 08:34:31,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,218 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 1 times [2018-11-18 08:34:31,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:31,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:31,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1892987967, now seen corresponding path program 3 times [2018-11-18 08:34:31,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:31,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:31,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:31,320 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:31,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:31,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:31,320 INFO L87 Difference]: Start difference. First operand 176 states and 268 transitions. cyclomatic complexity: 97 Second operand 4 states. [2018-11-18 08:34:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:31,462 INFO L93 Difference]: Finished difference Result 274 states and 419 transitions. [2018-11-18 08:34:31,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:31,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 419 transitions. [2018-11-18 08:34:31,464 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 239 [2018-11-18 08:34:31,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 274 states and 419 transitions. [2018-11-18 08:34:31,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2018-11-18 08:34:31,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 274 [2018-11-18 08:34:31,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 419 transitions. [2018-11-18 08:34:31,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:31,468 INFO L705 BuchiCegarLoop]: Abstraction has 274 states and 419 transitions. [2018-11-18 08:34:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 419 transitions. [2018-11-18 08:34:31,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 245. [2018-11-18 08:34:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-18 08:34:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 371 transitions. [2018-11-18 08:34:31,476 INFO L728 BuchiCegarLoop]: Abstraction has 245 states and 371 transitions. [2018-11-18 08:34:31,476 INFO L608 BuchiCegarLoop]: Abstraction has 245 states and 371 transitions. [2018-11-18 08:34:31,476 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:34:31,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 371 transitions. [2018-11-18 08:34:31,477 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 210 [2018-11-18 08:34:31,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:31,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:31,478 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,478 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,478 INFO L794 eck$LassoCheckResult]: Stem: 1202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 1167#L40 assume !(0 == mp_add_~a3~0 % 256); 1163#L40-1 mp_add_~nb~0 := 4; 1164#L50 assume !(0 == mp_add_~b3~0 % 256); 1188#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1189#L61-3 assume true; 1190#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1191#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1201#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1169#L65-2 [2018-11-18 08:34:31,478 INFO L796 eck$LassoCheckResult]: Loop: 1169#L65-2 assume !(1 == mp_add_~i~0 % 256); 1170#L66-1 assume !(2 == mp_add_~i~0 % 256); 1394#L67-1 assume !(3 == mp_add_~i~0 % 256); 1389#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1386#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1379#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1378#L80-1 assume !(1 == mp_add_~i~0 % 256); 1377#L81-1 assume !(2 == mp_add_~i~0 % 256); 1376#L82-1 assume !(3 == mp_add_~i~0 % 256); 1285#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1286#L61-3 assume true; 1281#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1282#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1278#L65 assume !(0 == mp_add_~i~0 % 256); 1279#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 1205#L66-1 assume !(2 == mp_add_~i~0 % 256); 1179#L67-1 assume !(3 == mp_add_~i~0 % 256); 1180#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1166#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1187#L76-1 assume !(0 == mp_add_~i~0 % 256); 1384#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1184#L81-1 assume !(2 == mp_add_~i~0 % 256); 1185#L82-1 assume !(3 == mp_add_~i~0 % 256); 1287#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1283#L61-3 assume true; 1284#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1280#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1269#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1169#L65-2 [2018-11-18 08:34:31,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 2 times [2018-11-18 08:34:31,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:31,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,499 INFO L82 PathProgramCache]: Analyzing trace with hash 826534277, now seen corresponding path program 1 times [2018-11-18 08:34:31,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:31,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 08:34:31,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:31,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:31,565 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:31,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:31,573 INFO L87 Difference]: Start difference. First operand 245 states and 371 transitions. cyclomatic complexity: 131 Second operand 4 states. [2018-11-18 08:34:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:31,719 INFO L93 Difference]: Finished difference Result 431 states and 634 transitions. [2018-11-18 08:34:31,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:34:31,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 634 transitions. [2018-11-18 08:34:31,726 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 396 [2018-11-18 08:34:31,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 431 states and 634 transitions. [2018-11-18 08:34:31,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 431 [2018-11-18 08:34:31,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 431 [2018-11-18 08:34:31,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 634 transitions. [2018-11-18 08:34:31,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:31,730 INFO L705 BuchiCegarLoop]: Abstraction has 431 states and 634 transitions. [2018-11-18 08:34:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 634 transitions. [2018-11-18 08:34:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 270. [2018-11-18 08:34:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-18 08:34:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 409 transitions. [2018-11-18 08:34:31,740 INFO L728 BuchiCegarLoop]: Abstraction has 270 states and 409 transitions. [2018-11-18 08:34:31,740 INFO L608 BuchiCegarLoop]: Abstraction has 270 states and 409 transitions. [2018-11-18 08:34:31,740 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:34:31,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 409 transitions. [2018-11-18 08:34:31,742 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 235 [2018-11-18 08:34:31,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:31,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:31,742 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,742 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,743 INFO L794 eck$LassoCheckResult]: Stem: 1883#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 1851#L40 assume !(0 == mp_add_~a3~0 % 256); 1852#L40-1 mp_add_~nb~0 := 4; 1876#L50 assume !(0 == mp_add_~b3~0 % 256); 1862#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1989#L61-3 assume true; 1988#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1987#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1986#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1940#L65-2 [2018-11-18 08:34:31,743 INFO L796 eck$LassoCheckResult]: Loop: 1940#L65-2 assume !(1 == mp_add_~i~0 % 256); 1985#L66-1 assume !(2 == mp_add_~i~0 % 256); 1984#L67-1 assume !(3 == mp_add_~i~0 % 256); 1981#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1979#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1978#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1921#L80-1 assume !(1 == mp_add_~i~0 % 256); 1918#L81-1 assume !(2 == mp_add_~i~0 % 256); 1915#L82-1 assume !(3 == mp_add_~i~0 % 256); 1916#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1975#L61-3 assume true; 1974#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1973#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1972#L65 assume !(0 == mp_add_~i~0 % 256); 1971#L65-2 assume !(1 == mp_add_~i~0 % 256); 1970#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 1966#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 1961#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1956#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1952#L76-1 assume !(0 == mp_add_~i~0 % 256); 1950#L80-1 assume !(1 == mp_add_~i~0 % 256); 1949#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 1948#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 1945#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1944#L61-3 assume true; 1943#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1942#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1939#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1940#L65-2 [2018-11-18 08:34:31,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 3 times [2018-11-18 08:34:31,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:31,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1797412609, now seen corresponding path program 1 times [2018-11-18 08:34:31,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:31,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 08:34:31,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:31,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:31,795 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:31,796 INFO L87 Difference]: Start difference. First operand 270 states and 409 transitions. cyclomatic complexity: 143 Second operand 3 states. [2018-11-18 08:34:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:31,865 INFO L93 Difference]: Finished difference Result 322 states and 471 transitions. [2018-11-18 08:34:31,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:31,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 471 transitions. [2018-11-18 08:34:31,867 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 287 [2018-11-18 08:34:31,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 322 states and 471 transitions. [2018-11-18 08:34:31,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 322 [2018-11-18 08:34:31,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2018-11-18 08:34:31,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 322 states and 471 transitions. [2018-11-18 08:34:31,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:31,869 INFO L705 BuchiCegarLoop]: Abstraction has 322 states and 471 transitions. [2018-11-18 08:34:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states and 471 transitions. [2018-11-18 08:34:31,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 299. [2018-11-18 08:34:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-18 08:34:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 443 transitions. [2018-11-18 08:34:31,875 INFO L728 BuchiCegarLoop]: Abstraction has 299 states and 443 transitions. [2018-11-18 08:34:31,875 INFO L608 BuchiCegarLoop]: Abstraction has 299 states and 443 transitions. [2018-11-18 08:34:31,876 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 08:34:31,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 299 states and 443 transitions. [2018-11-18 08:34:31,877 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 264 [2018-11-18 08:34:31,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:31,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:31,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,879 INFO L794 eck$LassoCheckResult]: Stem: 2477#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2454#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 2449#L40 assume !(0 == mp_add_~a3~0 % 256); 2450#L40-1 mp_add_~nb~0 := 4; 2733#L50 assume !(0 == mp_add_~b3~0 % 256); 2730#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2729#L61-3 assume true; 2728#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2727#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2725#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2674#L65-2 [2018-11-18 08:34:31,879 INFO L796 eck$LassoCheckResult]: Loop: 2674#L65-2 assume !(1 == mp_add_~i~0 % 256); 2724#L66-1 assume !(2 == mp_add_~i~0 % 256); 2723#L67-1 assume !(3 == mp_add_~i~0 % 256); 2720#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2692#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2693#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2657#L80-1 assume !(1 == mp_add_~i~0 % 256); 2656#L81-1 assume !(2 == mp_add_~i~0 % 256); 2649#L82-1 assume !(3 == mp_add_~i~0 % 256); 2650#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2718#L61-3 assume true; 2717#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2712#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2711#L65 assume !(0 == mp_add_~i~0 % 256); 2710#L65-2 assume !(1 == mp_add_~i~0 % 256); 2707#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 2463#L67-1 assume !(3 == mp_add_~i~0 % 256); 2464#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2453#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2457#L76-1 assume !(0 == mp_add_~i~0 % 256); 2438#L80-1 assume !(1 == mp_add_~i~0 % 256); 2439#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 2444#L82-1 assume !(3 == mp_add_~i~0 % 256); 2445#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2585#L61-3 assume true; 2495#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2496#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2673#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2674#L65-2 [2018-11-18 08:34:31,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 4 times [2018-11-18 08:34:31,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:31,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2112836349, now seen corresponding path program 1 times [2018-11-18 08:34:31,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:31,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 08:34:31,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:31,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:31,967 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:31,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:34:31,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:31,967 INFO L87 Difference]: Start difference. First operand 299 states and 443 transitions. cyclomatic complexity: 148 Second operand 5 states. [2018-11-18 08:34:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,163 INFO L93 Difference]: Finished difference Result 455 states and 660 transitions. [2018-11-18 08:34:32,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:34:32,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 660 transitions. [2018-11-18 08:34:32,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 414 [2018-11-18 08:34:32,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 449 states and 654 transitions. [2018-11-18 08:34:32,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2018-11-18 08:34:32,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2018-11-18 08:34:32,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 449 states and 654 transitions. [2018-11-18 08:34:32,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:32,172 INFO L705 BuchiCegarLoop]: Abstraction has 449 states and 654 transitions. [2018-11-18 08:34:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states and 654 transitions. [2018-11-18 08:34:32,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 300. [2018-11-18 08:34:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-18 08:34:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 446 transitions. [2018-11-18 08:34:32,179 INFO L728 BuchiCegarLoop]: Abstraction has 300 states and 446 transitions. [2018-11-18 08:34:32,179 INFO L608 BuchiCegarLoop]: Abstraction has 300 states and 446 transitions. [2018-11-18 08:34:32,179 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 08:34:32,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 446 transitions. [2018-11-18 08:34:32,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 265 [2018-11-18 08:34:32,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:32,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:32,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,181 INFO L794 eck$LassoCheckResult]: Stem: 3249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 3220#L40 assume !(0 == mp_add_~a3~0 % 256); 3216#L40-1 mp_add_~nb~0 := 4; 3217#L50 assume !(0 == mp_add_~b3~0 % 256); 3241#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3242#L61-3 assume true; 3459#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3458#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3456#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3454#L65-2 [2018-11-18 08:34:32,181 INFO L796 eck$LassoCheckResult]: Loop: 3454#L65-2 assume !(1 == mp_add_~i~0 % 256); 3451#L66-1 assume !(2 == mp_add_~i~0 % 256); 3448#L67-1 assume !(3 == mp_add_~i~0 % 256); 3444#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3438#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3435#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3433#L80-1 assume !(1 == mp_add_~i~0 % 256); 3239#L81-1 assume !(2 == mp_add_~i~0 % 256); 3212#L82-1 assume !(3 == mp_add_~i~0 % 256); 3213#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3237#L61-3 assume true; 3238#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3243#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3230#L65 assume !(0 == mp_add_~i~0 % 256); 3222#L65-2 assume !(1 == mp_add_~i~0 % 256); 3223#L66-1 assume !(2 == mp_add_~i~0 % 256); 3478#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 3472#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3395#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3295#L76-1 assume !(0 == mp_add_~i~0 % 256); 3282#L80-1 assume !(1 == mp_add_~i~0 % 256); 3283#L81-1 assume !(2 == mp_add_~i~0 % 256); 3277#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 3272#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3270#L61-3 assume true; 3261#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3262#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3455#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3454#L65-2 [2018-11-18 08:34:32,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 5 times [2018-11-18 08:34:32,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1309353339, now seen corresponding path program 1 times [2018-11-18 08:34:32,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 08:34:32,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:32,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:32,252 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:32,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:32,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:32,252 INFO L87 Difference]: Start difference. First operand 300 states and 446 transitions. cyclomatic complexity: 150 Second operand 4 states. [2018-11-18 08:34:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,401 INFO L93 Difference]: Finished difference Result 512 states and 781 transitions. [2018-11-18 08:34:32,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:34:32,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 512 states and 781 transitions. [2018-11-18 08:34:32,404 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 466 [2018-11-18 08:34:32,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 512 states to 512 states and 781 transitions. [2018-11-18 08:34:32,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 512 [2018-11-18 08:34:32,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 512 [2018-11-18 08:34:32,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 512 states and 781 transitions. [2018-11-18 08:34:32,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:32,409 INFO L705 BuchiCegarLoop]: Abstraction has 512 states and 781 transitions. [2018-11-18 08:34:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states and 781 transitions. [2018-11-18 08:34:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 409. [2018-11-18 08:34:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-11-18 08:34:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 627 transitions. [2018-11-18 08:34:32,416 INFO L728 BuchiCegarLoop]: Abstraction has 409 states and 627 transitions. [2018-11-18 08:34:32,416 INFO L608 BuchiCegarLoop]: Abstraction has 409 states and 627 transitions. [2018-11-18 08:34:32,416 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 08:34:32,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 409 states and 627 transitions. [2018-11-18 08:34:32,417 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 370 [2018-11-18 08:34:32,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:32,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:32,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 08:34:32,418 INFO L794 eck$LassoCheckResult]: Stem: 4078#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4044#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 4039#L40 assume !(0 == mp_add_~a3~0 % 256); 4040#L40-1 mp_add_~nb~0 := 4; 4071#L50 assume !(0 == mp_add_~b3~0 % 256); 4050#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4214#L61-3 assume true; 4213#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4212#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4211#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4146#L65-2 [2018-11-18 08:34:32,418 INFO L796 eck$LassoCheckResult]: Loop: 4146#L65-2 assume !(1 == mp_add_~i~0 % 256); 4209#L66-1 assume !(2 == mp_add_~i~0 % 256); 4208#L67-1 assume !(3 == mp_add_~i~0 % 256); 4206#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4205#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4200#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4113#L80-1 assume !(1 == mp_add_~i~0 % 256); 4111#L81-1 assume !(2 == mp_add_~i~0 % 256); 4109#L82-1 assume !(3 == mp_add_~i~0 % 256); 4110#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4197#L61-3 assume true; 4196#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4195#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4188#L65 assume !(0 == mp_add_~i~0 % 256); 4191#L65-2 assume !(1 == mp_add_~i~0 % 256); 4189#L66-1 assume !(2 == mp_add_~i~0 % 256); 4185#L67-1 assume !(3 == mp_add_~i~0 % 256); 4180#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4177#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4170#L76-1 assume !(0 == mp_add_~i~0 % 256); 4164#L80-1 assume !(1 == mp_add_~i~0 % 256); 4159#L81-1 assume !(2 == mp_add_~i~0 % 256); 4157#L82-1 assume !(3 == mp_add_~i~0 % 256); 4156#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4154#L61-3 assume true; 4152#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4149#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4145#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4146#L65-2 [2018-11-18 08:34:32,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 6 times [2018-11-18 08:34:32,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,431 INFO L82 PathProgramCache]: Analyzing trace with hash -993929599, now seen corresponding path program 1 times [2018-11-18 08:34:32,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:32,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:32,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:32,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:32,466 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:32,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:32,466 INFO L87 Difference]: Start difference. First operand 409 states and 627 transitions. cyclomatic complexity: 222 Second operand 4 states. [2018-11-18 08:34:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,508 INFO L93 Difference]: Finished difference Result 701 states and 1065 transitions. [2018-11-18 08:34:32,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:32,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 701 states and 1065 transitions. [2018-11-18 08:34:32,510 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 658 [2018-11-18 08:34:32,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 701 states to 701 states and 1065 transitions. [2018-11-18 08:34:32,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 701 [2018-11-18 08:34:32,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 701 [2018-11-18 08:34:32,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 701 states and 1065 transitions. [2018-11-18 08:34:32,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:32,514 INFO L705 BuchiCegarLoop]: Abstraction has 701 states and 1065 transitions. [2018-11-18 08:34:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states and 1065 transitions. [2018-11-18 08:34:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 623. [2018-11-18 08:34:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-11-18 08:34:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 958 transitions. [2018-11-18 08:34:32,521 INFO L728 BuchiCegarLoop]: Abstraction has 623 states and 958 transitions. [2018-11-18 08:34:32,521 INFO L608 BuchiCegarLoop]: Abstraction has 623 states and 958 transitions. [2018-11-18 08:34:32,521 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 08:34:32,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 623 states and 958 transitions. [2018-11-18 08:34:32,523 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 584 [2018-11-18 08:34:32,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:32,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:32,524 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,524 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 08:34:32,524 INFO L794 eck$LassoCheckResult]: Stem: 5191#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 5159#L40 assume !(0 == mp_add_~a3~0 % 256); 5155#L40-1 mp_add_~nb~0 := 4; 5156#L50 assume !(0 == mp_add_~b3~0 % 256); 5180#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5181#L61-3 assume true; 5685#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5684#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5680#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5679#L65-2 [2018-11-18 08:34:32,524 INFO L796 eck$LassoCheckResult]: Loop: 5679#L65-2 assume !(1 == mp_add_~i~0 % 256); 5195#L66-1 assume !(2 == mp_add_~i~0 % 256); 5196#L67-1 assume !(3 == mp_add_~i~0 % 256); 5186#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5188#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 5165#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5145#L80-1 assume !(1 == mp_add_~i~0 % 256); 5146#L81-1 assume !(2 == mp_add_~i~0 % 256); 5151#L82-1 assume !(3 == mp_add_~i~0 % 256); 5152#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5175#L61-3 assume true; 5176#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5182#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5192#L65 assume !(0 == mp_add_~i~0 % 256); 5162#L65-2 assume !(1 == mp_add_~i~0 % 256); 5163#L66-1 assume !(2 == mp_add_~i~0 % 256); 5557#L67-1 assume !(3 == mp_add_~i~0 % 256); 5762#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5699#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 5264#L76-1 assume !(0 == mp_add_~i~0 % 256); 5225#L80-1 assume !(1 == mp_add_~i~0 % 256); 5223#L81-1 assume !(2 == mp_add_~i~0 % 256); 5220#L82-1 assume !(3 == mp_add_~i~0 % 256); 5222#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5217#L61-3 assume true; 5215#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5216#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5683#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5679#L65-2 [2018-11-18 08:34:32,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 7 times [2018-11-18 08:34:32,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1520970115, now seen corresponding path program 1 times [2018-11-18 08:34:32,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:32,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:32,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:34:32,628 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:34:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:32,629 INFO L87 Difference]: Start difference. First operand 623 states and 958 transitions. cyclomatic complexity: 339 Second operand 5 states. [2018-11-18 08:34:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,765 INFO L93 Difference]: Finished difference Result 796 states and 1149 transitions. [2018-11-18 08:34:32,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:34:32,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 796 states and 1149 transitions. [2018-11-18 08:34:32,773 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 686 [2018-11-18 08:34:32,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 796 states to 796 states and 1149 transitions. [2018-11-18 08:34:32,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 796 [2018-11-18 08:34:32,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 796 [2018-11-18 08:34:32,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 796 states and 1149 transitions. [2018-11-18 08:34:32,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:32,778 INFO L705 BuchiCegarLoop]: Abstraction has 796 states and 1149 transitions. [2018-11-18 08:34:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states and 1149 transitions. [2018-11-18 08:34:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 646. [2018-11-18 08:34:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-18 08:34:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 985 transitions. [2018-11-18 08:34:32,786 INFO L728 BuchiCegarLoop]: Abstraction has 646 states and 985 transitions. [2018-11-18 08:34:32,786 INFO L608 BuchiCegarLoop]: Abstraction has 646 states and 985 transitions. [2018-11-18 08:34:32,786 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 08:34:32,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 646 states and 985 transitions. [2018-11-18 08:34:32,788 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 600 [2018-11-18 08:34:32,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:32,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:32,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,789 INFO L794 eck$LassoCheckResult]: Stem: 6620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6593#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 6589#L40 assume !(0 == mp_add_~a3~0 % 256); 6585#L40-1 mp_add_~nb~0 := 4; 6586#L50 assume !(0 == mp_add_~b3~0 % 256); 6608#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6609#L61-3 assume true; 7180#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7179#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7178#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7120#L65-2 [2018-11-18 08:34:32,789 INFO L796 eck$LassoCheckResult]: Loop: 7120#L65-2 assume !(1 == mp_add_~i~0 % 256); 7169#L66-1 assume !(2 == mp_add_~i~0 % 256); 7167#L67-1 assume !(3 == mp_add_~i~0 % 256); 6616#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6588#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 6594#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6575#L80-1 assume !(1 == mp_add_~i~0 % 256); 6576#L81-1 assume !(2 == mp_add_~i~0 % 256); 6581#L82-1 assume !(3 == mp_add_~i~0 % 256); 6582#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6604#L61-3 assume true; 6605#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6610#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6597#L65 assume !(0 == mp_add_~i~0 % 256); 6591#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 6592#L66-1 assume !(2 == mp_add_~i~0 % 256); 6600#L67-1 assume !(3 == mp_add_~i~0 % 256); 6601#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 7140#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7197#L76-1 assume !(0 == mp_add_~i~0 % 256); 7170#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 7132#L81-1 assume !(2 == mp_add_~i~0 % 256); 7168#L82-1 assume !(3 == mp_add_~i~0 % 256); 7166#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7165#L61-3 assume true; 7164#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7163#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7149#L65 assume !(0 == mp_add_~i~0 % 256); 7155#L65-2 assume !(1 == mp_add_~i~0 % 256); 7156#L66-1 assume !(2 == mp_add_~i~0 % 256); 7208#L67-1 assume !(3 == mp_add_~i~0 % 256); 7150#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6935#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6907#L76-1 assume !(0 == mp_add_~i~0 % 256); 6665#L80-1 assume !(1 == mp_add_~i~0 % 256); 6667#L81-1 assume !(2 == mp_add_~i~0 % 256); 6660#L82-1 assume !(3 == mp_add_~i~0 % 256); 6658#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6659#L61-3 assume true; 6644#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6645#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7119#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7120#L65-2 [2018-11-18 08:34:32,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,789 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 8 times [2018-11-18 08:34:32,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash 2122464133, now seen corresponding path program 1 times [2018-11-18 08:34:32,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:32,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 08:34:32,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:32,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:32,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 08:34:33,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:33,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-18 08:34:33,106 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:33,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 08:34:33,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:34:33,106 INFO L87 Difference]: Start difference. First operand 646 states and 985 transitions. cyclomatic complexity: 343 Second operand 8 states. [2018-11-18 08:34:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:33,384 INFO L93 Difference]: Finished difference Result 887 states and 1236 transitions. [2018-11-18 08:34:33,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 08:34:33,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 887 states and 1236 transitions. [2018-11-18 08:34:33,388 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 781 [2018-11-18 08:34:33,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 887 states to 887 states and 1236 transitions. [2018-11-18 08:34:33,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 887 [2018-11-18 08:34:33,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 887 [2018-11-18 08:34:33,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 887 states and 1236 transitions. [2018-11-18 08:34:33,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:33,392 INFO L705 BuchiCegarLoop]: Abstraction has 887 states and 1236 transitions. [2018-11-18 08:34:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states and 1236 transitions. [2018-11-18 08:34:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 535. [2018-11-18 08:34:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-18 08:34:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 803 transitions. [2018-11-18 08:34:33,401 INFO L728 BuchiCegarLoop]: Abstraction has 535 states and 803 transitions. [2018-11-18 08:34:33,401 INFO L608 BuchiCegarLoop]: Abstraction has 535 states and 803 transitions. [2018-11-18 08:34:33,401 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 08:34:33,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 535 states and 803 transitions. [2018-11-18 08:34:33,402 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 489 [2018-11-18 08:34:33,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:33,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:33,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,403 INFO L794 eck$LassoCheckResult]: Stem: 8288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 8261#L40 assume !(0 == mp_add_~a3~0 % 256); 8262#L40-1 mp_add_~nb~0 := 4; 8780#L50 assume !(0 == mp_add_~b3~0 % 256); 8283#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8284#L61-3 assume true; 8677#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8289#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8271#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8272#L65-2 [2018-11-18 08:34:33,404 INFO L796 eck$LassoCheckResult]: Loop: 8272#L65-2 assume !(1 == mp_add_~i~0 % 256); 8772#L66-1 assume !(2 == mp_add_~i~0 % 256); 8770#L67-1 assume !(3 == mp_add_~i~0 % 256); 8765#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8760#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8687#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8686#L80-1 assume !(1 == mp_add_~i~0 % 256); 8682#L81-1 assume !(2 == mp_add_~i~0 % 256); 8683#L82-1 assume !(3 == mp_add_~i~0 % 256); 8678#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8679#L61-3 assume true; 8674#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8675#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8777#L65 assume !(0 == mp_add_~i~0 % 256); 8265#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 8266#L66-1 assume !(2 == mp_add_~i~0 % 256); 8275#L67-1 assume !(3 == mp_add_~i~0 % 256); 8276#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8260#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8267#L76-1 assume !(0 == mp_add_~i~0 % 256); 8268#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 8322#L81-1 assume !(2 == mp_add_~i~0 % 256); 8676#L82-1 assume !(3 == mp_add_~i~0 % 256); 8672#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8671#L61-3 assume true; 8670#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8669#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8668#L65 assume !(0 == mp_add_~i~0 % 256); 8667#L65-2 assume !(1 == mp_add_~i~0 % 256); 8619#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 8620#L67-1 assume !(3 == mp_add_~i~0 % 256); 8636#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8634#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 8633#L76-1 assume !(0 == mp_add_~i~0 % 256); 8632#L80-1 assume !(1 == mp_add_~i~0 % 256); 8594#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 8393#L82-1 assume !(3 == mp_add_~i~0 % 256); 8317#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8520#L61-3 assume true; 8521#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8564#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8535#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8534#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 8516#L76-1 assume !(0 == mp_add_~i~0 % 256); 8321#L80-1 assume !(1 == mp_add_~i~0 % 256); 8323#L81-1 assume !(2 == mp_add_~i~0 % 256); 8316#L82-1 assume !(3 == mp_add_~i~0 % 256); 8315#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8313#L61-3 assume true; 8314#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8627#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8713#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8272#L65-2 [2018-11-18 08:34:33,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,404 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 9 times [2018-11-18 08:34:33,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,419 INFO L82 PathProgramCache]: Analyzing trace with hash 73654067, now seen corresponding path program 1 times [2018-11-18 08:34:33,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:33,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 08:34:33,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:33,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:33,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 08:34:33,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:34:33,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-18 08:34:33,608 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:33,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 08:34:33,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:34:33,608 INFO L87 Difference]: Start difference. First operand 535 states and 803 transitions. cyclomatic complexity: 272 Second operand 8 states. [2018-11-18 08:34:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:33,757 INFO L93 Difference]: Finished difference Result 789 states and 1128 transitions. [2018-11-18 08:34:33,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:34:33,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 789 states and 1128 transitions. [2018-11-18 08:34:33,760 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 742 [2018-11-18 08:34:33,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 789 states to 789 states and 1128 transitions. [2018-11-18 08:34:33,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 789 [2018-11-18 08:34:33,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 789 [2018-11-18 08:34:33,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 789 states and 1128 transitions. [2018-11-18 08:34:33,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:33,764 INFO L705 BuchiCegarLoop]: Abstraction has 789 states and 1128 transitions. [2018-11-18 08:34:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states and 1128 transitions. [2018-11-18 08:34:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 542. [2018-11-18 08:34:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-18 08:34:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-11-18 08:34:33,770 INFO L728 BuchiCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-11-18 08:34:33,770 INFO L608 BuchiCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-11-18 08:34:33,770 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 08:34:33,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 807 transitions. [2018-11-18 08:34:33,771 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 495 [2018-11-18 08:34:33,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:33,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:33,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,772 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,772 INFO L794 eck$LassoCheckResult]: Stem: 9782#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9753#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 9748#L40 assume !(0 == mp_add_~a3~0 % 256); 9749#L40-1 mp_add_~nb~0 := 4; 10274#L50 assume !(0 == mp_add_~b3~0 % 256); 10271#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 10270#L61-3 assume true; 10269#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10268#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10267#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10056#L65-2 [2018-11-18 08:34:33,772 INFO L796 eck$LassoCheckResult]: Loop: 10056#L65-2 assume !(1 == mp_add_~i~0 % 256); 10266#L66-1 assume !(2 == mp_add_~i~0 % 256); 10265#L67-1 assume !(3 == mp_add_~i~0 % 256); 9779#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 9752#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10261#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 10260#L80-1 assume !(1 == mp_add_~i~0 % 256); 10037#L81-1 assume !(2 == mp_add_~i~0 % 256); 10035#L82-1 assume !(3 == mp_add_~i~0 % 256); 10033#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10032#L61-3 assume true; 10031#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10030#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10029#L65 assume !(0 == mp_add_~i~0 % 256); 10028#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 9925#L66-1 assume !(2 == mp_add_~i~0 % 256); 10026#L67-1 assume !(3 == mp_add_~i~0 % 256); 10024#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 10022#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10021#L76-1 assume !(0 == mp_add_~i~0 % 256); 10019#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 9858#L81-1 assume !(2 == mp_add_~i~0 % 256); 9999#L82-1 assume !(3 == mp_add_~i~0 % 256); 9993#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9992#L61-3 assume true; 9991#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9990#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9989#L65 assume !(0 == mp_add_~i~0 % 256); 9988#L65-2 assume !(1 == mp_add_~i~0 % 256); 9987#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 9918#L67-1 assume !(3 == mp_add_~i~0 % 256); 9983#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 9981#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9980#L76-1 assume !(0 == mp_add_~i~0 % 256); 9979#L80-1 assume !(1 == mp_add_~i~0 % 256); 9978#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 9975#L82-1 assume !(3 == mp_add_~i~0 % 256); 9965#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9966#L61-3 assume true; 9957#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9958#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 9908#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 10247#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 10004#L76-1 assume !(0 == mp_add_~i~0 % 256); 10005#L80-1 assume !(1 == mp_add_~i~0 % 256); 10020#L81-1 assume !(2 == mp_add_~i~0 % 256); 9848#L82-1 assume !(3 == mp_add_~i~0 % 256); 9850#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9829#L61-3 assume true; 9830#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9959#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10055#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10056#L65-2 [2018-11-18 08:34:33,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 10 times [2018-11-18 08:34:33,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,785 INFO L82 PathProgramCache]: Analyzing trace with hash 891302517, now seen corresponding path program 2 times [2018-11-18 08:34:33,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:33,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 08:34:33,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:33,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:33,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:34:33,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:34:33,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:33,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 08:34:34,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:34,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-18 08:34:34,085 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:34,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 08:34:34,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:34:34,085 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. cyclomatic complexity: 269 Second operand 12 states. [2018-11-18 08:34:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:34,715 INFO L93 Difference]: Finished difference Result 1208 states and 1610 transitions. [2018-11-18 08:34:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 08:34:34,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1208 states and 1610 transitions. [2018-11-18 08:34:34,719 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1073 [2018-11-18 08:34:34,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1208 states to 1208 states and 1610 transitions. [2018-11-18 08:34:34,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1208 [2018-11-18 08:34:34,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1208 [2018-11-18 08:34:34,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1208 states and 1610 transitions. [2018-11-18 08:34:34,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:34,724 INFO L705 BuchiCegarLoop]: Abstraction has 1208 states and 1610 transitions. [2018-11-18 08:34:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states and 1610 transitions. [2018-11-18 08:34:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 631. [2018-11-18 08:34:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-11-18 08:34:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 913 transitions. [2018-11-18 08:34:34,732 INFO L728 BuchiCegarLoop]: Abstraction has 631 states and 913 transitions. [2018-11-18 08:34:34,733 INFO L608 BuchiCegarLoop]: Abstraction has 631 states and 913 transitions. [2018-11-18 08:34:34,733 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 08:34:34,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 631 states and 913 transitions. [2018-11-18 08:34:34,734 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 584 [2018-11-18 08:34:34,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:34,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:34,735 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:34,735 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:34,735 INFO L794 eck$LassoCheckResult]: Stem: 11723#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11697#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 11693#L40 assume !(0 == mp_add_~a3~0 % 256); 11690#L40-1 mp_add_~nb~0 := 4; 11691#L50 assume !(0 == mp_add_~b3~0 % 256); 11714#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11715#L61-3 assume true; 12238#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12237#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12236#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12234#L65-2 [2018-11-18 08:34:34,736 INFO L796 eck$LassoCheckResult]: Loop: 12234#L65-2 assume !(1 == mp_add_~i~0 % 256); 11727#L66-1 assume !(2 == mp_add_~i~0 % 256); 11728#L67-1 assume !(3 == mp_add_~i~0 % 256); 12304#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12301#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12286#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12285#L80-1 assume !(1 == mp_add_~i~0 % 256); 12283#L81-1 assume !(2 == mp_add_~i~0 % 256); 12282#L82-1 assume !(3 == mp_add_~i~0 % 256); 12281#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12280#L61-3 assume true; 12279#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12278#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11703#L65 assume !(0 == mp_add_~i~0 % 256); 11698#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 11699#L66-1 assume !(2 == mp_add_~i~0 % 256); 11706#L67-1 assume !(3 == mp_add_~i~0 % 256); 11707#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 11696#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12302#L76-1 assume !(0 == mp_add_~i~0 % 256); 12213#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 11806#L81-1 assume !(2 == mp_add_~i~0 % 256); 12212#L82-1 assume !(3 == mp_add_~i~0 % 256); 12210#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12209#L61-3 assume true; 12208#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12207#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12206#L65 assume !(0 == mp_add_~i~0 % 256); 12205#L65-2 assume !(1 == mp_add_~i~0 % 256); 12204#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 12140#L67-1 assume !(3 == mp_add_~i~0 % 256); 12202#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12200#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 12199#L76-1 assume !(0 == mp_add_~i~0 % 256); 12198#L80-1 assume !(1 == mp_add_~i~0 % 256); 12197#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 11803#L82-1 assume !(3 == mp_add_~i~0 % 256); 11797#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11798#L61-3 assume true; 11778#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11779#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 11720#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11692#L71 assume !(0 == mp_add_~i~0 % 256); 11686#L71-2 assume !(1 == mp_add_~i~0 % 256); 11687#L72-1 assume !(2 == mp_add_~i~0 % 256); 11717#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 12273#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12272#L76-1 assume !(0 == mp_add_~i~0 % 256); 12271#L80-1 assume !(1 == mp_add_~i~0 % 256); 12270#L81-1 assume !(2 == mp_add_~i~0 % 256); 12264#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 12153#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12154#L61-3 assume true; 12149#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12150#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12134#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 11993#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 11992#L76-1 assume !(0 == mp_add_~i~0 % 256); 11805#L80-1 assume !(1 == mp_add_~i~0 % 256); 11802#L81-1 assume !(2 == mp_add_~i~0 % 256); 11804#L82-1 assume !(3 == mp_add_~i~0 % 256); 11781#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11782#L61-3 assume true; 11749#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11750#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12233#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12234#L65-2 [2018-11-18 08:34:34,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:34,736 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 11 times [2018-11-18 08:34:34,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:34,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:34,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:34,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:34,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:34,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:34,747 INFO L82 PathProgramCache]: Analyzing trace with hash -845353895, now seen corresponding path program 1 times [2018-11-18 08:34:34,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:34,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:34,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 08:34:34,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:34,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:34,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:34,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 08:34:34,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:34:34,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-18 08:34:34,971 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:34,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 08:34:34,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-18 08:34:34,971 INFO L87 Difference]: Start difference. First operand 631 states and 913 transitions. cyclomatic complexity: 286 Second operand 11 states. [2018-11-18 08:34:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:35,579 INFO L93 Difference]: Finished difference Result 1640 states and 2286 transitions. [2018-11-18 08:34:35,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 08:34:35,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1640 states and 2286 transitions. [2018-11-18 08:34:35,583 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1459 [2018-11-18 08:34:35,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1640 states to 1625 states and 2271 transitions. [2018-11-18 08:34:35,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1625 [2018-11-18 08:34:35,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1625 [2018-11-18 08:34:35,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1625 states and 2271 transitions. [2018-11-18 08:34:35,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:35,589 INFO L705 BuchiCegarLoop]: Abstraction has 1625 states and 2271 transitions. [2018-11-18 08:34:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states and 2271 transitions. [2018-11-18 08:34:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1412. [2018-11-18 08:34:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-11-18 08:34:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2022 transitions. [2018-11-18 08:34:35,602 INFO L728 BuchiCegarLoop]: Abstraction has 1412 states and 2022 transitions. [2018-11-18 08:34:35,602 INFO L608 BuchiCegarLoop]: Abstraction has 1412 states and 2022 transitions. [2018-11-18 08:34:35,602 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 08:34:35,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1412 states and 2022 transitions. [2018-11-18 08:34:35,605 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1346 [2018-11-18 08:34:35,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:35,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:35,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:35,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:35,606 INFO L794 eck$LassoCheckResult]: Stem: 14242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 14210#L40 assume !(0 == mp_add_~a3~0 % 256); 14206#L40-1 mp_add_~nb~0 := 4; 14207#L50 assume !(0 == mp_add_~b3~0 % 256); 14234#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 14235#L61-3 assume true; 15544#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15543#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15542#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15243#L65-2 [2018-11-18 08:34:35,606 INFO L796 eck$LassoCheckResult]: Loop: 15243#L65-2 assume !(1 == mp_add_~i~0 % 256); 15541#L66-1 assume !(2 == mp_add_~i~0 % 256); 15539#L67-1 assume !(3 == mp_add_~i~0 % 256); 15540#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15449#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 15169#L71-2 assume !(1 == mp_add_~i~0 % 256); 15170#L72-1 assume !(2 == mp_add_~i~0 % 256); 15507#L73-1 assume !(3 == mp_add_~i~0 % 256); 15506#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15505#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 15504#L80-1 assume !(1 == mp_add_~i~0 % 256); 15503#L81-1 assume !(2 == mp_add_~i~0 % 256); 15502#L82-1 assume !(3 == mp_add_~i~0 % 256); 15501#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15500#L61-3 assume true; 15499#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15498#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15497#L65 assume !(0 == mp_add_~i~0 % 256); 15462#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 15237#L66-1 assume !(2 == mp_add_~i~0 % 256); 15456#L67-1 assume !(3 == mp_add_~i~0 % 256); 15457#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14208#L71 assume !(0 == mp_add_~i~0 % 256); 14209#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 15218#L72-1 assume !(2 == mp_add_~i~0 % 256); 15290#L73-1 assume !(3 == mp_add_~i~0 % 256); 15289#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15287#L76-1 assume !(0 == mp_add_~i~0 % 256); 15280#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 15199#L81-1 assume !(2 == mp_add_~i~0 % 256); 15279#L82-1 assume !(3 == mp_add_~i~0 % 256); 15278#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15277#L61-3 assume true; 15276#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15275#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15274#L65 assume !(0 == mp_add_~i~0 % 256); 15273#L65-2 assume !(1 == mp_add_~i~0 % 256); 15271#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 15231#L67-1 assume !(3 == mp_add_~i~0 % 256); 15266#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15263#L71 assume !(0 == mp_add_~i~0 % 256); 14202#L71-2 assume !(1 == mp_add_~i~0 % 256); 14203#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 15128#L73-1 assume !(3 == mp_add_~i~0 % 256); 15129#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 15204#L76-1 assume !(0 == mp_add_~i~0 % 256); 15201#L80-1 assume !(1 == mp_add_~i~0 % 256); 15197#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15191#L82-1 assume !(3 == mp_add_~i~0 % 256); 15189#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15187#L61-3 assume true; 15184#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15185#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15175#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15173#L71 assume !(0 == mp_add_~i~0 % 256); 15174#L71-2 assume !(1 == mp_add_~i~0 % 256); 15272#L72-1 assume !(2 == mp_add_~i~0 % 256); 15270#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 15268#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15269#L76-1 assume !(0 == mp_add_~i~0 % 256); 15284#L80-1 assume !(1 == mp_add_~i~0 % 256); 15281#L81-1 assume !(2 == mp_add_~i~0 % 256); 15258#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 15255#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15253#L61-3 assume true; 15251#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15245#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15227#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15316#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 15378#L76-1 assume !(0 == mp_add_~i~0 % 256); 15371#L80-1 assume !(1 == mp_add_~i~0 % 256); 15370#L81-1 assume !(2 == mp_add_~i~0 % 256); 14604#L82-1 assume !(3 == mp_add_~i~0 % 256); 14601#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14597#L61-3 assume true; 14598#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15521#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15522#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15243#L65-2 [2018-11-18 08:34:35,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 12 times [2018-11-18 08:34:35,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash -654143055, now seen corresponding path program 1 times [2018-11-18 08:34:35,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:35,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 60 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 08:34:35,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:35,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:35,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 60 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 08:34:35,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:35,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-18 08:34:35,795 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:35,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 08:34:35,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:34:35,796 INFO L87 Difference]: Start difference. First operand 1412 states and 2022 transitions. cyclomatic complexity: 618 Second operand 8 states. [2018-11-18 08:34:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:36,288 INFO L93 Difference]: Finished difference Result 2520 states and 3187 transitions. [2018-11-18 08:34:36,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 08:34:36,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2520 states and 3187 transitions. [2018-11-18 08:34:36,295 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2358 [2018-11-18 08:34:36,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2520 states to 2414 states and 2987 transitions. [2018-11-18 08:34:36,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2414 [2018-11-18 08:34:36,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2414 [2018-11-18 08:34:36,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2414 states and 2987 transitions. [2018-11-18 08:34:36,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:36,303 INFO L705 BuchiCegarLoop]: Abstraction has 2414 states and 2987 transitions. [2018-11-18 08:34:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states and 2987 transitions. [2018-11-18 08:34:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1864. [2018-11-18 08:34:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1864 states. [2018-11-18 08:34:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2347 transitions. [2018-11-18 08:34:36,322 INFO L728 BuchiCegarLoop]: Abstraction has 1864 states and 2347 transitions. [2018-11-18 08:34:36,323 INFO L608 BuchiCegarLoop]: Abstraction has 1864 states and 2347 transitions. [2018-11-18 08:34:36,323 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 08:34:36,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1864 states and 2347 transitions. [2018-11-18 08:34:36,327 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1819 [2018-11-18 08:34:36,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:36,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:36,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,328 INFO L794 eck$LassoCheckResult]: Stem: 18426#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 18404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 18399#L40 assume !(0 == mp_add_~a3~0 % 256); 18400#L40-1 mp_add_~nb~0 := 4; 18421#L50 assume !(0 == mp_add_~b3~0 % 256); 18408#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 18939#L61-3 assume true; 18938#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18937#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18936#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18773#L65-2 [2018-11-18 08:34:36,328 INFO L796 eck$LassoCheckResult]: Loop: 18773#L65-2 assume !(1 == mp_add_~i~0 % 256); 18935#L66-1 assume !(2 == mp_add_~i~0 % 256); 18934#L67-1 assume !(3 == mp_add_~i~0 % 256); 18932#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18931#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 18759#L71-2 assume !(1 == mp_add_~i~0 % 256); 18930#L72-1 assume !(2 == mp_add_~i~0 % 256); 18929#L73-1 assume !(3 == mp_add_~i~0 % 256); 18928#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18927#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 18745#L80-1 assume !(1 == mp_add_~i~0 % 256); 18926#L81-1 assume !(2 == mp_add_~i~0 % 256); 18925#L82-1 assume !(3 == mp_add_~i~0 % 256); 18924#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18923#L61-3 assume true; 18922#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18921#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18918#L65 assume !(0 == mp_add_~i~0 % 256); 18917#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 18771#L66-1 assume !(2 == mp_add_~i~0 % 256); 18916#L67-1 assume !(3 == mp_add_~i~0 % 256); 18914#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18912#L71 assume !(0 == mp_add_~i~0 % 256); 18787#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 18756#L72-1 assume !(2 == mp_add_~i~0 % 256); 18777#L73-1 assume !(3 == mp_add_~i~0 % 256); 18776#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18775#L76-1 assume !(0 == mp_add_~i~0 % 256); 18739#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 18738#L81-1 assume !(2 == mp_add_~i~0 % 256); 18737#L82-1 assume !(3 == mp_add_~i~0 % 256); 18736#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18735#L61-3 assume true; 18734#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18733#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18731#L65 assume !(0 == mp_add_~i~0 % 256); 18732#L65-2 assume !(1 == mp_add_~i~0 % 256); 18727#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 18728#L67-1 assume !(3 == mp_add_~i~0 % 256); 19082#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19081#L71 assume !(0 == mp_add_~i~0 % 256); 19080#L71-2 assume !(1 == mp_add_~i~0 % 256); 19079#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 18753#L73-1 assume !(3 == mp_add_~i~0 % 256); 19078#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19076#L76-1 assume !(0 == mp_add_~i~0 % 256); 19074#L80-1 assume !(1 == mp_add_~i~0 % 256); 19072#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 18790#L82-1 assume !(3 == mp_add_~i~0 % 256); 18980#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18973#L61-3 assume true; 18974#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18969#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18677#L65 assume !(0 == mp_add_~i~0 % 256); 18678#L65-2 assume !(1 == mp_add_~i~0 % 256); 18673#L66-1 assume !(2 == mp_add_~i~0 % 256); 18674#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 18765#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19067#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19066#L76-1 assume !(0 == mp_add_~i~0 % 256); 19065#L80-1 assume !(1 == mp_add_~i~0 % 256); 19062#L81-1 assume !(2 == mp_add_~i~0 % 256); 19060#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 18963#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19057#L61-3 assume true; 19054#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19050#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19047#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 18874#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 19038#L76-1 assume !(0 == mp_add_~i~0 % 256); 19043#L80-1 assume !(1 == mp_add_~i~0 % 256); 19041#L81-1 assume !(2 == mp_add_~i~0 % 256); 19039#L82-1 assume !(3 == mp_add_~i~0 % 256); 19036#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19034#L61-3 assume true; 19032#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19030#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19028#L65 assume !(0 == mp_add_~i~0 % 256); 19026#L65-2 assume !(1 == mp_add_~i~0 % 256); 19023#L66-1 assume !(2 == mp_add_~i~0 % 256); 19020#L67-1 assume !(3 == mp_add_~i~0 % 256); 19016#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19012#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19011#L76-1 assume !(0 == mp_add_~i~0 % 256); 19010#L80-1 assume !(1 == mp_add_~i~0 % 256); 19009#L81-1 assume !(2 == mp_add_~i~0 % 256); 19008#L82-1 assume !(3 == mp_add_~i~0 % 256); 19007#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19006#L61-3 assume true; 19004#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19001#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 18999#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 18894#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 18983#L76-1 assume !(0 == mp_add_~i~0 % 256); 18967#L80-1 assume !(1 == mp_add_~i~0 % 256); 18968#L81-1 assume !(2 == mp_add_~i~0 % 256); 19013#L82-1 assume !(3 == mp_add_~i~0 % 256); 18949#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18950#L61-3 assume true; 18945#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18946#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18919#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18773#L65-2 [2018-11-18 08:34:36,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,328 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 13 times [2018-11-18 08:34:36,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,340 INFO L82 PathProgramCache]: Analyzing trace with hash -898460409, now seen corresponding path program 1 times [2018-11-18 08:34:36,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:36,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 161 proven. 3 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-18 08:34:36,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:36,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:36,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:36,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 161 proven. 3 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-18 08:34:36,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:36,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-18 08:34:36,475 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:36,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:36,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:36,475 INFO L87 Difference]: Start difference. First operand 1864 states and 2347 transitions. cyclomatic complexity: 490 Second operand 4 states. [2018-11-18 08:34:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:36,512 INFO L93 Difference]: Finished difference Result 1703 states and 1965 transitions. [2018-11-18 08:34:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:36,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1703 states and 1965 transitions. [2018-11-18 08:34:36,517 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1657 [2018-11-18 08:34:36,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1703 states to 1703 states and 1965 transitions. [2018-11-18 08:34:36,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1703 [2018-11-18 08:34:36,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1703 [2018-11-18 08:34:36,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1703 states and 1965 transitions. [2018-11-18 08:34:36,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:36,522 INFO L705 BuchiCegarLoop]: Abstraction has 1703 states and 1965 transitions. [2018-11-18 08:34:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states and 1965 transitions. [2018-11-18 08:34:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1293. [2018-11-18 08:34:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1293 states. [2018-11-18 08:34:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1552 transitions. [2018-11-18 08:34:36,535 INFO L728 BuchiCegarLoop]: Abstraction has 1293 states and 1552 transitions. [2018-11-18 08:34:36,535 INFO L608 BuchiCegarLoop]: Abstraction has 1293 states and 1552 transitions. [2018-11-18 08:34:36,535 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 08:34:36,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1293 states and 1552 transitions. [2018-11-18 08:34:36,538 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1248 [2018-11-18 08:34:36,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:36,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:36,538 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,538 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,539 INFO L794 eck$LassoCheckResult]: Stem: 22306#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 22282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 22277#L40 assume !(0 == mp_add_~a3~0 % 256); 22278#L40-1 mp_add_~nb~0 := 4; 22682#L50 assume !(0 == mp_add_~b3~0 % 256); 22679#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 22678#L61-3 assume true; 22677#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22676#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22675#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22429#L65-2 [2018-11-18 08:34:36,539 INFO L796 eck$LassoCheckResult]: Loop: 22429#L65-2 assume !(1 == mp_add_~i~0 % 256); 22674#L66-1 assume !(2 == mp_add_~i~0 % 256); 22673#L67-1 assume !(3 == mp_add_~i~0 % 256); 22672#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22671#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 22568#L71-2 assume !(1 == mp_add_~i~0 % 256); 22670#L72-1 assume !(2 == mp_add_~i~0 % 256); 22669#L73-1 assume !(3 == mp_add_~i~0 % 256); 22668#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22667#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 22439#L80-1 assume !(1 == mp_add_~i~0 % 256); 22666#L81-1 assume !(2 == mp_add_~i~0 % 256); 22665#L82-1 assume !(3 == mp_add_~i~0 % 256); 22664#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22663#L61-3 assume true; 22627#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22625#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22600#L65 assume !(0 == mp_add_~i~0 % 256); 22597#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 22571#L66-1 assume !(2 == mp_add_~i~0 % 256); 22579#L67-1 assume !(3 == mp_add_~i~0 % 256); 22580#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22576#L71 assume !(0 == mp_add_~i~0 % 256); 22575#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 22404#L72-1 assume !(2 == mp_add_~i~0 % 256); 22574#L73-1 assume !(3 == mp_add_~i~0 % 256); 22573#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22569#L76-1 assume !(0 == mp_add_~i~0 % 256); 22567#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22566#L81-1 assume !(2 == mp_add_~i~0 % 256); 22565#L82-1 assume !(3 == mp_add_~i~0 % 256); 22564#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22563#L61-3 assume true; 22554#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22551#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22548#L65 assume !(0 == mp_add_~i~0 % 256); 22545#L65-2 assume !(1 == mp_add_~i~0 % 256); 22326#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 22327#L67-1 assume !(3 == mp_add_~i~0 % 256); 22517#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22516#L71 assume !(0 == mp_add_~i~0 % 256); 22515#L71-2 assume !(1 == mp_add_~i~0 % 256); 22514#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 22314#L73-1 assume !(3 == mp_add_~i~0 % 256); 22512#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22513#L76-1 assume !(0 == mp_add_~i~0 % 256); 22508#L80-1 assume !(1 == mp_add_~i~0 % 256); 22509#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 22662#L82-1 assume !(3 == mp_add_~i~0 % 256); 22661#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22660#L61-3 assume true; 22659#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22498#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22499#L65 assume !(0 == mp_add_~i~0 % 256); 22504#L65-2 assume !(1 == mp_add_~i~0 % 256); 22501#L66-1 assume !(2 == mp_add_~i~0 % 256); 22497#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 22415#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22648#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22647#L76-1 assume !(0 == mp_add_~i~0 % 256); 22646#L80-1 assume !(1 == mp_add_~i~0 % 256); 22645#L81-1 assume !(2 == mp_add_~i~0 % 256); 22644#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 22643#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22642#L61-3 assume true; 22641#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22639#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22634#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22633#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 22632#L76-1 assume !(0 == mp_add_~i~0 % 256); 22631#L80-1 assume !(1 == mp_add_~i~0 % 256); 22630#L81-1 assume !(2 == mp_add_~i~0 % 256); 22629#L82-1 assume !(3 == mp_add_~i~0 % 256); 22628#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22626#L61-3 assume true; 22624#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22623#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22622#L65 assume !(0 == mp_add_~i~0 % 256); 22621#L65-2 assume !(1 == mp_add_~i~0 % 256); 22620#L66-1 assume !(2 == mp_add_~i~0 % 256); 22619#L67-1 assume !(3 == mp_add_~i~0 % 256); 22618#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22617#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 22616#L76-1 assume !(0 == mp_add_~i~0 % 256); 22615#L80-1 assume !(1 == mp_add_~i~0 % 256); 22614#L81-1 assume !(2 == mp_add_~i~0 % 256); 22613#L82-1 assume !(3 == mp_add_~i~0 % 256); 22612#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22611#L61-3 assume true; 22610#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22609#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22608#L65 assume !(0 == mp_add_~i~0 % 256); 22607#L65-2 assume !(1 == mp_add_~i~0 % 256); 22606#L66-1 assume !(2 == mp_add_~i~0 % 256); 22605#L67-1 assume !(3 == mp_add_~i~0 % 256); 22603#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22598#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 22599#L76-1 assume !(0 == mp_add_~i~0 % 256); 22590#L80-1 assume !(1 == mp_add_~i~0 % 256); 22588#L81-1 assume !(2 == mp_add_~i~0 % 256); 22586#L82-1 assume !(3 == mp_add_~i~0 % 256); 22585#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22584#L61-3 assume true; 22583#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22581#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22582#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22429#L65-2 [2018-11-18 08:34:36,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 14 times [2018-11-18 08:34:36,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:36,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1932539245, now seen corresponding path program 2 times [2018-11-18 08:34:36,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:36,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-18 08:34:36,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:36,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:34:36,642 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:34:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:34:36,643 INFO L87 Difference]: Start difference. First operand 1293 states and 1552 transitions. cyclomatic complexity: 266 Second operand 6 states. [2018-11-18 08:34:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:36,783 INFO L93 Difference]: Finished difference Result 1954 states and 2239 transitions. [2018-11-18 08:34:36,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:34:36,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1954 states and 2239 transitions. [2018-11-18 08:34:36,788 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1569 [2018-11-18 08:34:36,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1954 states to 1612 states and 1854 transitions. [2018-11-18 08:34:36,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1612 [2018-11-18 08:34:36,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1612 [2018-11-18 08:34:36,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1612 states and 1854 transitions. [2018-11-18 08:34:36,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:36,795 INFO L705 BuchiCegarLoop]: Abstraction has 1612 states and 1854 transitions. [2018-11-18 08:34:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states and 1854 transitions. [2018-11-18 08:34:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 946. [2018-11-18 08:34:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-11-18 08:34:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1125 transitions. [2018-11-18 08:34:36,809 INFO L728 BuchiCegarLoop]: Abstraction has 946 states and 1125 transitions. [2018-11-18 08:34:36,810 INFO L608 BuchiCegarLoop]: Abstraction has 946 states and 1125 transitions. [2018-11-18 08:34:36,810 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-18 08:34:36,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1125 transitions. [2018-11-18 08:34:36,811 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 915 [2018-11-18 08:34:36,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:36,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:36,812 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,812 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,812 INFO L794 eck$LassoCheckResult]: Stem: 25565#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 25546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 25541#L40 assume !(0 == mp_add_~a3~0 % 256); 25542#L40-1 mp_add_~nb~0 := 4; 25561#L50 assume !(0 == mp_add_~b3~0 % 256); 25549#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 25700#L61-3 assume true; 25701#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25697#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25589#L65 [2018-11-18 08:34:36,812 INFO L796 eck$LassoCheckResult]: Loop: 25589#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 25590#L65-2 assume !(1 == mp_add_~i~0 % 256); 25585#L66-1 assume !(2 == mp_add_~i~0 % 256); 25586#L67-1 assume !(3 == mp_add_~i~0 % 256); 25571#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25572#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 25821#L71-2 assume !(1 == mp_add_~i~0 % 256); 26102#L72-1 assume !(2 == mp_add_~i~0 % 256); 26098#L73-1 assume !(3 == mp_add_~i~0 % 256); 26099#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 26094#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 26095#L80-1 assume !(1 == mp_add_~i~0 % 256); 26091#L81-1 assume !(2 == mp_add_~i~0 % 256); 26092#L82-1 assume !(3 == mp_add_~i~0 % 256); 26087#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26088#L61-3 assume true; 26083#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26084#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26071#L65 assume !(0 == mp_add_~i~0 % 256); 26072#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 25842#L66-1 assume !(2 == mp_add_~i~0 % 256); 26065#L67-1 assume !(3 == mp_add_~i~0 % 256); 26059#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26060#L71 assume !(0 == mp_add_~i~0 % 256); 26053#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 26054#L72-1 assume !(2 == mp_add_~i~0 % 256); 26050#L73-1 assume !(3 == mp_add_~i~0 % 256); 26051#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 26330#L76-1 assume !(0 == mp_add_~i~0 % 256); 26329#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 26037#L81-1 assume !(2 == mp_add_~i~0 % 256); 26328#L82-1 assume !(3 == mp_add_~i~0 % 256); 26327#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26326#L61-3 assume true; 26325#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26324#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26015#L65 assume !(0 == mp_add_~i~0 % 256); 26016#L65-2 assume !(1 == mp_add_~i~0 % 256); 26011#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 26012#L67-1 assume !(3 == mp_add_~i~0 % 256); 26007#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26008#L71 assume !(0 == mp_add_~i~0 % 256); 26003#L71-2 assume !(1 == mp_add_~i~0 % 256); 26004#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 25813#L73-1 assume !(3 == mp_add_~i~0 % 256); 26000#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25994#L76-1 assume !(0 == mp_add_~i~0 % 256); 25995#L80-1 assume !(1 == mp_add_~i~0 % 256); 25986#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 25987#L82-1 assume !(3 == mp_add_~i~0 % 256); 25980#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25971#L61-3 assume true; 25969#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25967#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25968#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25535#L71 assume !(0 == mp_add_~i~0 % 256); 25536#L71-2 assume !(1 == mp_add_~i~0 % 256); 26362#L72-1 assume !(2 == mp_add_~i~0 % 256); 26361#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 26339#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 26356#L76-1 assume !(0 == mp_add_~i~0 % 256); 26354#L80-1 assume !(1 == mp_add_~i~0 % 256); 26352#L81-1 assume !(2 == mp_add_~i~0 % 256); 26350#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 25705#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26348#L61-3 assume true; 26347#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26346#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26279#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26191#L71 assume !(0 == mp_add_~i~0 % 256); 26192#L71-2 assume !(1 == mp_add_~i~0 % 256); 26116#L72-1 assume !(2 == mp_add_~i~0 % 256); 26117#L73-1 assume !(3 == mp_add_~i~0 % 256); 25996#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 25997#L76-1 assume !(0 == mp_add_~i~0 % 256); 25988#L80-1 assume !(1 == mp_add_~i~0 % 256); 25989#L81-1 assume !(2 == mp_add_~i~0 % 256); 25981#L82-1 assume !(3 == mp_add_~i~0 % 256); 25982#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25976#L61-3 assume true; 25977#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25972#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25973#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25952#L71 assume !(0 == mp_add_~i~0 % 256); 25953#L71-2 assume !(1 == mp_add_~i~0 % 256); 25946#L72-1 assume !(2 == mp_add_~i~0 % 256); 25947#L73-1 assume !(3 == mp_add_~i~0 % 256); 25940#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 25941#L76-1 assume !(0 == mp_add_~i~0 % 256); 25933#L80-1 assume !(1 == mp_add_~i~0 % 256); 25934#L81-1 assume !(2 == mp_add_~i~0 % 256); 25858#L82-1 assume !(3 == mp_add_~i~0 % 256); 25859#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25810#L61-3 assume true; 25811#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25778#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25776#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25777#L71 assume !(0 == mp_add_~i~0 % 256); 26342#L71-2 assume !(1 == mp_add_~i~0 % 256); 25771#L72-1 assume !(2 == mp_add_~i~0 % 256); 25772#L73-1 assume !(3 == mp_add_~i~0 % 256); 25766#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 25767#L76-1 assume !(0 == mp_add_~i~0 % 256); 25710#L80-1 assume !(1 == mp_add_~i~0 % 256); 25711#L81-1 assume !(2 == mp_add_~i~0 % 256); 25704#L82-1 assume !(3 == mp_add_~i~0 % 256); 25706#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25788#L61-3 assume true; 25789#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25781#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25589#L65 [2018-11-18 08:34:36,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash -685617880, now seen corresponding path program 1 times [2018-11-18 08:34:36,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:36,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash -895958315, now seen corresponding path program 1 times [2018-11-18 08:34:36,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:36,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 185 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 08:34:37,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:37,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:37,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:37,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 246 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-18 08:34:37,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:37,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 20 [2018-11-18 08:34:37,628 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:37,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 08:34:37,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-11-18 08:34:37,628 INFO L87 Difference]: Start difference. First operand 946 states and 1125 transitions. cyclomatic complexity: 184 Second operand 21 states. [2018-11-18 08:34:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:40,084 INFO L93 Difference]: Finished difference Result 1688 states and 2008 transitions. [2018-11-18 08:34:40,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-18 08:34:40,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 2008 transitions. [2018-11-18 08:34:40,089 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1452 [2018-11-18 08:34:40,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1682 states and 2002 transitions. [2018-11-18 08:34:40,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1682 [2018-11-18 08:34:40,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1682 [2018-11-18 08:34:40,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1682 states and 2002 transitions. [2018-11-18 08:34:40,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:40,098 INFO L705 BuchiCegarLoop]: Abstraction has 1682 states and 2002 transitions. [2018-11-18 08:34:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states and 2002 transitions. [2018-11-18 08:34:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 854. [2018-11-18 08:34:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-11-18 08:34:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1012 transitions. [2018-11-18 08:34:40,113 INFO L728 BuchiCegarLoop]: Abstraction has 854 states and 1012 transitions. [2018-11-18 08:34:40,113 INFO L608 BuchiCegarLoop]: Abstraction has 854 states and 1012 transitions. [2018-11-18 08:34:40,113 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-18 08:34:40,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 854 states and 1012 transitions. [2018-11-18 08:34:40,114 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 813 [2018-11-18 08:34:40,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:40,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:40,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:40,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:40,116 INFO L794 eck$LassoCheckResult]: Stem: 28664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 28646#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 28641#L40 assume !(0 == mp_add_~a3~0 % 256); 28642#L40-1 mp_add_~nb~0 := 4; 29072#L50 assume !(0 == mp_add_~b3~0 % 256); 29069#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 29068#L61-3 assume true; 29067#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29066#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28665#L65 [2018-11-18 08:34:40,116 INFO L796 eck$LassoCheckResult]: Loop: 28665#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 28666#L65-2 assume !(1 == mp_add_~i~0 % 256); 29224#L66-1 assume !(2 == mp_add_~i~0 % 256); 29223#L67-1 assume !(3 == mp_add_~i~0 % 256); 29222#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29221#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 28799#L71-2 assume !(1 == mp_add_~i~0 % 256); 29220#L72-1 assume !(2 == mp_add_~i~0 % 256); 29219#L73-1 assume !(3 == mp_add_~i~0 % 256); 29218#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29217#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 28792#L80-1 assume !(1 == mp_add_~i~0 % 256); 29216#L81-1 assume !(2 == mp_add_~i~0 % 256); 29215#L82-1 assume !(3 == mp_add_~i~0 % 256); 29214#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29213#L61-3 assume true; 29212#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29211#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29210#L65 assume !(0 == mp_add_~i~0 % 256); 29209#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 28716#L66-1 assume !(2 == mp_add_~i~0 % 256); 29204#L67-1 assume !(3 == mp_add_~i~0 % 256); 29205#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29197#L71 assume !(0 == mp_add_~i~0 % 256); 29194#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 28797#L72-1 assume !(2 == mp_add_~i~0 % 256); 29193#L73-1 assume !(3 == mp_add_~i~0 % 256); 29192#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29191#L76-1 assume !(0 == mp_add_~i~0 % 256); 29190#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 28790#L81-1 assume !(2 == mp_add_~i~0 % 256); 29189#L82-1 assume !(3 == mp_add_~i~0 % 256); 29188#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29187#L61-3 assume true; 29186#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28889#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28886#L65 assume !(0 == mp_add_~i~0 % 256); 28883#L65-2 assume !(1 == mp_add_~i~0 % 256); 28882#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 28714#L67-1 assume !(3 == mp_add_~i~0 % 256); 28876#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28874#L71 assume !(0 == mp_add_~i~0 % 256); 28871#L71-2 assume !(1 == mp_add_~i~0 % 256); 28868#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 28733#L73-1 assume !(3 == mp_add_~i~0 % 256); 28863#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 28860#L76-1 assume !(0 == mp_add_~i~0 % 256); 28857#L80-1 assume !(1 == mp_add_~i~0 % 256); 28854#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 28699#L82-1 assume !(3 == mp_add_~i~0 % 256); 28849#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28846#L61-3 assume true; 28843#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28839#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28836#L65 assume !(0 == mp_add_~i~0 % 256); 28834#L65-2 assume !(1 == mp_add_~i~0 % 256); 28831#L66-1 assume !(2 == mp_add_~i~0 % 256); 28828#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 28710#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28822#L71 assume !(0 == mp_add_~i~0 % 256); 28818#L71-2 assume !(1 == mp_add_~i~0 % 256); 28815#L72-1 assume !(2 == mp_add_~i~0 % 256); 28812#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 28731#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 28806#L76-1 assume !(0 == mp_add_~i~0 % 256); 28804#L80-1 assume !(1 == mp_add_~i~0 % 256); 28788#L81-1 assume !(2 == mp_add_~i~0 % 256); 28787#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 28696#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28785#L61-3 assume true; 28784#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28782#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28783#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28904#L71 assume !(0 == mp_add_~i~0 % 256); 28905#L71-2 assume !(1 == mp_add_~i~0 % 256); 28900#L72-1 assume !(2 == mp_add_~i~0 % 256); 28901#L73-1 assume !(3 == mp_add_~i~0 % 256); 28896#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28897#L76-1 assume !(0 == mp_add_~i~0 % 256); 28892#L80-1 assume !(1 == mp_add_~i~0 % 256); 28893#L81-1 assume !(2 == mp_add_~i~0 % 256); 28887#L82-1 assume !(3 == mp_add_~i~0 % 256); 28888#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28880#L61-3 assume true; 28881#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28875#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28763#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28869#L71 assume !(0 == mp_add_~i~0 % 256); 28870#L71-2 assume !(1 == mp_add_~i~0 % 256); 28864#L72-1 assume !(2 == mp_add_~i~0 % 256); 28865#L73-1 assume !(3 == mp_add_~i~0 % 256); 28858#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28859#L76-1 assume !(0 == mp_add_~i~0 % 256); 28852#L80-1 assume !(1 == mp_add_~i~0 % 256); 28853#L81-1 assume !(2 == mp_add_~i~0 % 256); 28847#L82-1 assume !(3 == mp_add_~i~0 % 256); 28848#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28841#L61-3 assume true; 28842#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28835#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28743#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28829#L71 assume !(0 == mp_add_~i~0 % 256); 28830#L71-2 assume !(1 == mp_add_~i~0 % 256); 28823#L72-1 assume !(2 == mp_add_~i~0 % 256); 28824#L73-1 assume !(3 == mp_add_~i~0 % 256); 28816#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28817#L76-1 assume !(0 == mp_add_~i~0 % 256); 28810#L80-1 assume !(1 == mp_add_~i~0 % 256); 28811#L81-1 assume !(2 == mp_add_~i~0 % 256); 28805#L82-1 assume !(3 == mp_add_~i~0 % 256); 28803#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28802#L61-3 assume true; 28801#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28712#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28708#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28707#L71 assume !(0 == mp_add_~i~0 % 256); 28706#L71-2 assume !(1 == mp_add_~i~0 % 256); 28705#L72-1 assume !(2 == mp_add_~i~0 % 256); 28704#L73-1 assume !(3 == mp_add_~i~0 % 256); 28703#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28702#L76-1 assume !(0 == mp_add_~i~0 % 256); 28700#L80-1 assume !(1 == mp_add_~i~0 % 256); 28701#L81-1 assume !(2 == mp_add_~i~0 % 256); 28786#L82-1 assume !(3 == mp_add_~i~0 % 256); 28694#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28693#L61-3 assume true; 28692#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28690#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28689#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28688#L71 assume !(0 == mp_add_~i~0 % 256); 28687#L71-2 assume !(1 == mp_add_~i~0 % 256); 28686#L72-1 assume !(2 == mp_add_~i~0 % 256); 28684#L73-1 assume !(3 == mp_add_~i~0 % 256); 28683#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28682#L76-1 assume !(0 == mp_add_~i~0 % 256); 28680#L80-1 assume !(1 == mp_add_~i~0 % 256); 28681#L81-1 assume !(2 == mp_add_~i~0 % 256); 28676#L82-1 assume !(3 == mp_add_~i~0 % 256); 28675#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28674#L61-3 assume true; 28672#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28673#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28665#L65 [2018-11-18 08:34:40,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash -685617880, now seen corresponding path program 2 times [2018-11-18 08:34:40,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:40,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:40,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:40,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:40,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:40,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1265317757, now seen corresponding path program 1 times [2018-11-18 08:34:40,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:40,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:40,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:40,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 252 proven. 210 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 08:34:40,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:40,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:40,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-11-18 08:34:40,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:34:40,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-11-18 08:34:40,538 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:40,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 08:34:40,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-18 08:34:40,539 INFO L87 Difference]: Start difference. First operand 854 states and 1012 transitions. cyclomatic complexity: 164 Second operand 15 states. [2018-11-18 08:34:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:42,796 INFO L93 Difference]: Finished difference Result 1390 states and 1545 transitions. [2018-11-18 08:34:42,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-18 08:34:42,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1390 states and 1545 transitions. [2018-11-18 08:34:42,800 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 589 [2018-11-18 08:34:42,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1390 states to 1390 states and 1545 transitions. [2018-11-18 08:34:42,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1390 [2018-11-18 08:34:42,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1390 [2018-11-18 08:34:42,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1390 states and 1545 transitions. [2018-11-18 08:34:42,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:42,805 INFO L705 BuchiCegarLoop]: Abstraction has 1390 states and 1545 transitions. [2018-11-18 08:34:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states and 1545 transitions. [2018-11-18 08:34:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 657. [2018-11-18 08:34:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-18 08:34:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 768 transitions. [2018-11-18 08:34:42,822 INFO L728 BuchiCegarLoop]: Abstraction has 657 states and 768 transitions. [2018-11-18 08:34:42,822 INFO L608 BuchiCegarLoop]: Abstraction has 657 states and 768 transitions. [2018-11-18 08:34:42,822 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-18 08:34:42,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 657 states and 768 transitions. [2018-11-18 08:34:42,823 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 445 [2018-11-18 08:34:42,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:42,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:42,824 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:42,824 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:42,824 INFO L794 eck$LassoCheckResult]: Stem: 31416#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 31398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 31394#L40 assume !(0 == mp_add_~a3~0 % 256); 31390#L40-1 mp_add_~nb~0 := 4; 31391#L50 assume !(0 == mp_add_~b3~0 % 256); 31408#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 31409#L61-3 assume true; 31428#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31429#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31421#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 31422#L65-2 [2018-11-18 08:34:42,824 INFO L796 eck$LassoCheckResult]: Loop: 31422#L65-2 assume !(1 == mp_add_~i~0 % 256); 31725#L66-1 assume !(2 == mp_add_~i~0 % 256); 31726#L67-1 assume !(3 == mp_add_~i~0 % 256); 31720#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31721#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 31577#L71-2 assume !(1 == mp_add_~i~0 % 256); 31717#L72-1 assume !(2 == mp_add_~i~0 % 256); 31713#L73-1 assume !(3 == mp_add_~i~0 % 256); 31714#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31710#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 31536#L80-1 assume !(1 == mp_add_~i~0 % 256); 31706#L81-1 assume !(2 == mp_add_~i~0 % 256); 31707#L82-1 assume !(3 == mp_add_~i~0 % 256); 31702#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31703#L61-3 assume true; 31698#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31699#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31923#L65 assume !(0 == mp_add_~i~0 % 256); 31694#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 31579#L66-1 assume !(2 == mp_add_~i~0 % 256); 31656#L67-1 assume !(3 == mp_add_~i~0 % 256); 31657#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31589#L71 assume !(0 == mp_add_~i~0 % 256); 31590#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 31460#L72-1 assume !(2 == mp_add_~i~0 % 256); 31586#L73-1 assume !(3 == mp_add_~i~0 % 256); 31582#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31583#L76-1 assume !(0 == mp_add_~i~0 % 256); 31576#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 31575#L81-1 assume !(2 == mp_add_~i~0 % 256); 31571#L82-1 assume !(3 == mp_add_~i~0 % 256); 31572#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31922#L61-3 assume true; 31921#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31566#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31565#L65 assume !(0 == mp_add_~i~0 % 256); 31564#L65-2 assume !(1 == mp_add_~i~0 % 256); 31563#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 31471#L67-1 assume !(3 == mp_add_~i~0 % 256); 31561#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31560#L71 assume !(0 == mp_add_~i~0 % 256); 31559#L71-2 assume !(1 == mp_add_~i~0 % 256); 31558#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 31457#L73-1 assume !(3 == mp_add_~i~0 % 256); 31557#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31556#L76-1 assume !(0 == mp_add_~i~0 % 256); 31555#L80-1 assume !(1 == mp_add_~i~0 % 256); 31554#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 31531#L82-1 assume !(3 == mp_add_~i~0 % 256); 31553#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31552#L61-3 assume true; 31551#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31549#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31548#L65 assume !(0 == mp_add_~i~0 % 256); 31547#L65-2 assume !(1 == mp_add_~i~0 % 256); 31546#L66-1 assume !(2 == mp_add_~i~0 % 256); 31545#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 31468#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31544#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31649#L76-1 assume !(0 == mp_add_~i~0 % 256); 31648#L80-1 assume !(1 == mp_add_~i~0 % 256); 31647#L81-1 assume !(2 == mp_add_~i~0 % 256); 31646#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 31607#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31645#L61-3 assume true; 31644#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31643#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31642#L65 assume !(0 == mp_add_~i~0 % 256); 31641#L65-2 assume !(1 == mp_add_~i~0 % 256); 31640#L66-1 assume !(2 == mp_add_~i~0 % 256); 31639#L67-1 assume !(3 == mp_add_~i~0 % 256); 31638#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31514#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31637#L76-1 assume !(0 == mp_add_~i~0 % 256); 31636#L80-1 assume !(1 == mp_add_~i~0 % 256); 31635#L81-1 assume !(2 == mp_add_~i~0 % 256); 31634#L82-1 assume !(3 == mp_add_~i~0 % 256); 31633#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31632#L61-3 assume true; 31631#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31630#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31629#L65 assume !(0 == mp_add_~i~0 % 256); 31628#L65-2 assume !(1 == mp_add_~i~0 % 256); 31627#L66-1 assume !(2 == mp_add_~i~0 % 256); 31626#L67-1 assume !(3 == mp_add_~i~0 % 256); 31625#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31494#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31624#L76-1 assume !(0 == mp_add_~i~0 % 256); 31623#L80-1 assume !(1 == mp_add_~i~0 % 256); 31622#L81-1 assume !(2 == mp_add_~i~0 % 256); 31621#L82-1 assume !(3 == mp_add_~i~0 % 256); 31620#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31619#L61-3 assume true; 31618#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31617#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31616#L65 assume !(0 == mp_add_~i~0 % 256); 31615#L65-2 assume !(1 == mp_add_~i~0 % 256); 31614#L66-1 assume !(2 == mp_add_~i~0 % 256); 31613#L67-1 assume !(3 == mp_add_~i~0 % 256); 31612#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31578#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31610#L76-1 assume !(0 == mp_add_~i~0 % 256); 31609#L80-1 assume !(1 == mp_add_~i~0 % 256); 31608#L81-1 assume !(2 == mp_add_~i~0 % 256); 31606#L82-1 assume !(3 == mp_add_~i~0 % 256); 31605#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31604#L61-3 assume true; 31603#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31602#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31601#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 31422#L65-2 [2018-11-18 08:34:42,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:42,825 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 15 times [2018-11-18 08:34:42,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:42,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:42,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:42,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:42,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:42,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1781275489, now seen corresponding path program 1 times [2018-11-18 08:34:42,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:42,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:42,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:42,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 168 proven. 75 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 08:34:42,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:42,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:42,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:42,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 167 proven. 48 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-18 08:34:43,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:43,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-11-18 08:34:43,170 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 08:34:43,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-18 08:34:43,170 INFO L87 Difference]: Start difference. First operand 657 states and 768 transitions. cyclomatic complexity: 116 Second operand 13 states. [2018-11-18 08:34:44,542 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-18 08:34:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:44,899 INFO L93 Difference]: Finished difference Result 991 states and 1096 transitions. [2018-11-18 08:34:44,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 08:34:44,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 991 states and 1096 transitions. [2018-11-18 08:34:44,900 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 376 [2018-11-18 08:34:44,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 991 states to 987 states and 1092 transitions. [2018-11-18 08:34:44,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 987 [2018-11-18 08:34:44,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 987 [2018-11-18 08:34:44,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 987 states and 1092 transitions. [2018-11-18 08:34:44,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:44,903 INFO L705 BuchiCegarLoop]: Abstraction has 987 states and 1092 transitions. [2018-11-18 08:34:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states and 1092 transitions. [2018-11-18 08:34:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 608. [2018-11-18 08:34:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-11-18 08:34:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 693 transitions. [2018-11-18 08:34:44,909 INFO L728 BuchiCegarLoop]: Abstraction has 608 states and 693 transitions. [2018-11-18 08:34:44,909 INFO L608 BuchiCegarLoop]: Abstraction has 608 states and 693 transitions. [2018-11-18 08:34:44,909 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-18 08:34:44,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 608 states and 693 transitions. [2018-11-18 08:34:44,910 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 293 [2018-11-18 08:34:44,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:44,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:44,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:44,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:44,911 INFO L794 eck$LassoCheckResult]: Stem: 33468#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 33449#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 33444#L40 assume !(0 == mp_add_~a3~0 % 256); 33445#L40-1 mp_add_~nb~0 := 4; 33461#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 33463#L52 assume !(0 == mp_add_~b2~0 % 256); 33452#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 33643#L61-3 assume true; 33641#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33640#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33635#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 33629#L65-2 assume !(1 == mp_add_~i~0 % 256); 33623#L66-1 assume !(2 == mp_add_~i~0 % 256); 33617#L67-1 assume !(3 == mp_add_~i~0 % 256); 33611#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33608#L70 [2018-11-18 08:34:44,912 INFO L796 eck$LassoCheckResult]: Loop: 33608#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 33965#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 33692#L80-1 assume !(1 == mp_add_~i~0 % 256); 33964#L81-1 assume !(2 == mp_add_~i~0 % 256); 33963#L82-1 assume !(3 == mp_add_~i~0 % 256); 33962#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33961#L61-3 assume true; 33960#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33959#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33958#L65 assume !(0 == mp_add_~i~0 % 256); 33957#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 33952#L66-1 assume !(2 == mp_add_~i~0 % 256); 33956#L67-1 assume !(3 == mp_add_~i~0 % 256); 33955#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33954#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 33953#L76-1 assume !(0 == mp_add_~i~0 % 256); 33951#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 33950#L81-1 assume !(2 == mp_add_~i~0 % 256); 33949#L82-1 assume !(3 == mp_add_~i~0 % 256); 33948#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33947#L61-3 assume true; 33946#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33945#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33944#L65 assume !(0 == mp_add_~i~0 % 256); 33943#L65-2 assume !(1 == mp_add_~i~0 % 256); 33942#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 33874#L67-1 assume !(3 == mp_add_~i~0 % 256); 33941#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33940#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 33939#L76-1 assume !(0 == mp_add_~i~0 % 256); 33938#L80-1 assume !(1 == mp_add_~i~0 % 256); 33937#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 33862#L82-1 assume !(3 == mp_add_~i~0 % 256); 33936#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33935#L61-3 assume true; 33934#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33933#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33932#L65 assume !(0 == mp_add_~i~0 % 256); 33931#L65-2 assume !(1 == mp_add_~i~0 % 256); 33930#L66-1 assume !(2 == mp_add_~i~0 % 256); 33929#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 33871#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33928#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 33927#L76-1 assume !(0 == mp_add_~i~0 % 256); 33926#L80-1 assume !(1 == mp_add_~i~0 % 256); 33925#L81-1 assume !(2 == mp_add_~i~0 % 256); 33924#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 33860#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33923#L61-3 assume true; 33922#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33921#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33920#L65 assume !(0 == mp_add_~i~0 % 256); 33919#L65-2 assume !(1 == mp_add_~i~0 % 256); 33918#L66-1 assume !(2 == mp_add_~i~0 % 256); 33917#L67-1 assume !(3 == mp_add_~i~0 % 256); 33916#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33915#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 33914#L76-1 assume !(0 == mp_add_~i~0 % 256); 33913#L80-1 assume !(1 == mp_add_~i~0 % 256); 33912#L81-1 assume !(2 == mp_add_~i~0 % 256); 33911#L82-1 assume !(3 == mp_add_~i~0 % 256); 33910#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33909#L61-3 assume true; 33908#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33907#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33906#L65 assume !(0 == mp_add_~i~0 % 256); 33905#L65-2 assume !(1 == mp_add_~i~0 % 256); 33904#L66-1 assume !(2 == mp_add_~i~0 % 256); 33903#L67-1 assume !(3 == mp_add_~i~0 % 256); 33902#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33901#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 33900#L76-1 assume !(0 == mp_add_~i~0 % 256); 33899#L80-1 assume !(1 == mp_add_~i~0 % 256); 33898#L81-1 assume !(2 == mp_add_~i~0 % 256); 33897#L82-1 assume !(3 == mp_add_~i~0 % 256); 33896#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33895#L61-3 assume true; 33894#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33893#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33892#L65 assume !(0 == mp_add_~i~0 % 256); 33891#L65-2 assume !(1 == mp_add_~i~0 % 256); 33890#L66-1 assume !(2 == mp_add_~i~0 % 256); 33889#L67-1 assume !(3 == mp_add_~i~0 % 256); 33888#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33887#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 33886#L76-1 assume !(0 == mp_add_~i~0 % 256); 33885#L80-1 assume !(1 == mp_add_~i~0 % 256); 33884#L81-1 assume !(2 == mp_add_~i~0 % 256); 33883#L82-1 assume !(3 == mp_add_~i~0 % 256); 33882#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33881#L61-3 assume true; 33880#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33879#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33878#L65 assume !(0 == mp_add_~i~0 % 256); 33876#L65-2 assume !(1 == mp_add_~i~0 % 256); 33877#L66-1 assume !(2 == mp_add_~i~0 % 256); 33870#L67-1 assume !(3 == mp_add_~i~0 % 256); 33872#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33866#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 33867#L76-1 assume !(0 == mp_add_~i~0 % 256); 33863#L80-1 assume !(1 == mp_add_~i~0 % 256); 33861#L81-1 assume !(2 == mp_add_~i~0 % 256); 33859#L82-1 assume !(3 == mp_add_~i~0 % 256); 33858#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33857#L61-3 assume true; 33856#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33855#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33852#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 33853#L65-2 assume !(1 == mp_add_~i~0 % 256); 33968#L66-1 assume !(2 == mp_add_~i~0 % 256); 33967#L67-1 assume !(3 == mp_add_~i~0 % 256); 33966#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33608#L70 [2018-11-18 08:34:44,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:44,912 INFO L82 PathProgramCache]: Analyzing trace with hash 236289352, now seen corresponding path program 1 times [2018-11-18 08:34:44,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:44,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:44,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:44,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:34:44,969 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:44,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:44,969 INFO L82 PathProgramCache]: Analyzing trace with hash -55742711, now seen corresponding path program 1 times [2018-11-18 08:34:44,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:44,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:44,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:44,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 224 proven. 128 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 08:34:45,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:45,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:45,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:45,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 127 proven. 1 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-18 08:34:45,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:45,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 08:34:45,792 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:34:45,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:34:45,793 INFO L87 Difference]: Start difference. First operand 608 states and 693 transitions. cyclomatic complexity: 90 Second operand 7 states. [2018-11-18 08:34:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:46,021 INFO L93 Difference]: Finished difference Result 934 states and 1042 transitions. [2018-11-18 08:34:46,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:34:46,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 934 states and 1042 transitions. [2018-11-18 08:34:46,023 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 359 [2018-11-18 08:34:46,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 934 states to 883 states and 985 transitions. [2018-11-18 08:34:46,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 883 [2018-11-18 08:34:46,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 883 [2018-11-18 08:34:46,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 883 states and 985 transitions. [2018-11-18 08:34:46,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:46,025 INFO L705 BuchiCegarLoop]: Abstraction has 883 states and 985 transitions. [2018-11-18 08:34:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states and 985 transitions. [2018-11-18 08:34:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 689. [2018-11-18 08:34:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2018-11-18 08:34:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 779 transitions. [2018-11-18 08:34:46,032 INFO L728 BuchiCegarLoop]: Abstraction has 689 states and 779 transitions. [2018-11-18 08:34:46,032 INFO L608 BuchiCegarLoop]: Abstraction has 689 states and 779 transitions. [2018-11-18 08:34:46,032 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-18 08:34:46,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 689 states and 779 transitions. [2018-11-18 08:34:46,034 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 293 [2018-11-18 08:34:46,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:46,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:46,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:46,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:46,035 INFO L794 eck$LassoCheckResult]: Stem: 35375#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 35354#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 35349#L40 assume !(0 == mp_add_~a3~0 % 256); 35350#L40-1 mp_add_~nb~0 := 4; 35959#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 35958#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 35957#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 35956#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 35531#L61-3 assume true; 35532#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35527#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35528#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 35984#L65-2 assume !(1 == mp_add_~i~0 % 256); 35982#L66-1 assume !(2 == mp_add_~i~0 % 256); 35980#L67-1 assume !(3 == mp_add_~i~0 % 256); 35979#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35522#L70 [2018-11-18 08:34:46,035 INFO L796 eck$LassoCheckResult]: Loop: 35522#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35720#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 35404#L80-1 assume !(1 == mp_add_~i~0 % 256); 35718#L81-1 assume !(2 == mp_add_~i~0 % 256); 35717#L82-1 assume !(3 == mp_add_~i~0 % 256); 35716#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35714#L61-3 assume true; 35712#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35710#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35708#L65 assume !(0 == mp_add_~i~0 % 256); 35705#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 35702#L66-1 assume !(2 == mp_add_~i~0 % 256); 35700#L67-1 assume !(3 == mp_add_~i~0 % 256); 35698#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35696#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35694#L76-1 assume !(0 == mp_add_~i~0 % 256); 35687#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 35686#L81-1 assume !(2 == mp_add_~i~0 % 256); 35684#L82-1 assume !(3 == mp_add_~i~0 % 256); 35682#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35680#L61-3 assume true; 35678#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35676#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35674#L65 assume !(0 == mp_add_~i~0 % 256); 35672#L65-2 assume !(1 == mp_add_~i~0 % 256); 35670#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 35616#L67-1 assume !(3 == mp_add_~i~0 % 256); 35667#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35665#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35663#L76-1 assume !(0 == mp_add_~i~0 % 256); 35661#L80-1 assume !(1 == mp_add_~i~0 % 256); 35613#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 35614#L82-1 assume !(3 == mp_add_~i~0 % 256); 35609#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35610#L61-3 assume true; 35605#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35606#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35601#L65 assume !(0 == mp_add_~i~0 % 256); 35602#L65-2 assume !(1 == mp_add_~i~0 % 256); 35597#L66-1 assume !(2 == mp_add_~i~0 % 256); 35598#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 35595#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35659#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35658#L76-1 assume !(0 == mp_add_~i~0 % 256); 35657#L80-1 assume !(1 == mp_add_~i~0 % 256); 35656#L81-1 assume !(2 == mp_add_~i~0 % 256); 35654#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 35653#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35652#L61-3 assume true; 35651#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35650#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35649#L65 assume !(0 == mp_add_~i~0 % 256); 35648#L65-2 assume !(1 == mp_add_~i~0 % 256); 35647#L66-1 assume !(2 == mp_add_~i~0 % 256); 35646#L67-1 assume !(3 == mp_add_~i~0 % 256); 35645#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35644#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35643#L76-1 assume !(0 == mp_add_~i~0 % 256); 35642#L80-1 assume !(1 == mp_add_~i~0 % 256); 35641#L81-1 assume !(2 == mp_add_~i~0 % 256); 35640#L82-1 assume !(3 == mp_add_~i~0 % 256); 35639#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35638#L61-3 assume true; 35637#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35636#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35635#L65 assume !(0 == mp_add_~i~0 % 256); 35634#L65-2 assume !(1 == mp_add_~i~0 % 256); 35633#L66-1 assume !(2 == mp_add_~i~0 % 256); 35632#L67-1 assume !(3 == mp_add_~i~0 % 256); 35631#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35630#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35629#L76-1 assume !(0 == mp_add_~i~0 % 256); 35628#L80-1 assume !(1 == mp_add_~i~0 % 256); 35627#L81-1 assume !(2 == mp_add_~i~0 % 256); 35623#L82-1 assume !(3 == mp_add_~i~0 % 256); 35624#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35733#L61-3 assume true; 35732#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35730#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35729#L65 assume !(0 == mp_add_~i~0 % 256); 35728#L65-2 assume !(1 == mp_add_~i~0 % 256); 35726#L66-1 assume !(2 == mp_add_~i~0 % 256); 35724#L67-1 assume !(3 == mp_add_~i~0 % 256); 35722#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35721#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35719#L76-1 assume !(0 == mp_add_~i~0 % 256); 35688#L80-1 assume !(1 == mp_add_~i~0 % 256); 35689#L81-1 assume !(2 == mp_add_~i~0 % 256); 35655#L82-1 assume !(3 == mp_add_~i~0 % 256); 35622#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35621#L61-3 assume true; 35620#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35619#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35618#L65 assume !(0 == mp_add_~i~0 % 256); 35617#L65-2 assume !(1 == mp_add_~i~0 % 256); 35615#L66-1 assume !(2 == mp_add_~i~0 % 256); 35594#L67-1 assume !(3 == mp_add_~i~0 % 256); 35596#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35731#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35691#L76-1 assume !(0 == mp_add_~i~0 % 256); 35692#L80-1 assume !(1 == mp_add_~i~0 % 256); 35625#L81-1 assume !(2 == mp_add_~i~0 % 256); 35626#L82-1 assume !(3 == mp_add_~i~0 % 256); 35715#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35713#L61-3 assume true; 35711#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35709#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35706#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 35707#L65-2 assume !(1 == mp_add_~i~0 % 256); 35727#L66-1 assume !(2 == mp_add_~i~0 % 256); 35725#L67-1 assume !(3 == mp_add_~i~0 % 256); 35723#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35522#L70 [2018-11-18 08:34:46,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash 502830402, now seen corresponding path program 1 times [2018-11-18 08:34:46,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:46,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:46,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:46,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:46,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:46,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:46,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 08:34:46,114 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:46,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:46,114 INFO L82 PathProgramCache]: Analyzing trace with hash -55742711, now seen corresponding path program 2 times [2018-11-18 08:34:46,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:46,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:46,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:46,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:46,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 224 proven. 128 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 08:34:46,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:46,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:46,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:34:46,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:34:46,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:46,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 127 proven. 1 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-18 08:34:46,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:46,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 08:34:46,892 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:46,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:34:46,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:34:46,893 INFO L87 Difference]: Start difference. First operand 689 states and 779 transitions. cyclomatic complexity: 95 Second operand 9 states. [2018-11-18 08:34:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:47,232 INFO L93 Difference]: Finished difference Result 949 states and 1050 transitions. [2018-11-18 08:34:47,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:34:47,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 949 states and 1050 transitions. [2018-11-18 08:34:47,234 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 425 [2018-11-18 08:34:47,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 949 states to 879 states and 974 transitions. [2018-11-18 08:34:47,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 879 [2018-11-18 08:34:47,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 879 [2018-11-18 08:34:47,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 974 transitions. [2018-11-18 08:34:47,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:47,237 INFO L705 BuchiCegarLoop]: Abstraction has 879 states and 974 transitions. [2018-11-18 08:34:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 974 transitions. [2018-11-18 08:34:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 687. [2018-11-18 08:34:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-11-18 08:34:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 770 transitions. [2018-11-18 08:34:47,244 INFO L728 BuchiCegarLoop]: Abstraction has 687 states and 770 transitions. [2018-11-18 08:34:47,244 INFO L608 BuchiCegarLoop]: Abstraction has 687 states and 770 transitions. [2018-11-18 08:34:47,244 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-18 08:34:47,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 687 states and 770 transitions. [2018-11-18 08:34:47,245 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 410 [2018-11-18 08:34:47,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:47,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:47,246 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:47,246 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:47,246 INFO L794 eck$LassoCheckResult]: Stem: 37380#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 37358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 37353#L40 assume !(0 == mp_add_~a3~0 % 256); 37354#L40-1 mp_add_~nb~0 := 4; 37985#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 37373#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 37360#L54 assume !(0 == mp_add_~b1~0 % 256); 37361#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 37514#L61-3 assume true; 37513#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37512#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37511#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 37395#L65-2 [2018-11-18 08:34:47,246 INFO L796 eck$LassoCheckResult]: Loop: 37395#L65-2 assume !(1 == mp_add_~i~0 % 256); 37510#L66-1 assume !(2 == mp_add_~i~0 % 256); 37509#L67-1 assume !(3 == mp_add_~i~0 % 256); 37508#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37507#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 37384#L71-2 assume !(1 == mp_add_~i~0 % 256); 37506#L72-1 assume !(2 == mp_add_~i~0 % 256); 37505#L73-1 assume !(3 == mp_add_~i~0 % 256); 37504#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 37503#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 37502#L80-1 assume !(1 == mp_add_~i~0 % 256); 37501#L81-1 assume !(2 == mp_add_~i~0 % 256); 37500#L82-1 assume !(3 == mp_add_~i~0 % 256); 37499#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37498#L61-3 assume true; 37497#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37496#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37495#L65 assume !(0 == mp_add_~i~0 % 256); 37494#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 37393#L66-1 assume !(2 == mp_add_~i~0 % 256); 37493#L67-1 assume !(3 == mp_add_~i~0 % 256); 37492#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37491#L71 assume !(0 == mp_add_~i~0 % 256); 37385#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 37490#L72-1 assume !(2 == mp_add_~i~0 % 256); 37489#L73-1 assume !(3 == mp_add_~i~0 % 256); 37488#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 37487#L76-1 assume !(0 == mp_add_~i~0 % 256); 37486#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 37485#L81-1 assume !(2 == mp_add_~i~0 % 256); 37484#L82-1 assume !(3 == mp_add_~i~0 % 256); 37483#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37482#L61-3 assume true; 37481#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37480#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37479#L65 assume !(0 == mp_add_~i~0 % 256); 37478#L65-2 assume !(1 == mp_add_~i~0 % 256); 37477#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 37391#L67-1 assume !(3 == mp_add_~i~0 % 256); 37476#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 37475#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 37474#L76-1 assume !(0 == mp_add_~i~0 % 256); 37473#L80-1 assume !(1 == mp_add_~i~0 % 256); 37472#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 37403#L82-1 assume !(3 == mp_add_~i~0 % 256); 37471#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37470#L61-3 assume true; 37469#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37468#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37467#L65 assume !(0 == mp_add_~i~0 % 256); 37466#L65-2 assume !(1 == mp_add_~i~0 % 256); 37465#L66-1 assume !(2 == mp_add_~i~0 % 256); 37464#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 37389#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 37463#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 37462#L76-1 assume !(0 == mp_add_~i~0 % 256); 37461#L80-1 assume !(1 == mp_add_~i~0 % 256); 37460#L81-1 assume !(2 == mp_add_~i~0 % 256); 37459#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 37401#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37458#L61-3 assume true; 37457#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37456#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37455#L65 assume !(0 == mp_add_~i~0 % 256); 37454#L65-2 assume !(1 == mp_add_~i~0 % 256); 37453#L66-1 assume !(2 == mp_add_~i~0 % 256); 37452#L67-1 assume !(3 == mp_add_~i~0 % 256); 37451#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 37450#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 37449#L76-1 assume !(0 == mp_add_~i~0 % 256); 37448#L80-1 assume !(1 == mp_add_~i~0 % 256); 37447#L81-1 assume !(2 == mp_add_~i~0 % 256); 37446#L82-1 assume !(3 == mp_add_~i~0 % 256); 37445#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37444#L61-3 assume true; 37443#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37442#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37441#L65 assume !(0 == mp_add_~i~0 % 256); 37440#L65-2 assume !(1 == mp_add_~i~0 % 256); 37439#L66-1 assume !(2 == mp_add_~i~0 % 256); 37438#L67-1 assume !(3 == mp_add_~i~0 % 256); 37437#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 37436#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 37435#L76-1 assume !(0 == mp_add_~i~0 % 256); 37434#L80-1 assume !(1 == mp_add_~i~0 % 256); 37433#L81-1 assume !(2 == mp_add_~i~0 % 256); 37432#L82-1 assume !(3 == mp_add_~i~0 % 256); 37431#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37430#L61-3 assume true; 37429#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37428#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37427#L65 assume !(0 == mp_add_~i~0 % 256); 37426#L65-2 assume !(1 == mp_add_~i~0 % 256); 37425#L66-1 assume !(2 == mp_add_~i~0 % 256); 37424#L67-1 assume !(3 == mp_add_~i~0 % 256); 37423#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 37422#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 37421#L76-1 assume !(0 == mp_add_~i~0 % 256); 37420#L80-1 assume !(1 == mp_add_~i~0 % 256); 37419#L81-1 assume !(2 == mp_add_~i~0 % 256); 37418#L82-1 assume !(3 == mp_add_~i~0 % 256); 37417#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37416#L61-3 assume true; 37415#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37414#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37413#L65 assume !(0 == mp_add_~i~0 % 256); 37412#L65-2 assume !(1 == mp_add_~i~0 % 256); 37411#L66-1 assume !(2 == mp_add_~i~0 % 256); 37410#L67-1 assume !(3 == mp_add_~i~0 % 256); 37409#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 37407#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 37408#L76-1 assume !(0 == mp_add_~i~0 % 256); 37404#L80-1 assume !(1 == mp_add_~i~0 % 256); 37402#L81-1 assume !(2 == mp_add_~i~0 % 256); 37400#L82-1 assume !(3 == mp_add_~i~0 % 256); 37399#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37398#L61-3 assume true; 37397#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37396#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37394#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 37395#L65-2 [2018-11-18 08:34:47,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash -307960871, now seen corresponding path program 1 times [2018-11-18 08:34:47,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:47,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:47,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:47,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:47,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:47,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1611440557, now seen corresponding path program 1 times [2018-11-18 08:34:47,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:47,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:47,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:47,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 213 proven. 128 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 08:34:47,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:47,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:47,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:47,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 132 proven. 78 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-18 08:34:47,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:47,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-18 08:34:47,868 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:47,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 08:34:47,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-18 08:34:47,868 INFO L87 Difference]: Start difference. First operand 687 states and 770 transitions. cyclomatic complexity: 89 Second operand 15 states. [2018-11-18 08:34:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:50,198 INFO L93 Difference]: Finished difference Result 785 states and 831 transitions. [2018-11-18 08:34:50,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 08:34:50,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 785 states and 831 transitions. [2018-11-18 08:34:50,199 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 74 [2018-11-18 08:34:50,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 785 states to 782 states and 828 transitions. [2018-11-18 08:34:50,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 782 [2018-11-18 08:34:50,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 782 [2018-11-18 08:34:50,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 782 states and 828 transitions. [2018-11-18 08:34:50,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:50,201 INFO L705 BuchiCegarLoop]: Abstraction has 782 states and 828 transitions. [2018-11-18 08:34:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states and 828 transitions. [2018-11-18 08:34:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 385. [2018-11-18 08:34:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-18 08:34:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 417 transitions. [2018-11-18 08:34:50,205 INFO L728 BuchiCegarLoop]: Abstraction has 385 states and 417 transitions. [2018-11-18 08:34:50,205 INFO L608 BuchiCegarLoop]: Abstraction has 385 states and 417 transitions. [2018-11-18 08:34:50,205 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-18 08:34:50,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 385 states and 417 transitions. [2018-11-18 08:34:50,205 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 08:34:50,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:50,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:50,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 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] [2018-11-18 08:34:50,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:50,206 INFO L794 eck$LassoCheckResult]: Stem: 39288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 39268#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 39264#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 39265#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 39287#L44 assume !(0 == mp_add_~a1~0 % 256); 39289#L40-1 mp_add_~nb~0 := 4; 39301#L50 assume !(0 == mp_add_~b3~0 % 256); 39300#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 39299#L61-3 assume true; 39298#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39295#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39297#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39345#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 39346#L71-2 assume !(1 == mp_add_~i~0 % 256); 39341#L72-1 assume !(2 == mp_add_~i~0 % 256); 39342#L73-1 assume !(3 == mp_add_~i~0 % 256); 39337#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 39338#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 39333#L80-1 assume !(1 == mp_add_~i~0 % 256); 39334#L81-1 assume !(2 == mp_add_~i~0 % 256); 39329#L82-1 assume !(3 == mp_add_~i~0 % 256); 39330#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39325#L61-3 assume true; 39326#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39321#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39322#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39316#L71 assume !(0 == mp_add_~i~0 % 256); 39317#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 39580#L72-1 assume !(2 == mp_add_~i~0 % 256); 39579#L73-1 assume !(3 == mp_add_~i~0 % 256); 39578#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 39577#L76-1 assume !(0 == mp_add_~i~0 % 256); 39576#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 39575#L81-1 assume !(2 == mp_add_~i~0 % 256); 39574#L82-1 assume !(3 == mp_add_~i~0 % 256); 39573#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39572#L61-3 assume true; 39571#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39570#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39423#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39569#L71 assume !(0 == mp_add_~i~0 % 256); 39568#L71-2 assume !(1 == mp_add_~i~0 % 256); 39567#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 39566#L73-1 assume !(3 == mp_add_~i~0 % 256); 39565#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 39564#L76-1 assume !(0 == mp_add_~i~0 % 256); 39563#L80-1 assume !(1 == mp_add_~i~0 % 256); 39562#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 39561#L82-1 assume !(3 == mp_add_~i~0 % 256); 39560#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39559#L61-3 assume true; 39558#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39557#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39403#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39556#L71 assume !(0 == mp_add_~i~0 % 256); 39555#L71-2 assume !(1 == mp_add_~i~0 % 256); 39554#L72-1 assume !(2 == mp_add_~i~0 % 256); 39553#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 39552#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 39551#L76-1 assume !(0 == mp_add_~i~0 % 256); 39550#L80-1 assume !(1 == mp_add_~i~0 % 256); 39549#L81-1 assume !(2 == mp_add_~i~0 % 256); 39547#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 39546#L83-1 [2018-11-18 08:34:50,206 INFO L796 eck$LassoCheckResult]: Loop: 39546#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39545#L61-3 assume true; 39544#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39397#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39398#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39588#L71 assume !(0 == mp_add_~i~0 % 256); 39587#L71-2 assume !(1 == mp_add_~i~0 % 256); 39586#L72-1 assume !(2 == mp_add_~i~0 % 256); 39585#L73-1 assume !(3 == mp_add_~i~0 % 256); 39584#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 39583#L76-1 assume !(0 == mp_add_~i~0 % 256); 39582#L80-1 assume !(1 == mp_add_~i~0 % 256); 39581#L81-1 assume !(2 == mp_add_~i~0 % 256); 39548#L82-1 assume !(3 == mp_add_~i~0 % 256); 39546#L83-1 [2018-11-18 08:34:50,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1160041331, now seen corresponding path program 1 times [2018-11-18 08:34:50,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:50,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:50,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:50,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:50,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 08:34:50,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:50,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 08:34:50,281 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:50,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:50,282 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 1 times [2018-11-18 08:34:50,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:50,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:50,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:50,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:50,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:50,360 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:50,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:50,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:50,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:50,361 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:50,361 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:50,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:50,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:50,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-18 08:34:50,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:50,361 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:50,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:50,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:50,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:50,525 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:50,544 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:50,544 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:50,562 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:50,562 INFO L448 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_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:50,596 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:50,596 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:50,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:50,664 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:51,084 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:51,086 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:51,086 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:51,086 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:51,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:51,086 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:51,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:51,086 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:51,086 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-18 08:34:51,086 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:51,086 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:51,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,215 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:51,218 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:51,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:51,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:51,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,233 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 08:34:51,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,234 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,236 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,250 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,251 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,252 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 08:34:51,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,253 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,264 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,268 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,269 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,270 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 08:34:51,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,271 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,272 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:51,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,277 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,278 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:51,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,279 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 08:34:51,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,280 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,280 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,280 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,282 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,292 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,292 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,292 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,293 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,294 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 08:34:51,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,295 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,295 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:51,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,297 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,300 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,315 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:51,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,316 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,317 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,320 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 08:34:51,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,321 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:51,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,321 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,326 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:51,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,340 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:51,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,341 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,342 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:51,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,344 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 08:34:51,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,345 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,345 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,346 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,357 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,357 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,358 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,362 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 08:34:51,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,363 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:51,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,364 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:51,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:51,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,385 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:51,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,385 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:51,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:51,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 08:34:51,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:34:51,392 INFO L87 Difference]: Start difference. First operand 385 states and 417 transitions. cyclomatic complexity: 35 Second operand 8 states. [2018-11-18 08:34:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:51,931 INFO L93 Difference]: Finished difference Result 1015 states and 1080 transitions. [2018-11-18 08:34:51,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 08:34:51,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1015 states and 1080 transitions. [2018-11-18 08:34:51,934 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 120 [2018-11-18 08:34:51,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1015 states to 745 states and 796 transitions. [2018-11-18 08:34:51,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 745 [2018-11-18 08:34:51,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 745 [2018-11-18 08:34:51,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 745 states and 796 transitions. [2018-11-18 08:34:51,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:51,936 INFO L705 BuchiCegarLoop]: Abstraction has 745 states and 796 transitions. [2018-11-18 08:34:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states and 796 transitions. [2018-11-18 08:34:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 453. [2018-11-18 08:34:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-11-18 08:34:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 487 transitions. [2018-11-18 08:34:51,941 INFO L728 BuchiCegarLoop]: Abstraction has 453 states and 487 transitions. [2018-11-18 08:34:51,941 INFO L608 BuchiCegarLoop]: Abstraction has 453 states and 487 transitions. [2018-11-18 08:34:51,941 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-18 08:34:51,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 453 states and 487 transitions. [2018-11-18 08:34:51,942 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 08:34:51,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:51,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:51,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 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] [2018-11-18 08:34:51,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:51,943 INFO L794 eck$LassoCheckResult]: Stem: 40722#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 40698#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 40693#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 40695#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 40720#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 40689#L40-1 mp_add_~nb~0 := 4; 40690#L50 assume !(0 == mp_add_~b3~0 % 256); 40813#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 40812#L61-3 assume true; 40811#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40809#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40810#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40908#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 40906#L71-2 assume !(1 == mp_add_~i~0 % 256); 40904#L72-1 assume !(2 == mp_add_~i~0 % 256); 40902#L73-1 assume !(3 == mp_add_~i~0 % 256); 40900#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 40898#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 40896#L80-1 assume !(1 == mp_add_~i~0 % 256); 40894#L81-1 assume !(2 == mp_add_~i~0 % 256); 40892#L82-1 assume !(3 == mp_add_~i~0 % 256); 40890#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 40888#L61-3 assume true; 40886#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40884#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40791#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40882#L71 assume !(0 == mp_add_~i~0 % 256); 40881#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 40880#L72-1 assume !(2 == mp_add_~i~0 % 256); 40879#L73-1 assume !(3 == mp_add_~i~0 % 256); 40878#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 40877#L76-1 assume !(0 == mp_add_~i~0 % 256); 40876#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 40875#L81-1 assume !(2 == mp_add_~i~0 % 256); 40874#L82-1 assume !(3 == mp_add_~i~0 % 256); 40873#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 40872#L61-3 assume true; 40871#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40827#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40772#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40825#L71 assume !(0 == mp_add_~i~0 % 256); 40824#L71-2 assume !(1 == mp_add_~i~0 % 256); 40823#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 40822#L73-1 assume !(3 == mp_add_~i~0 % 256); 40821#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 40820#L76-1 assume !(0 == mp_add_~i~0 % 256); 40819#L80-1 assume !(1 == mp_add_~i~0 % 256); 40818#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 40817#L82-1 assume !(3 == mp_add_~i~0 % 256); 40816#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 40815#L61-3 assume true; 40814#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40751#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40750#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40749#L71 assume !(0 == mp_add_~i~0 % 256); 40748#L71-2 assume !(1 == mp_add_~i~0 % 256); 40747#L72-1 assume !(2 == mp_add_~i~0 % 256); 40746#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 40745#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 40744#L76-1 assume !(0 == mp_add_~i~0 % 256); 40743#L80-1 assume !(1 == mp_add_~i~0 % 256); 40742#L81-1 assume !(2 == mp_add_~i~0 % 256); 40740#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 40739#L83-1 [2018-11-18 08:34:51,943 INFO L796 eck$LassoCheckResult]: Loop: 40739#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 40707#L61-3 assume true; 40708#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40712#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40721#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40928#L71 assume !(0 == mp_add_~i~0 % 256); 40927#L71-2 assume !(1 == mp_add_~i~0 % 256); 40926#L72-1 assume !(2 == mp_add_~i~0 % 256); 40925#L73-1 assume !(3 == mp_add_~i~0 % 256); 40924#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 40923#L76-1 assume !(0 == mp_add_~i~0 % 256); 40922#L80-1 assume !(1 == mp_add_~i~0 % 256); 40921#L81-1 assume !(2 == mp_add_~i~0 % 256); 40741#L82-1 assume !(3 == mp_add_~i~0 % 256); 40739#L83-1 [2018-11-18 08:34:51,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:51,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1720741109, now seen corresponding path program 1 times [2018-11-18 08:34:51,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:51,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 08:34:52,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:52,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 08:34:52,017 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:52,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:52,017 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 2 times [2018-11-18 08:34:52,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:52,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:52,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:52,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,069 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:52,069 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:52,069 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:52,070 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:52,070 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:52,070 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:52,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:52,070 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:52,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-11-18 08:34:52,070 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:52,070 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:52,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,218 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-11-18 08:34:52,252 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:52,252 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:52,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:52,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:52,264 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:52,264 INFO L448 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_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:52,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:52,280 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:52,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:52,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:52,807 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:52,809 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:52,809 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:52,809 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:52,809 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:52,810 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:52,810 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:52,810 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:52,810 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:52,810 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-11-18 08:34:52,810 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:52,810 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:52,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,970 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:52,970 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:52,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:52,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:52,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,975 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 08:34:52,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,976 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:52,977 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:52,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,980 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:52,980 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:52,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,981 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 08:34:52,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,982 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,983 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:52,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,987 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,987 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:52,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,988 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 08:34:52,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,989 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:52,990 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:52,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,994 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:52,995 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:52,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,996 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 08:34:52,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,996 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,996 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:52,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,997 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:52,998 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:52,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:53,005 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:53,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,006 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:53,006 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:53,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,007 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 08:34:53,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:53,008 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:53,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,008 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:53,010 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:53,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,019 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:53,019 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:53,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,020 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:53,021 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:53,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,022 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 08:34:53,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:53,023 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:53,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,024 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:53,026 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:53,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:53,036 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:53,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,036 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:53,037 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:53,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,038 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 08:34:53,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:53,039 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:53,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:53,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:53,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:53,046 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:53,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:53,047 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:53,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,050 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 08:34:53,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:53,050 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:53,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,051 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:53,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:53,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:53,062 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:53,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,063 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:53,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:53,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:34:53,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:34:53,068 INFO L87 Difference]: Start difference. First operand 453 states and 487 transitions. cyclomatic complexity: 37 Second operand 9 states. [2018-11-18 08:34:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:53,609 INFO L93 Difference]: Finished difference Result 579 states and 613 transitions. [2018-11-18 08:34:53,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:34:53,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 579 states and 613 transitions. [2018-11-18 08:34:53,611 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 88 [2018-11-18 08:34:53,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 579 states to 507 states and 538 transitions. [2018-11-18 08:34:53,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 507 [2018-11-18 08:34:53,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 507 [2018-11-18 08:34:53,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 507 states and 538 transitions. [2018-11-18 08:34:53,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:53,613 INFO L705 BuchiCegarLoop]: Abstraction has 507 states and 538 transitions. [2018-11-18 08:34:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states and 538 transitions. [2018-11-18 08:34:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 403. [2018-11-18 08:34:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-11-18 08:34:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 429 transitions. [2018-11-18 08:34:53,617 INFO L728 BuchiCegarLoop]: Abstraction has 403 states and 429 transitions. [2018-11-18 08:34:53,617 INFO L608 BuchiCegarLoop]: Abstraction has 403 states and 429 transitions. [2018-11-18 08:34:53,617 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-18 08:34:53,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 429 transitions. [2018-11-18 08:34:53,618 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 08:34:53,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:53,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:53,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:53,618 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:53,619 INFO L794 eck$LassoCheckResult]: Stem: 41771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 41747#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 41742#L40 assume !(0 == mp_add_~a3~0 % 256); 41743#L40-1 mp_add_~nb~0 := 4; 41775#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 41767#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 41751#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 41753#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 41983#L61-3 assume true; 41980#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41978#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41976#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 41974#L65-2 assume !(1 == mp_add_~i~0 % 256); 41972#L66-1 assume !(2 == mp_add_~i~0 % 256); 41970#L67-1 assume !(3 == mp_add_~i~0 % 256); 41968#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41966#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 41964#L71-2 assume !(1 == mp_add_~i~0 % 256); 41962#L72-1 assume !(2 == mp_add_~i~0 % 256); 41960#L73-1 assume !(3 == mp_add_~i~0 % 256); 41958#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41956#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 41954#L80-1 assume !(1 == mp_add_~i~0 % 256); 41952#L81-1 assume !(2 == mp_add_~i~0 % 256); 41950#L82-1 assume !(3 == mp_add_~i~0 % 256); 41948#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41944#L61-3 assume true; 41940#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41936#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41932#L65 assume !(0 == mp_add_~i~0 % 256); 41928#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 41924#L66-1 assume !(2 == mp_add_~i~0 % 256); 41920#L67-1 assume !(3 == mp_add_~i~0 % 256); 41916#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 41912#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41909#L76-1 assume !(0 == mp_add_~i~0 % 256); 41906#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 41903#L81-1 assume !(2 == mp_add_~i~0 % 256); 41900#L82-1 assume !(3 == mp_add_~i~0 % 256); 41897#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41894#L61-3 assume true; 41891#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41888#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41885#L65 assume !(0 == mp_add_~i~0 % 256); 41882#L65-2 assume !(1 == mp_add_~i~0 % 256); 41879#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 41876#L67-1 assume !(3 == mp_add_~i~0 % 256); 41873#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 41870#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41868#L76-1 assume !(0 == mp_add_~i~0 % 256); 41866#L80-1 assume !(1 == mp_add_~i~0 % 256); 41864#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 41862#L82-1 assume !(3 == mp_add_~i~0 % 256); 41860#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41858#L61-3 assume true; 41856#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41854#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41852#L65 assume !(0 == mp_add_~i~0 % 256); 41850#L65-2 assume !(1 == mp_add_~i~0 % 256); 41848#L66-1 assume !(2 == mp_add_~i~0 % 256); 41846#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 41843#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 41844#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 42082#L76-1 assume !(0 == mp_add_~i~0 % 256); 42081#L80-1 assume !(1 == mp_add_~i~0 % 256); 41836#L81-1 assume !(2 == mp_add_~i~0 % 256); 41837#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 42077#L83-1 [2018-11-18 08:34:53,619 INFO L796 eck$LassoCheckResult]: Loop: 42077#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 42076#L61-3 assume true; 42075#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 42074#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 42073#L65 assume !(0 == mp_add_~i~0 % 256); 42071#L65-2 assume !(1 == mp_add_~i~0 % 256); 42069#L66-1 assume !(2 == mp_add_~i~0 % 256); 42067#L67-1 assume !(3 == mp_add_~i~0 % 256); 42061#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 42062#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 42055#L76-1 assume !(0 == mp_add_~i~0 % 256); 42056#L80-1 assume !(1 == mp_add_~i~0 % 256); 42080#L81-1 assume !(2 == mp_add_~i~0 % 256); 42078#L82-1 assume !(3 == mp_add_~i~0 % 256); 42077#L83-1 [2018-11-18 08:34:53,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash 671857223, now seen corresponding path program 1 times [2018-11-18 08:34:53,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:53,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1506597377, now seen corresponding path program 1 times [2018-11-18 08:34:53,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,656 INFO L82 PathProgramCache]: Analyzing trace with hash 264905159, now seen corresponding path program 2 times [2018-11-18 08:34:53,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 64 proven. 34 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 08:34:53,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:53,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:53,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:34:53,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 08:34:53,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:53,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-18 08:34:54,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:54,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2018-11-18 08:34:54,092 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:54,092 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:54,092 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:54,092 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:54,093 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:54,093 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:54,093 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:54,093 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:54,093 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration26_Loop [2018-11-18 08:34:54,093 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:54,093 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:54,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:54,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:54,217 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:54,217 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:54,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:54,219 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:54,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:54,264 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:55,781 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:55,783 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:55,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:55,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:55,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:55,783 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:55,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:55,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:55,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:55,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration26_Loop [2018-11-18 08:34:55,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:55,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:55,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:55,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:55,938 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:55,938 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:55,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:55,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:55,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:55,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,944 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 08:34:55,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,945 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:55,946 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:55,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,950 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:55,951 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:55,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,952 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 08:34:55,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,953 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:55,954 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:55,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,958 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:55,959 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:55,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,960 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 08:34:55,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,961 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:55,962 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:55,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:55,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,968 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:55,969 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:55,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,970 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 08:34:55,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:55,970 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:55,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,971 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:55,972 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:55,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,978 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:55,978 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:55,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,978 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:55,979 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:55,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,980 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 08:34:55,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,981 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:55,981 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:55,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,982 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:55,984 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:55,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:55,995 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:55,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:55,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:55,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:55,996 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:55,997 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:55,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:55,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:55,999 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 08:34:55,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:55,999 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:56,000 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:56,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,000 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:56,003 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:56,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:56,051 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:56,051 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:56,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,051 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:56,053 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:56,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,054 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 08:34:56,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:56,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:56,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:56,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,055 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:56,056 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:56,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:56,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:56,063 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:56,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,064 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:56,064 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:56,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,067 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 08:34:56,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:56,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:56,068 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:56,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,068 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:56,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:56,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:56,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:56,085 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:56,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,086 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:56,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:56,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 08:34:56,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-18 08:34:56,092 INFO L87 Difference]: Start difference. First operand 403 states and 429 transitions. cyclomatic complexity: 29 Second operand 15 states. [2018-11-18 08:34:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:57,199 INFO L93 Difference]: Finished difference Result 441 states and 466 transitions. [2018-11-18 08:34:57,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 08:34:57,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 441 states and 466 transitions. [2018-11-18 08:34:57,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2018-11-18 08:34:57,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 441 states to 295 states and 311 transitions. [2018-11-18 08:34:57,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2018-11-18 08:34:57,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2018-11-18 08:34:57,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 311 transitions. [2018-11-18 08:34:57,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:57,200 INFO L705 BuchiCegarLoop]: Abstraction has 295 states and 311 transitions. [2018-11-18 08:34:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 311 transitions. [2018-11-18 08:34:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 219. [2018-11-18 08:34:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-18 08:34:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 232 transitions. [2018-11-18 08:34:57,202 INFO L728 BuchiCegarLoop]: Abstraction has 219 states and 232 transitions. [2018-11-18 08:34:57,202 INFO L608 BuchiCegarLoop]: Abstraction has 219 states and 232 transitions. [2018-11-18 08:34:57,202 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-18 08:34:57,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 219 states and 232 transitions. [2018-11-18 08:34:57,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:57,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:57,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:57,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:57,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:57,203 INFO L794 eck$LassoCheckResult]: Stem: 42901#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 42886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, 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 := main_#t~nondet1;havoc main_#t~nondet1;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; 42882#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 42883#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 42900#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 42902#L40-1 mp_add_~nb~0 := 4; 42928#L50 assume !(0 == mp_add_~b3~0 % 256); 42894#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 42895#L61-3 assume true; 42934#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 42933#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 42931#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 42932#L65-2 assume !(1 == mp_add_~i~0 % 256); 43045#L66-1 assume !(2 == mp_add_~i~0 % 256); 43044#L67-1 assume !(3 == mp_add_~i~0 % 256); 43043#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43042#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 43041#L71-2 assume !(1 == mp_add_~i~0 % 256); 43040#L72-1 assume !(2 == mp_add_~i~0 % 256); 43039#L73-1 assume !(3 == mp_add_~i~0 % 256); 43038#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43036#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 43037#L80-1 assume !(1 == mp_add_~i~0 % 256); 43085#L81-1 assume !(2 == mp_add_~i~0 % 256); 43084#L82-1 assume !(3 == mp_add_~i~0 % 256); 43083#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43082#L61-3 assume true; 43081#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 43080#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 42891#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43079#L71 assume !(0 == mp_add_~i~0 % 256); 43078#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 43077#L72-1 assume !(2 == mp_add_~i~0 % 256); 43076#L73-1 assume !(3 == mp_add_~i~0 % 256); 43075#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43074#L76-1 assume !(0 == mp_add_~i~0 % 256); 43073#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 43072#L81-1 assume !(2 == mp_add_~i~0 % 256); 43071#L82-1 assume !(3 == mp_add_~i~0 % 256); 43070#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43069#L61-3 assume true; 43068#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 43067#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43066#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43065#L71 assume !(0 == mp_add_~i~0 % 256); 43064#L71-2 assume !(1 == mp_add_~i~0 % 256); 43063#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 43062#L73-1 assume !(3 == mp_add_~i~0 % 256); 43061#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43060#L76-1 assume !(0 == mp_add_~i~0 % 256); 43059#L80-1 assume !(1 == mp_add_~i~0 % 256); 43058#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 43057#L82-1 assume !(3 == mp_add_~i~0 % 256); 43056#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43055#L61-3 assume true; 43054#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 43053#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43051#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43050#L71 assume !(0 == mp_add_~i~0 % 256); 43049#L71-2 assume !(1 == mp_add_~i~0 % 256); 43048#L72-1 assume !(2 == mp_add_~i~0 % 256); 43046#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 43047#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43089#L76-1 assume !(0 == mp_add_~i~0 % 256); 43088#L80-1 assume !(1 == mp_add_~i~0 % 256); 43087#L81-1 assume !(2 == mp_add_~i~0 % 256); 43086#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 42876#L83-1 [2018-11-18 08:34:57,203 INFO L796 eck$LassoCheckResult]: Loop: 42876#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 42892#L61-3 assume true; 42893#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 42896#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 42898#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 42877#L71 assume !(0 == mp_add_~i~0 % 256); 42873#L71-2 assume !(1 == mp_add_~i~0 % 256); 42874#L72-1 assume !(2 == mp_add_~i~0 % 256); 42880#L73-1 assume !(3 == mp_add_~i~0 % 256); 42881#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 42887#L76-1 assume !(0 == mp_add_~i~0 % 256); 42871#L80-1 assume !(1 == mp_add_~i~0 % 256); 42872#L81-1 assume !(2 == mp_add_~i~0 % 256); 42875#L82-1 assume !(3 == mp_add_~i~0 % 256); 42876#L83-1 [2018-11-18 08:34:57,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:57,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1199200319, now seen corresponding path program 1 times [2018-11-18 08:34:57,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:57,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:57,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:57,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 3 times [2018-11-18 08:34:57,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:57,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1043021157, now seen corresponding path program 2 times [2018-11-18 08:34:57,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:57,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:57,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:57,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 57 proven. 41 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 08:34:57,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:57,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:57,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:34:57,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 08:34:57,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:57,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 08:34:57,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:57,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-11-18 08:34:57,612 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:57,612 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:57,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:57,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:57,612 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:57,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:57,612 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:57,612 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration27_Loop [2018-11-18 08:34:57,612 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:57,612 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:57,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,751 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:57,751 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,754 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,754 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35ccca7-4cfb-4278-885b-0e79011b1678/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:57,797 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:35:00,382 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:35:00,383 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:00,383 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:00,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:00,384 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:00,384 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:00,384 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:00,384 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:00,384 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:00,384 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration27_Loop [2018-11-18 08:35:00,384 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:00,384 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:00,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:00,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:00,515 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:00,516 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:00,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:00,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:00,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:00,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:00,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,520 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 08:35:00,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,521 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:35:00,522 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:35:00,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,523 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:35:00,524 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:35:00,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,526 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 08:35:00,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:35:00,527 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:35:00,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:35:00,530 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:35:00,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,532 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 08:35:00,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,533 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:35:00,534 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:35:00,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:00,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,535 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:35:00,536 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:35:00,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,539 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 08:35:00,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,540 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:35:00,540 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:35:00,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,540 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:35:00,541 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:35:00,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:35:00,542 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:35:00,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,543 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:35:00,543 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:35:00,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,547 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 08:35:00,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,548 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:35:00,548 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:35:00,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,548 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:35:00,549 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:35:00,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:35:00,551 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:35:00,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,552 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:35:00,553 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:35:00,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,559 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 08:35:00,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:35:00,560 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:35:00,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,560 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:35:00,561 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:35:00,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,563 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:35:00,563 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:35:00,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,563 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:35:00,566 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:35:00,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,574 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 08:35:00,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:35:00,574 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:35:00,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,575 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:35:00,575 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:35:00,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:35:00,578 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:35:00,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,579 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:35:00,579 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:35:00,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,583 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 08:35:00,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,584 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:35:00,584 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:35:00,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,584 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:35:00,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:00,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:00,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:35:00,589 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:35:00,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:00,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:00,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:00,590 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:35:00,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:00,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:00,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:00,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 08:35:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-18 08:35:00,600 INFO L87 Difference]: Start difference. First operand 219 states and 232 transitions. cyclomatic complexity: 14 Second operand 16 states. [2018-11-18 08:35:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:01,108 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2018-11-18 08:35:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:35:01,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 225 transitions. [2018-11-18 08:35:01,109 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:35:01,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 0 states and 0 transitions. [2018-11-18 08:35:01,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:35:01,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:35:01,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:35:01,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:35:01,109 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:01,109 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:01,109 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:01,109 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-18 08:35:01,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:35:01,109 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:35:01,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:35:01,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:35:01 BoogieIcfgContainer [2018-11-18 08:35:01,114 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:35:01,114 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:35:01,114 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:35:01,114 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:35:01,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:29" (3/4) ... [2018-11-18 08:35:01,117 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:35:01,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:35:01,117 INFO L168 Benchmark]: Toolchain (without parser) took 32020.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 406.3 MB). Free memory was 961.9 MB in the beginning and 1.4 GB in the end (delta: -394.4 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,118 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:01,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.05 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,119 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.23 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:01,119 INFO L168 Benchmark]: Boogie Preprocessor took 57.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,119 INFO L168 Benchmark]: RCFGBuilder took 273.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,120 INFO L168 Benchmark]: BuchiAutomizer took 31468.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -248.6 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:01,120 INFO L168 Benchmark]: Witness Printer took 2.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:01,123 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 181.05 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.23 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 273.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31468.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -248.6 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 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 27 terminating modules (27 trivial, 0 deterministic, 0 nondeterministic). 27 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.4s and 28 iterations. TraceHistogramMax:9. Analysis of lassos took 14.7s. Construction of modules took 9.8s. Büchi inclusion checks took 6.3s. Highest rank in rank-based complementation 0. Minimization of det autom 27. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 7049 StatesRemovedByMinimization, 26 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1864 states and ocurred in iteration 15. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1153 SDtfs, 7338 SDslu, 3253 SDs, 0 SdLazy, 10958 SolverSat, 1163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time LassoAnalysisResults: nont0 unkn0 SFLI19 SFLT0 conc2 concLT0 SILN0 SILU2 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf96 lsp81 ukn100 mio100 lsp100 div410 bol100 ite100 ukn100 eq144 hnf46 smp69 dnf100 smp100 tf102 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 21ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...