./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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.24-0ed9222-m [2019-01-14 02:50:01,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:50:01,407 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:50:01,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:50:01,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:50:01,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:50:01,422 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:50:01,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:50:01,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:50:01,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:50:01,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:50:01,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:50:01,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:50:01,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:50:01,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:50:01,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:50:01,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:50:01,436 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:50:01,439 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:50:01,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:50:01,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:50:01,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:50:01,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:50:01,447 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:50:01,447 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:50:01,448 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:50:01,449 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:50:01,451 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:50:01,452 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:50:01,453 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:50:01,454 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:50:01,454 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:50:01,455 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:50:01,455 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:50:01,457 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:50:01,458 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:50:01,458 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:50:01,476 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:50:01,476 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:50:01,477 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:50:01,478 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:50:01,478 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:50:01,478 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:50:01,478 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:50:01,478 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:50:01,479 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:50:01,479 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:50:01,479 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:50:01,479 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:50:01,479 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:50:01,480 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:50:01,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:50:01,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:50:01,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:50:01,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:50:01,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:50:01,482 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:50:01,482 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:50:01,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:50:01,483 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:50:01,483 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:50:01,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:50:01,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:50:01,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:50:01,484 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:50:01,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:50:01,484 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:50:01,484 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:50:01,487 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:50:01,487 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-14 02:50:01,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:50:01,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:50:01,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:50:01,547 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:50:01,548 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:50:01,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2019-01-14 02:50:01,607 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8157584/b70e282768e94e1096822575078c9a5e/FLAG7f1620b00 [2019-01-14 02:50:02,109 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:50:02,110 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2019-01-14 02:50:02,116 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8157584/b70e282768e94e1096822575078c9a5e/FLAG7f1620b00 [2019-01-14 02:50:02,436 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8157584/b70e282768e94e1096822575078c9a5e [2019-01-14 02:50:02,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:50:02,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:50:02,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:50:02,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:50:02,447 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:50:02,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5089c550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02, skipping insertion in model container [2019-01-14 02:50:02,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:50:02,498 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:50:02,824 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:50:02,833 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:50:02,895 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:50:02,916 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:50:02,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02 WrapperNode [2019-01-14 02:50:02,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:50:02,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:50:02,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:50:02,918 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:50:02,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:50:02,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:50:02,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:50:02,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:50:03,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:03,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:03,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:03,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:03,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:03,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:03,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:03,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:50:03,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:50:03,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:50:03,097 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:50:03,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:50:03,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:50:03,740 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:50:03,740 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-14 02:50:03,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:03 BoogieIcfgContainer [2019-01-14 02:50:03,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:50:03,742 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:50:03,742 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:50:03,745 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:50:03,746 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:03,746 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:50:02" (1/3) ... [2019-01-14 02:50:03,748 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@758ca7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:50:03, skipping insertion in model container [2019-01-14 02:50:03,748 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:03,748 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (2/3) ... [2019-01-14 02:50:03,749 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@758ca7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:50:03, skipping insertion in model container [2019-01-14 02:50:03,749 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:03,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:03" (3/3) ... [2019-01-14 02:50:03,752 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2019-01-14 02:50:03,809 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:50:03,810 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:50:03,810 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:50:03,810 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:50:03,811 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:50:03,811 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:50:03,811 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:50:03,811 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:50:03,811 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:50:03,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2019-01-14 02:50:03,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-01-14 02:50:03,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:03,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:03,864 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:50:03,865 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:03,865 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:50:03,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2019-01-14 02:50:03,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-01-14 02:50:03,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:03,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:03,873 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:50:03,873 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:03,881 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue 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;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; 29#L50true assume !(0 == mp_add_~b3~0 % 256); 27#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23#L61-2true [2019-01-14 02:50:03,882 INFO L796 eck$LassoCheckResult]: Loop: 23#L61-2true 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; 36#L64true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 33#L64-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 25#L70true assume !(mp_add_~partial_sum~0 % 65536 > 254); 13#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; 22#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; 31#L83-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23#L61-2true [2019-01-14 02:50:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash 30109316, now seen corresponding path program 1 times [2019-01-14 02:50:03,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:03,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:03,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:03,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:03,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:04,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:04,026 INFO L82 PathProgramCache]: Analyzing trace with hash -476987525, now seen corresponding path program 1 times [2019-01-14 02:50:04,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:04,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:04,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:04,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:04,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:04,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:04,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:50:04,109 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:04,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:04,129 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-14 02:50:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:04,590 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2019-01-14 02:50:04,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:04,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 93 transitions. [2019-01-14 02:50:04,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2019-01-14 02:50:04,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2019-01-14 02:50:04,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-01-14 02:50:04,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-01-14 02:50:04,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2019-01-14 02:50:04,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:04,606 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2019-01-14 02:50:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2019-01-14 02:50:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-01-14 02:50:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 02:50:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2019-01-14 02:50:04,639 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2019-01-14 02:50:04,639 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2019-01-14 02:50:04,639 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:50:04,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2019-01-14 02:50:04,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-01-14 02:50:04,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:04,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:04,642 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:04,643 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:04,643 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY 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;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; 123#L40 assume !(0 == mp_add_~a3~0 % 256); 120#L40-1 mp_add_~nb~0 := 4; 121#L50 assume !(0 == mp_add_~b3~0 % 256); 131#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 138#L61-2 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; 139#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 136#L64-1 [2019-01-14 02:50:04,643 INFO L796 eck$LassoCheckResult]: Loop: 136#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 126#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 129#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 112#L80-1 assume !(1 == mp_add_~i~0 % 256); 113#L81-1 assume !(2 == mp_add_~i~0 % 256); 118#L82-1 assume !(3 == mp_add_~i~0 % 256); 119#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 143#L61-2 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; 159#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 160#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 127#L65-2 assume !(1 == mp_add_~i~0 % 256); 128#L66-1 assume !(2 == mp_add_~i~0 % 256); 135#L67-1 assume !(3 == mp_add_~i~0 % 256); 136#L64-1 [2019-01-14 02:50:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1129716831, now seen corresponding path program 1 times [2019-01-14 02:50:04,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:04,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:04,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:04,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:05,115 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-01-14 02:50:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:05,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:05,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:05,165 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:05,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 1 times [2019-01-14 02:50:05,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:05,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:05,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:05,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:05,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:05,370 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:05,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:50:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:50:05,371 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-14 02:50:05,891 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2019-01-14 02:50:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:07,808 INFO L93 Difference]: Finished difference Result 214 states and 320 transitions. [2019-01-14 02:50:07,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:50:07,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 320 transitions. [2019-01-14 02:50:07,816 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2019-01-14 02:50:07,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 320 transitions. [2019-01-14 02:50:07,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-01-14 02:50:07,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2019-01-14 02:50:07,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 320 transitions. [2019-01-14 02:50:07,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:07,825 INFO L706 BuchiCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-01-14 02:50:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 320 transitions. [2019-01-14 02:50:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 128. [2019-01-14 02:50:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-14 02:50:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2019-01-14 02:50:07,842 INFO L729 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2019-01-14 02:50:07,842 INFO L609 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2019-01-14 02:50:07,842 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:50:07,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 181 transitions. [2019-01-14 02:50:07,845 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2019-01-14 02:50:07,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:07,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:07,846 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:07,846 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:07,847 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY 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;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; 410#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 412#L42 assume !(0 == mp_add_~a2~0 % 256); 406#L40-1 mp_add_~nb~0 := 4; 407#L50 assume !(0 == mp_add_~b3~0 % 256); 433#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 434#L61-2 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; 485#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 488#L64-1 [2019-01-14 02:50:07,848 INFO L796 eck$LassoCheckResult]: Loop: 488#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 492#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 417#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 418#L80-1 assume !(1 == mp_add_~i~0 % 256); 428#L81-1 assume !(2 == mp_add_~i~0 % 256); 404#L82-1 assume !(3 == mp_add_~i~0 % 256); 405#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 438#L61-2 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; 448#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 443#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 415#L65-2 assume !(1 == mp_add_~i~0 % 256); 416#L66-1 assume !(2 == mp_add_~i~0 % 256); 444#L67-1 assume !(3 == mp_add_~i~0 % 256); 488#L64-1 [2019-01-14 02:50:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash -360547704, now seen corresponding path program 1 times [2019-01-14 02:50:07,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:08,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:08,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:50:08,165 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:08,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:08,166 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 2 times [2019-01-14 02:50:08,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:08,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:08,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:08,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:08,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:08,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:08,281 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:08,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:50:08,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:50:08,282 INFO L87 Difference]: Start difference. First operand 128 states and 181 transitions. cyclomatic complexity: 56 Second operand 7 states. [2019-01-14 02:50:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:09,668 INFO L93 Difference]: Finished difference Result 373 states and 546 transitions. [2019-01-14 02:50:09,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 02:50:09,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 546 transitions. [2019-01-14 02:50:09,675 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 255 [2019-01-14 02:50:09,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 546 transitions. [2019-01-14 02:50:09,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2019-01-14 02:50:09,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2019-01-14 02:50:09,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 546 transitions. [2019-01-14 02:50:09,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:09,686 INFO L706 BuchiCegarLoop]: Abstraction has 373 states and 546 transitions. [2019-01-14 02:50:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 546 transitions. [2019-01-14 02:50:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 201. [2019-01-14 02:50:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-14 02:50:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 289 transitions. [2019-01-14 02:50:09,717 INFO L729 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2019-01-14 02:50:09,717 INFO L609 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2019-01-14 02:50:09,717 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:50:09,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 289 transitions. [2019-01-14 02:50:09,720 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 119 [2019-01-14 02:50:09,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:09,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:09,721 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:09,721 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:09,726 INFO L794 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY 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;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; 937#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 938#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 965#L44 assume !(0 == mp_add_~a1~0 % 256); 969#L40-1 mp_add_~nb~0 := 4; 988#L50 assume !(0 == mp_add_~b3~0 % 256); 985#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 983#L61-2 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; 984#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 951#L64-1 [2019-01-14 02:50:09,726 INFO L796 eck$LassoCheckResult]: Loop: 951#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 940#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 943#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 944#L80-1 assume !(1 == mp_add_~i~0 % 256); 1081#L81-1 assume !(2 == mp_add_~i~0 % 256); 931#L82-1 assume !(3 == mp_add_~i~0 % 256); 932#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 972#L61-2 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; 973#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 968#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 941#L65-2 assume !(1 == mp_add_~i~0 % 256); 942#L66-1 assume !(2 == mp_add_~i~0 % 256); 950#L67-1 assume !(3 == mp_add_~i~0 % 256); 951#L64-1 [2019-01-14 02:50:09,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:09,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1341941206, now seen corresponding path program 1 times [2019-01-14 02:50:09,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:09,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:09,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:09,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:09,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:10,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:10,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:50:10,012 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 3 times [2019-01-14 02:50:10,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:10,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:10,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:10,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:10,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:10,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:10,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:10,132 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:10,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:50:10,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:50:10,133 INFO L87 Difference]: Start difference. First operand 201 states and 289 transitions. cyclomatic complexity: 93 Second operand 8 states. [2019-01-14 02:50:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:12,504 INFO L93 Difference]: Finished difference Result 418 states and 616 transitions. [2019-01-14 02:50:12,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 02:50:12,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 616 transitions. [2019-01-14 02:50:12,510 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 306 [2019-01-14 02:50:12,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 418 states and 616 transitions. [2019-01-14 02:50:12,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2019-01-14 02:50:12,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2019-01-14 02:50:12,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 418 states and 616 transitions. [2019-01-14 02:50:12,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:12,517 INFO L706 BuchiCegarLoop]: Abstraction has 418 states and 616 transitions. [2019-01-14 02:50:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 616 transitions. [2019-01-14 02:50:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 276. [2019-01-14 02:50:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-14 02:50:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2019-01-14 02:50:12,530 INFO L729 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2019-01-14 02:50:12,530 INFO L609 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2019-01-14 02:50:12,531 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:50:12,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 395 transitions. [2019-01-14 02:50:12,534 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 166 [2019-01-14 02:50:12,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:12,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:12,535 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:12,535 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:12,536 INFO L794 eck$LassoCheckResult]: Stem: 1613#ULTIMATE.startENTRY 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;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; 1581#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1583#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1611#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1617#L40-1 mp_add_~nb~0 := 4; 1625#L50 assume !(0 == mp_add_~b3~0 % 256); 1620#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1621#L61-2 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; 1762#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1808#L64-1 [2019-01-14 02:50:12,537 INFO L796 eck$LassoCheckResult]: Loop: 1808#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1585#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 1588#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1569#L80-1 assume !(1 == mp_add_~i~0 % 256); 1570#L81-1 assume !(2 == mp_add_~i~0 % 256); 1575#L82-1 assume !(3 == mp_add_~i~0 % 256); 1576#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1622#L61-2 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; 1756#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1614#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1586#L65-2 assume !(1 == mp_add_~i~0 % 256); 1587#L66-1 assume !(2 == mp_add_~i~0 % 256); 1815#L67-1 assume !(3 == mp_add_~i~0 % 256); 1808#L64-1 [2019-01-14 02:50:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:12,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199508, now seen corresponding path program 1 times [2019-01-14 02:50:12,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:12,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:12,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:12,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:12,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:12,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:12,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:50:12,791 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:12,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 4 times [2019-01-14 02:50:12,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:12,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:12,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:12,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:12,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:12,892 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:12,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:50:12,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:50:12,893 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. cyclomatic complexity: 126 Second operand 8 states. [2019-01-14 02:50:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:14,570 INFO L93 Difference]: Finished difference Result 375 states and 533 transitions. [2019-01-14 02:50:14,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 02:50:14,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 533 transitions. [2019-01-14 02:50:14,577 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 229 [2019-01-14 02:50:14,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 533 transitions. [2019-01-14 02:50:14,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2019-01-14 02:50:14,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2019-01-14 02:50:14,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 533 transitions. [2019-01-14 02:50:14,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:14,582 INFO L706 BuchiCegarLoop]: Abstraction has 375 states and 533 transitions. [2019-01-14 02:50:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 533 transitions. [2019-01-14 02:50:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 300. [2019-01-14 02:50:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-14 02:50:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 431 transitions. [2019-01-14 02:50:14,593 INFO L729 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2019-01-14 02:50:14,593 INFO L609 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2019-01-14 02:50:14,593 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:50:14,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 431 transitions. [2019-01-14 02:50:14,596 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2019-01-14 02:50:14,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:14,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:14,598 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:14,598 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:14,598 INFO L794 eck$LassoCheckResult]: Stem: 2298#ULTIMATE.startENTRY 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;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; 2263#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2265#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2294#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2259#L40-1 mp_add_~nb~0 := 4; 2260#L50 assume !(0 == mp_add_~b3~0 % 256); 2271#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2286#L61-2 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; 2485#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2272#L65 [2019-01-14 02:50:14,598 INFO L796 eck$LassoCheckResult]: Loop: 2272#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2273#L65-2 assume !(1 == mp_add_~i~0 % 256); 2510#L66-1 assume !(2 == mp_add_~i~0 % 256); 2509#L67-1 assume !(3 == mp_add_~i~0 % 256); 2506#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2504#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 2503#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2494#L80-1 assume !(1 == mp_add_~i~0 % 256); 2502#L81-1 assume !(2 == mp_add_~i~0 % 256); 2490#L82-1 assume !(3 == mp_add_~i~0 % 256); 2488#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2486#L61-2 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; 2487#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2272#L65 [2019-01-14 02:50:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:14,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 1 times [2019-01-14 02:50:14,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:14,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:14,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:14,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 5 times [2019-01-14 02:50:14,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:14,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:14,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:14,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash -833715526, now seen corresponding path program 1 times [2019-01-14 02:50:14,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:14,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:14,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:14,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:14,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:14,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:14,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:50:15,064 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-01-14 02:50:15,107 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:15,108 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:15,108 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:15,108 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:15,109 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:15,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:15,109 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:15,109 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:15,109 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2019-01-14 02:50:15,109 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:15,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:15,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:15,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:15,267 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-14 02:50:15,478 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:15,479 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:15,495 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:15,496 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:15,543 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:15,543 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:17,460 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:17,463 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:17,463 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:17,463 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:17,463 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:17,463 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:17,463 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:17,463 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:17,463 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:17,463 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2019-01-14 02:50:17,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:17,464 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:17,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:17,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:17,614 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-01-14 02:50:17,796 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:17,802 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:17,804 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 [2019-01-14 02:50:17,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:17,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:17,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:17,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:17,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:17,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:17,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:17,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,827 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:50:17,827 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 [2019-01-14 02:50:17,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:17,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,829 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:17,834 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:17,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,837 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 [2019-01-14 02:50:17,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:17,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,838 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:17,843 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:17,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,848 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:50:17,849 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 [2019-01-14 02:50:17,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:17,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,852 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:17,856 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:17,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:17,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:17,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:17,864 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:17,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,873 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:50:17,875 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 [2019-01-14 02:50:17,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:17,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,876 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:17,880 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:17,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,884 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 [2019-01-14 02:50:17,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:17,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,887 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:17,890 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:17,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,899 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:50:17,900 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 [2019-01-14 02:50:17,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:17,900 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:17,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,904 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:17,907 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:17,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:17,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:17,913 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:17,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,913 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:17,918 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:17,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,931 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:50:17,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:17,934 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:17,934 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:17,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,936 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:17,941 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:17,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,948 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 [2019-01-14 02:50:17,949 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:17,950 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:17,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,951 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:17,956 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:17,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,974 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:50:17,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 [2019-01-14 02:50:17,975 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:17,975 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:17,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,976 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:17,986 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:17,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,990 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 [2019-01-14 02:50:17,991 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:17,991 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:17,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,992 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:18,000 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:18,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:18,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:18,019 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:50:18,020 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 [2019-01-14 02:50:18,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:18,020 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:18,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:18,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:18,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:18,024 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:18,027 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:18,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:18,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:18,036 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 [2019-01-14 02:50:18,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:18,036 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:18,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:18,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:18,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:18,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:18,042 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:18,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:18,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:18,053 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:50:18,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 [2019-01-14 02:50:18,054 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:18,054 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:18,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:18,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:18,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:18,058 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:18,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:18,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:18,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:18,077 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 [2019-01-14 02:50:18,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:18,077 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:18,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:18,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:18,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:18,080 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:18,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:18,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:18,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:50:18,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:50:18,105 INFO L87 Difference]: Start difference. First operand 300 states and 431 transitions. cyclomatic complexity: 139 Second operand 6 states. [2019-01-14 02:50:18,687 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2019-01-14 02:50:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:20,168 INFO L93 Difference]: Finished difference Result 612 states and 882 transitions. [2019-01-14 02:50:20,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:50:20,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 612 states and 882 transitions. [2019-01-14 02:50:20,175 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 325 [2019-01-14 02:50:20,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 612 states to 612 states and 882 transitions. [2019-01-14 02:50:20,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 612 [2019-01-14 02:50:20,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 612 [2019-01-14 02:50:20,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 612 states and 882 transitions. [2019-01-14 02:50:20,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:20,183 INFO L706 BuchiCegarLoop]: Abstraction has 612 states and 882 transitions. [2019-01-14 02:50:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states and 882 transitions. [2019-01-14 02:50:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 380. [2019-01-14 02:50:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-14 02:50:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 520 transitions. [2019-01-14 02:50:20,200 INFO L729 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2019-01-14 02:50:20,201 INFO L609 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2019-01-14 02:50:20,201 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:50:20,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 520 transitions. [2019-01-14 02:50:20,205 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2019-01-14 02:50:20,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:20,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:20,207 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:20,209 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:20,209 INFO L794 eck$LassoCheckResult]: Stem: 3219#ULTIMATE.startENTRY 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;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; 3190#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3191#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3217#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3222#L40-1 mp_add_~nb~0 := 4; 3451#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 3216#L52 assume !(0 == mp_add_~b2~0 % 256); 3196#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3210#L61-2 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; 3525#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3524#L65 [2019-01-14 02:50:20,209 INFO L796 eck$LassoCheckResult]: Loop: 3524#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3523#L65-2 assume !(1 == mp_add_~i~0 % 256); 3522#L66-1 assume !(2 == mp_add_~i~0 % 256); 3521#L67-1 assume !(3 == mp_add_~i~0 % 256); 3520#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3189#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 3194#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3176#L80-1 assume !(1 == mp_add_~i~0 % 256); 3177#L81-1 assume !(2 == mp_add_~i~0 % 256); 3261#L82-1 assume !(3 == mp_add_~i~0 % 256); 3254#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3245#L61-2 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; 3246#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3524#L65 [2019-01-14 02:50:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash -438599534, now seen corresponding path program 1 times [2019-01-14 02:50:20,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:20,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:20,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:20,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:20,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 6 times [2019-01-14 02:50:20,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:20,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:20,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:20,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1628339462, now seen corresponding path program 1 times [2019-01-14 02:50:20,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:20,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:20,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:20,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:20,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:20,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:20,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 02:50:20,618 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:20,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:20,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:20,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:20,619 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:20,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:20,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:20,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:20,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2019-01-14 02:50:20,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:20,619 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:20,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:20,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:21,011 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 02:50:21,014 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:21,014 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:21,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:21,022 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:21,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:21,071 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:33,106 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:50:33,109 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:33,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:33,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:33,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:33,109 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:33,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:33,109 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:33,109 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:33,109 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2019-01-14 02:50:33,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:33,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:33,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:33,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:33,378 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-14 02:50:33,490 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-01-14 02:50:33,578 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:33,578 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:33,579 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 [2019-01-14 02:50:33,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:33,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:33,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:33,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,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 [2019-01-14 02:50:33,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:33,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:33,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:33,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,596 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:50:33,596 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 [2019-01-14 02:50:33,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:33,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,599 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:33,600 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:33,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,606 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 [2019-01-14 02:50:33,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:33,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,610 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:33,611 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:33,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,613 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:50:33,615 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 [2019-01-14 02:50:33,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:33,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,618 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:33,619 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:33,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,626 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 [2019-01-14 02:50:33,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:33,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,631 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:33,632 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:33,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,635 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:50:33,636 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 [2019-01-14 02:50:33,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:33,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,637 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:33,641 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:33,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,649 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 [2019-01-14 02:50:33,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:33,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,650 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:33,655 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:33,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,657 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:50:33,659 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 [2019-01-14 02:50:33,660 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:33,660 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:33,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,663 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:33,665 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:33,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,673 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 [2019-01-14 02:50:33,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:33,674 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:33,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,675 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:33,679 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:33,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,683 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:50:33,683 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 [2019-01-14 02:50:33,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:33,684 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:33,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,688 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:33,691 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:33,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,707 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 [2019-01-14 02:50:33,707 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:33,707 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:33,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:33,715 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:33,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,722 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:50:33,722 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 [2019-01-14 02:50:33,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:33,725 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:33,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,726 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:33,731 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:33,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,747 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 [2019-01-14 02:50:33,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:33,748 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:33,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,752 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:33,756 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:33,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,760 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:50:33,760 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 [2019-01-14 02:50:33,763 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:33,763 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:33,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,764 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:33,767 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:33,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,777 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 [2019-01-14 02:50:33,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:33,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:33,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:33,782 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:33,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,790 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:50:33,790 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 [2019-01-14 02:50:33,791 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:33,791 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:33,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,791 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:33,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:33,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,822 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 [2019-01-14 02:50:33,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:33,823 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:33,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:33,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:33,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:33,827 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:33,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:33,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:33,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:33,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:50:33,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:50:33,847 INFO L87 Difference]: Start difference. First operand 380 states and 520 transitions. cyclomatic complexity: 148 Second operand 7 states. [2019-01-14 02:50:34,273 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-14 02:50:34,639 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-14 02:50:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:36,347 INFO L93 Difference]: Finished difference Result 1001 states and 1432 transitions. [2019-01-14 02:50:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:50:36,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1001 states and 1432 transitions. [2019-01-14 02:50:36,359 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 748 [2019-01-14 02:50:36,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1001 states to 1001 states and 1432 transitions. [2019-01-14 02:50:36,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1001 [2019-01-14 02:50:36,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1001 [2019-01-14 02:50:36,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1001 states and 1432 transitions. [2019-01-14 02:50:36,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:36,372 INFO L706 BuchiCegarLoop]: Abstraction has 1001 states and 1432 transitions. [2019-01-14 02:50:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states and 1432 transitions. [2019-01-14 02:50:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 753. [2019-01-14 02:50:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-01-14 02:50:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1081 transitions. [2019-01-14 02:50:36,392 INFO L729 BuchiCegarLoop]: Abstraction has 753 states and 1081 transitions. [2019-01-14 02:50:36,392 INFO L609 BuchiCegarLoop]: Abstraction has 753 states and 1081 transitions. [2019-01-14 02:50:36,392 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:50:36,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 753 states and 1081 transitions. [2019-01-14 02:50:36,398 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 576 [2019-01-14 02:50:36,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:36,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:36,401 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:36,401 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:36,401 INFO L794 eck$LassoCheckResult]: Stem: 4628#ULTIMATE.startENTRY 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;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; 4590#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 4592#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 4625#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 4629#L40-1 mp_add_~nb~0 := 4; 4737#L50 assume !(0 == mp_add_~b3~0 % 256); 4738#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5128#L61-2 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; 5127#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5046#L65 [2019-01-14 02:50:36,401 INFO L796 eck$LassoCheckResult]: Loop: 5046#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5126#L65-2 assume !(1 == mp_add_~i~0 % 256); 5125#L66-1 assume !(2 == mp_add_~i~0 % 256); 5124#L67-1 assume !(3 == mp_add_~i~0 % 256); 5123#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5122#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5052#L71-2 assume !(1 == mp_add_~i~0 % 256); 5121#L72-1 assume !(2 == mp_add_~i~0 % 256); 5120#L73-1 assume !(3 == mp_add_~i~0 % 256); 5119#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 5118#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5037#L80-1 assume !(1 == mp_add_~i~0 % 256); 5034#L81-1 assume !(2 == mp_add_~i~0 % 256); 5113#L82-1 assume !(3 == mp_add_~i~0 % 256); 5112#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5088#L61-2 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; 5055#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5046#L65 [2019-01-14 02:50:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:36,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 2 times [2019-01-14 02:50:36,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:36,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:36,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:36,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:36,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:36,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1235554401, now seen corresponding path program 1 times [2019-01-14 02:50:36,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:36,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:36,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:36,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:36,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:36,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1592238830, now seen corresponding path program 1 times [2019-01-14 02:50:36,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:36,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:36,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:36,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:36,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:36,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:36,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:36,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:37,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:37,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:50:37,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-01-14 02:50:37,803 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:37,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:37,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:37,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:37,803 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:37,803 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:37,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:37,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:37,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2019-01-14 02:50:37,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:37,804 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:37,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:37,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:38,123 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-01-14 02:50:38,257 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:38,257 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:38,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:38,261 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:38,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:38,333 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:39,436 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:39,438 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:39,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:39,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:39,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:39,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:39,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:39,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:39,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:39,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2019-01-14 02:50:39,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:39,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:39,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:39,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:39,592 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-14 02:50:39,744 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-01-14 02:50:39,865 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:39,866 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:39,866 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 [2019-01-14 02:50:39,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:39,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:39,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:39,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:39,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:39,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:39,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:39,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:39,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:39,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:39,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:39,886 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:50:39,887 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 [2019-01-14 02:50:39,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:39,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,891 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:39,892 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:39,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:39,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:39,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:39,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:39,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,898 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:39,902 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:39,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:39,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:39,906 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:50:39,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:39,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:39,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,909 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:39,914 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:39,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:39,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:39,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:39,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:39,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:39,928 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:39,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:39,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:39,931 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:50:39,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:39,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:39,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,935 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:39,938 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:39,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:39,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:39,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 [2019-01-14 02:50:39,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:39,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,946 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:39,951 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:39,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:39,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:39,954 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:50:39,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:39,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:39,956 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:39,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,956 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:39,961 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:39,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:39,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:39,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 [2019-01-14 02:50:39,979 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:39,979 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:39,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,980 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:39,987 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:39,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:39,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:39,992 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:50:39,992 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 [2019-01-14 02:50:39,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:39,993 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:39,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:39,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:39,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:39,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:39,997 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:39,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:40,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:40,009 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 [2019-01-14 02:50:40,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:40,009 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:40,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:40,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:40,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:40,010 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:40,017 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:40,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:40,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:40,024 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:50:40,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:40,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:40,025 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:40,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:40,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:40,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:40,028 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:40,033 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:40,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:40,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:40,049 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 [2019-01-14 02:50:40,049 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:40,049 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:40,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:40,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:40,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:40,050 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:40,060 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:40,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:40,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:40,064 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:50:40,065 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 [2019-01-14 02:50:40,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:40,065 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:40,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:40,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:40,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:40,066 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:40,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:40,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:40,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:40,082 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 [2019-01-14 02:50:40,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:40,086 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:40,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:40,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:40,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:40,087 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:40,088 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:40,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:40,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:40,100 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:50:40,101 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 [2019-01-14 02:50:40,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:40,105 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:40,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:40,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:40,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:40,106 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:40,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:40,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:40,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:40,133 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 [2019-01-14 02:50:40,134 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:40,134 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:40,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:40,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:40,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:40,139 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:40,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:40,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:40,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:40,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 02:50:40,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-14 02:50:40,159 INFO L87 Difference]: Start difference. First operand 753 states and 1081 transitions. cyclomatic complexity: 346 Second operand 14 states. [2019-01-14 02:50:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:45,297 INFO L93 Difference]: Finished difference Result 1083 states and 1433 transitions. [2019-01-14 02:50:45,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 02:50:45,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1083 states and 1433 transitions. [2019-01-14 02:50:45,305 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 883 [2019-01-14 02:50:45,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1083 states to 1073 states and 1420 transitions. [2019-01-14 02:50:45,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1073 [2019-01-14 02:50:45,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1073 [2019-01-14 02:50:45,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1073 states and 1420 transitions. [2019-01-14 02:50:45,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:45,318 INFO L706 BuchiCegarLoop]: Abstraction has 1073 states and 1420 transitions. [2019-01-14 02:50:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states and 1420 transitions. [2019-01-14 02:50:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1028. [2019-01-14 02:50:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-01-14 02:50:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1372 transitions. [2019-01-14 02:50:45,341 INFO L729 BuchiCegarLoop]: Abstraction has 1028 states and 1372 transitions. [2019-01-14 02:50:45,341 INFO L609 BuchiCegarLoop]: Abstraction has 1028 states and 1372 transitions. [2019-01-14 02:50:45,341 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:50:45,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1028 states and 1372 transitions. [2019-01-14 02:50:45,348 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 846 [2019-01-14 02:50:45,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:45,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:45,350 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:45,351 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:45,351 INFO L794 eck$LassoCheckResult]: Stem: 6575#ULTIMATE.startENTRY 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;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; 6542#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 6543#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 6571#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 6578#L40-1 mp_add_~nb~0 := 4; 6651#L50 assume !(0 == mp_add_~b3~0 % 256); 6652#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6733#L61-2 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; 6732#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6731#L65 [2019-01-14 02:50:45,352 INFO L796 eck$LassoCheckResult]: Loop: 6731#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6730#L65-2 assume !(1 == mp_add_~i~0 % 256); 6729#L66-1 assume !(2 == mp_add_~i~0 % 256); 6728#L67-1 assume !(3 == mp_add_~i~0 % 256); 6727#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6726#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6725#L71-2 assume !(1 == mp_add_~i~0 % 256); 6724#L72-1 assume !(2 == mp_add_~i~0 % 256); 6723#L73-1 assume !(3 == mp_add_~i~0 % 256); 6722#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6721#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6720#L80-1 assume !(1 == mp_add_~i~0 % 256); 6719#L81-1 assume !(2 == mp_add_~i~0 % 256); 6718#L82-1 assume !(3 == mp_add_~i~0 % 256); 6717#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6716#L61-2 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; 6715#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6714#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6713#L71 assume !(0 == mp_add_~i~0 % 256); 6712#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; 6711#L72-1 assume !(2 == mp_add_~i~0 % 256); 6709#L73-1 assume !(3 == mp_add_~i~0 % 256); 6707#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6705#L76-1 assume !(0 == mp_add_~i~0 % 256); 6703#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 6684#L81-1 assume !(2 == mp_add_~i~0 % 256); 6702#L82-1 assume !(3 == mp_add_~i~0 % 256); 6701#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6700#L61-2 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; 6699#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6698#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6693#L71 assume !(0 == mp_add_~i~0 % 256); 6696#L71-2 assume !(1 == mp_add_~i~0 % 256); 6694#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; 6690#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; 6691#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6686#L76-1 assume !(0 == mp_add_~i~0 % 256); 6687#L80-1 assume !(1 == mp_add_~i~0 % 256); 6681#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 6682#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 6634#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6635#L61-2 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; 6695#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6692#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6688#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6689#L76-1 assume !(0 == mp_add_~i~0 % 256); 6683#L80-1 assume !(1 == mp_add_~i~0 % 256); 6685#L81-1 assume !(2 == mp_add_~i~0 % 256); 6639#L82-1 assume !(3 == mp_add_~i~0 % 256); 6640#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6610#L61-2 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; 6611#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6731#L65 [2019-01-14 02:50:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 3 times [2019-01-14 02:50:45,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:45,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:45,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:45,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:45,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:45,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1975040067, now seen corresponding path program 1 times [2019-01-14 02:50:45,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:45,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:45,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:45,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 02:50:45,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:45,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:50:45,472 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:45,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:45,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:45,473 INFO L87 Difference]: Start difference. First operand 1028 states and 1372 transitions. cyclomatic complexity: 362 Second operand 3 states. [2019-01-14 02:50:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:45,616 INFO L93 Difference]: Finished difference Result 1157 states and 1561 transitions. [2019-01-14 02:50:45,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:45,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1157 states and 1561 transitions. [2019-01-14 02:50:45,626 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 972 [2019-01-14 02:50:45,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1157 states to 1157 states and 1561 transitions. [2019-01-14 02:50:45,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1157 [2019-01-14 02:50:45,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1157 [2019-01-14 02:50:45,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1157 states and 1561 transitions. [2019-01-14 02:50:45,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:45,640 INFO L706 BuchiCegarLoop]: Abstraction has 1157 states and 1561 transitions. [2019-01-14 02:50:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states and 1561 transitions. [2019-01-14 02:50:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1061. [2019-01-14 02:50:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-01-14 02:50:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1427 transitions. [2019-01-14 02:50:45,665 INFO L729 BuchiCegarLoop]: Abstraction has 1061 states and 1427 transitions. [2019-01-14 02:50:45,665 INFO L609 BuchiCegarLoop]: Abstraction has 1061 states and 1427 transitions. [2019-01-14 02:50:45,665 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:50:45,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1061 states and 1427 transitions. [2019-01-14 02:50:45,672 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 880 [2019-01-14 02:50:45,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:45,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:45,675 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:45,675 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:45,675 INFO L794 eck$LassoCheckResult]: Stem: 8768#ULTIMATE.startENTRY 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;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; 8733#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 8734#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 8764#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 8770#L40-1 mp_add_~nb~0 := 4; 8813#L50 assume !(0 == mp_add_~b3~0 % 256); 8814#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8981#L61-2 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; 8980#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8979#L65 [2019-01-14 02:50:45,675 INFO L796 eck$LassoCheckResult]: Loop: 8979#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8978#L65-2 assume !(1 == mp_add_~i~0 % 256); 8977#L66-1 assume !(2 == mp_add_~i~0 % 256); 8976#L67-1 assume !(3 == mp_add_~i~0 % 256); 8975#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8974#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8973#L71-2 assume !(1 == mp_add_~i~0 % 256); 8972#L72-1 assume !(2 == mp_add_~i~0 % 256); 8971#L73-1 assume !(3 == mp_add_~i~0 % 256); 8970#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 8969#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8968#L80-1 assume !(1 == mp_add_~i~0 % 256); 8967#L81-1 assume !(2 == mp_add_~i~0 % 256); 8966#L82-1 assume !(3 == mp_add_~i~0 % 256); 8965#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8964#L61-2 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; 8963#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8962#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8961#L71 assume !(0 == mp_add_~i~0 % 256); 8960#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; 8959#L72-1 assume !(2 == mp_add_~i~0 % 256); 8958#L73-1 assume !(3 == mp_add_~i~0 % 256); 8957#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 8956#L76-1 assume !(0 == mp_add_~i~0 % 256); 8951#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 8923#L81-1 assume !(2 == mp_add_~i~0 % 256); 8950#L82-1 assume !(3 == mp_add_~i~0 % 256); 8949#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8948#L61-2 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; 8947#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8935#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8934#L71 assume !(0 == mp_add_~i~0 % 256); 8932#L71-2 assume !(1 == mp_add_~i~0 % 256); 8930#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; 8929#L73-1 assume !(3 == mp_add_~i~0 % 256); 8928#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 8927#L76-1 assume !(0 == mp_add_~i~0 % 256); 8926#L80-1 assume !(1 == mp_add_~i~0 % 256); 8925#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 8866#L82-1 assume !(3 == mp_add_~i~0 % 256); 8862#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8863#L61-2 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; 8937#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8938#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8946#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 8940#L76-1 assume !(0 == mp_add_~i~0 % 256); 8941#L80-1 assume !(1 == mp_add_~i~0 % 256); 8867#L81-1 assume !(2 == mp_add_~i~0 % 256); 8868#L82-1 assume !(3 == mp_add_~i~0 % 256); 8982#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8849#L61-2 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; 8850#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8979#L65 [2019-01-14 02:50:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 4 times [2019-01-14 02:50:45,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:45,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:45,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:45,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:45,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:45,705 INFO L82 PathProgramCache]: Analyzing trace with hash -605910653, now seen corresponding path program 1 times [2019-01-14 02:50:45,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:45,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:45,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:46,016 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-14 02:50:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-14 02:50:46,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:46,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:46,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:46,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 02:50:46,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:50:46,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 02:50:46,380 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:46,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:50:46,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:50:46,380 INFO L87 Difference]: Start difference. First operand 1061 states and 1427 transitions. cyclomatic complexity: 382 Second operand 6 states. [2019-01-14 02:50:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:46,908 INFO L93 Difference]: Finished difference Result 1927 states and 2522 transitions. [2019-01-14 02:50:46,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:50:46,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1927 states and 2522 transitions. [2019-01-14 02:50:46,924 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 1704 [2019-01-14 02:50:46,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1927 states to 1927 states and 2522 transitions. [2019-01-14 02:50:46,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1927 [2019-01-14 02:50:46,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1927 [2019-01-14 02:50:46,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1927 states and 2522 transitions. [2019-01-14 02:50:46,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:46,945 INFO L706 BuchiCegarLoop]: Abstraction has 1927 states and 2522 transitions. [2019-01-14 02:50:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states and 2522 transitions. [2019-01-14 02:50:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1348. [2019-01-14 02:50:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-01-14 02:50:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1825 transitions. [2019-01-14 02:50:46,986 INFO L729 BuchiCegarLoop]: Abstraction has 1348 states and 1825 transitions. [2019-01-14 02:50:46,986 INFO L609 BuchiCegarLoop]: Abstraction has 1348 states and 1825 transitions. [2019-01-14 02:50:46,986 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:50:46,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1348 states and 1825 transitions. [2019-01-14 02:50:46,998 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 1167 [2019-01-14 02:50:46,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:46,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:46,999 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:46,999 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:46,999 INFO L794 eck$LassoCheckResult]: Stem: 11924#ULTIMATE.startENTRY 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;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; 11888#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 11889#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 11922#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 11928#L40-1 mp_add_~nb~0 := 4; 11972#L50 assume !(0 == mp_add_~b3~0 % 256); 11973#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 12137#L61-2 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; 12134#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12132#L65 [2019-01-14 02:50:47,005 INFO L796 eck$LassoCheckResult]: Loop: 12132#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12131#L65-2 assume !(1 == mp_add_~i~0 % 256); 12130#L66-1 assume !(2 == mp_add_~i~0 % 256); 12129#L67-1 assume !(3 == mp_add_~i~0 % 256); 12128#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12127#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12126#L71-2 assume !(1 == mp_add_~i~0 % 256); 12125#L72-1 assume !(2 == mp_add_~i~0 % 256); 12124#L73-1 assume !(3 == mp_add_~i~0 % 256); 12123#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 12122#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12121#L80-1 assume !(1 == mp_add_~i~0 % 256); 12120#L81-1 assume !(2 == mp_add_~i~0 % 256); 12119#L82-1 assume !(3 == mp_add_~i~0 % 256); 12118#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12117#L61-2 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; 12116#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12113#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12112#L71 assume !(0 == mp_add_~i~0 % 256); 12111#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; 12110#L72-1 assume !(2 == mp_add_~i~0 % 256); 12109#L73-1 assume !(3 == mp_add_~i~0 % 256); 12108#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 12106#L76-1 assume !(0 == mp_add_~i~0 % 256); 12104#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 12073#L81-1 assume !(2 == mp_add_~i~0 % 256); 12103#L82-1 assume !(3 == mp_add_~i~0 % 256); 12102#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12101#L61-2 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; 12057#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12085#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12084#L71 assume !(0 == mp_add_~i~0 % 256); 12082#L71-2 assume !(1 == mp_add_~i~0 % 256); 12080#L72-1 assume !(2 == mp_add_~i~0 % 256); 12081#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; 12092#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; 12142#L76-1 assume !(0 == mp_add_~i~0 % 256); 12099#L80-1 assume !(1 == mp_add_~i~0 % 256); 12100#L81-1 assume !(2 == mp_add_~i~0 % 256); 12097#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 12061#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12062#L61-2 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; 12094#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12093#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12090#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; 12088#L76-1 assume !(0 == mp_add_~i~0 % 256); 12089#L80-1 assume !(1 == mp_add_~i~0 % 256); 12068#L81-1 assume !(2 == mp_add_~i~0 % 256); 12070#L82-1 assume !(3 == mp_add_~i~0 % 256); 12138#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12095#L61-2 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; 12096#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12132#L65 [2019-01-14 02:50:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 5 times [2019-01-14 02:50:47,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:47,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:47,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:47,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:47,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:47,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:47,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1672673603, now seen corresponding path program 1 times [2019-01-14 02:50:47,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:47,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:47,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:47,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:47,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:47,409 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-01-14 02:50:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 02:50:47,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:47,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:47,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:47,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 02:50:47,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:50:47,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-01-14 02:50:47,874 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:47,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:50:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:50:47,875 INFO L87 Difference]: Start difference. First operand 1348 states and 1825 transitions. cyclomatic complexity: 493 Second operand 8 states. [2019-01-14 02:50:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:48,367 INFO L93 Difference]: Finished difference Result 2324 states and 2850 transitions. [2019-01-14 02:50:48,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:50:48,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2324 states and 2850 transitions. [2019-01-14 02:50:48,381 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 1919 [2019-01-14 02:50:48,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2324 states to 2217 states and 2733 transitions. [2019-01-14 02:50:48,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2217 [2019-01-14 02:50:48,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2217 [2019-01-14 02:50:48,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2217 states and 2733 transitions. [2019-01-14 02:50:48,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:48,405 INFO L706 BuchiCegarLoop]: Abstraction has 2217 states and 2733 transitions. [2019-01-14 02:50:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states and 2733 transitions. [2019-01-14 02:50:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1462. [2019-01-14 02:50:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2019-01-14 02:50:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1917 transitions. [2019-01-14 02:50:48,443 INFO L729 BuchiCegarLoop]: Abstraction has 1462 states and 1917 transitions. [2019-01-14 02:50:48,443 INFO L609 BuchiCegarLoop]: Abstraction has 1462 states and 1917 transitions. [2019-01-14 02:50:48,443 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:50:48,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1462 states and 1917 transitions. [2019-01-14 02:50:48,455 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1374 [2019-01-14 02:50:48,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:48,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:48,456 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:48,456 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:48,456 INFO L794 eck$LassoCheckResult]: Stem: 15765#ULTIMATE.startENTRY 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;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; 15730#L40 assume !(0 == mp_add_~a3~0 % 256); 15731#L40-1 mp_add_~nb~0 := 4; 15757#L50 assume !(0 == mp_add_~b3~0 % 256); 15758#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 17153#L61-2 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; 17152#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 17151#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16890#L65-2 [2019-01-14 02:50:48,456 INFO L796 eck$LassoCheckResult]: Loop: 16890#L65-2 assume !(1 == mp_add_~i~0 % 256); 17149#L66-1 assume !(2 == mp_add_~i~0 % 256); 17148#L67-1 assume !(3 == mp_add_~i~0 % 256); 17146#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 17144#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 16950#L71-2 assume !(1 == mp_add_~i~0 % 256); 17141#L72-1 assume !(2 == mp_add_~i~0 % 256); 17140#L73-1 assume !(3 == mp_add_~i~0 % 256); 17138#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 17136#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 16930#L80-1 assume !(1 == mp_add_~i~0 % 256); 17132#L81-1 assume !(2 == mp_add_~i~0 % 256); 17133#L82-1 assume !(3 == mp_add_~i~0 % 256); 15760#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15761#L61-2 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; 17128#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 17124#L65 assume !(0 == mp_add_~i~0 % 256); 17125#L65-2 assume !(1 == mp_add_~i~0 % 256); 17122#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; 17121#L67-1 assume !(3 == mp_add_~i~0 % 256); 17120#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 17119#L71 assume !(0 == mp_add_~i~0 % 256); 17118#L71-2 assume !(1 == mp_add_~i~0 % 256); 17117#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; 17116#L73-1 assume !(3 == mp_add_~i~0 % 256); 17114#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 17113#L76-1 assume !(0 == mp_add_~i~0 % 256); 17112#L80-1 assume !(1 == mp_add_~i~0 % 256); 17111#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 16855#L82-1 assume !(3 == mp_add_~i~0 % 256); 17086#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16845#L61-2 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; 16846#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16889#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16890#L65-2 [2019-01-14 02:50:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 1 times [2019-01-14 02:50:48,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:48,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:48,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:48,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:48,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:48,482 INFO L82 PathProgramCache]: Analyzing trace with hash 801043905, now seen corresponding path program 1 times [2019-01-14 02:50:48,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:48,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:48,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:48,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:48,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:50:48,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:48,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:48,742 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:48,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:50:48,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:50:48,742 INFO L87 Difference]: Start difference. First operand 1462 states and 1917 transitions. cyclomatic complexity: 470 Second operand 5 states. [2019-01-14 02:50:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:49,064 INFO L93 Difference]: Finished difference Result 2363 states and 3006 transitions. [2019-01-14 02:50:49,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:50:49,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2363 states and 3006 transitions. [2019-01-14 02:50:49,075 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 2266 [2019-01-14 02:50:49,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2363 states to 2363 states and 3006 transitions. [2019-01-14 02:50:49,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2363 [2019-01-14 02:50:49,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2363 [2019-01-14 02:50:49,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2363 states and 3006 transitions. [2019-01-14 02:50:49,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:49,098 INFO L706 BuchiCegarLoop]: Abstraction has 2363 states and 3006 transitions. [2019-01-14 02:50:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states and 3006 transitions. [2019-01-14 02:50:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1465. [2019-01-14 02:50:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-01-14 02:50:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1912 transitions. [2019-01-14 02:50:49,132 INFO L729 BuchiCegarLoop]: Abstraction has 1465 states and 1912 transitions. [2019-01-14 02:50:49,132 INFO L609 BuchiCegarLoop]: Abstraction has 1465 states and 1912 transitions. [2019-01-14 02:50:49,132 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 02:50:49,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1465 states and 1912 transitions. [2019-01-14 02:50:49,141 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1377 [2019-01-14 02:50:49,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:49,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:49,142 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:49,142 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:49,145 INFO L794 eck$LassoCheckResult]: Stem: 19599#ULTIMATE.startENTRY 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;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; 19568#L40 assume !(0 == mp_add_~a3~0 % 256); 19565#L40-1 mp_add_~nb~0 := 4; 19566#L50 assume !(0 == mp_add_~b3~0 % 256); 20459#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 20801#L61-2 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; 20800#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20799#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 20270#L65-2 [2019-01-14 02:50:49,146 INFO L796 eck$LassoCheckResult]: Loop: 20270#L65-2 assume !(1 == mp_add_~i~0 % 256); 20798#L66-1 assume !(2 == mp_add_~i~0 % 256); 20797#L67-1 assume !(3 == mp_add_~i~0 % 256); 20796#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 20795#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 20793#L71-2 assume !(1 == mp_add_~i~0 % 256); 20792#L72-1 assume !(2 == mp_add_~i~0 % 256); 20791#L73-1 assume !(3 == mp_add_~i~0 % 256); 20790#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 20789#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 20787#L80-1 assume !(1 == mp_add_~i~0 % 256); 20788#L81-1 assume !(2 == mp_add_~i~0 % 256); 20810#L82-1 assume !(3 == mp_add_~i~0 % 256); 20809#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20781#L61-2 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; 20782#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20777#L65 assume !(0 == mp_add_~i~0 % 256); 20778#L65-2 assume !(1 == mp_add_~i~0 % 256); 20775#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; 20712#L67-1 assume !(3 == mp_add_~i~0 % 256); 20774#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 20773#L71 assume !(0 == mp_add_~i~0 % 256); 20772#L71-2 assume !(1 == mp_add_~i~0 % 256); 20771#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; 20700#L73-1 assume !(3 == mp_add_~i~0 % 256); 20770#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; 20769#L76-1 assume !(0 == mp_add_~i~0 % 256); 20767#L80-1 assume !(1 == mp_add_~i~0 % 256); 20735#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 20732#L82-1 assume !(3 == mp_add_~i~0 % 256); 20730#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20719#L61-2 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; 20720#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 20725#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20723#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; 20692#L76-1 assume !(0 == mp_add_~i~0 % 256); 20688#L80-1 assume !(1 == mp_add_~i~0 % 256); 20689#L81-1 assume !(2 == mp_add_~i~0 % 256); 20677#L82-1 assume !(3 == mp_add_~i~0 % 256); 20676#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20668#L61-2 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; 20669#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20269#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 20270#L65-2 [2019-01-14 02:50:49,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 2 times [2019-01-14 02:50:49,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:49,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:49,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:49,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1828321911, now seen corresponding path program 1 times [2019-01-14 02:50:49,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:49,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:49,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:49,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:49,601 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2019-01-14 02:50:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:50:49,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:49,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:49,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:49,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 02:50:50,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:50:50,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-01-14 02:50:50,063 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:50,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:50:50,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:50:50,063 INFO L87 Difference]: Start difference. First operand 1465 states and 1912 transitions. cyclomatic complexity: 462 Second operand 10 states. [2019-01-14 02:50:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:50,693 INFO L93 Difference]: Finished difference Result 2420 states and 2923 transitions. [2019-01-14 02:50:50,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:50:50,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2420 states and 2923 transitions. [2019-01-14 02:50:50,704 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 2021 [2019-01-14 02:50:50,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2420 states to 2339 states and 2834 transitions. [2019-01-14 02:50:50,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2339 [2019-01-14 02:50:50,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2339 [2019-01-14 02:50:50,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2339 states and 2834 transitions. [2019-01-14 02:50:50,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:50,723 INFO L706 BuchiCegarLoop]: Abstraction has 2339 states and 2834 transitions. [2019-01-14 02:50:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states and 2834 transitions. [2019-01-14 02:50:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 1566. [2019-01-14 02:50:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-01-14 02:50:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1992 transitions. [2019-01-14 02:50:50,760 INFO L729 BuchiCegarLoop]: Abstraction has 1566 states and 1992 transitions. [2019-01-14 02:50:50,760 INFO L609 BuchiCegarLoop]: Abstraction has 1566 states and 1992 transitions. [2019-01-14 02:50:50,760 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 02:50:50,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1566 states and 1992 transitions. [2019-01-14 02:50:50,767 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1471 [2019-01-14 02:50:50,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:50,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:50,769 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:50,770 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:50,770 INFO L794 eck$LassoCheckResult]: Stem: 23630#ULTIMATE.startENTRY 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;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; 23598#L40 assume !(0 == mp_add_~a3~0 % 256); 23595#L40-1 mp_add_~nb~0 := 4; 23596#L50 assume !(0 == mp_add_~b3~0 % 256); 24567#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 25007#L61-2 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; 25006#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25005#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 24837#L65-2 [2019-01-14 02:50:50,773 INFO L796 eck$LassoCheckResult]: Loop: 24837#L65-2 assume !(1 == mp_add_~i~0 % 256); 25004#L66-1 assume !(2 == mp_add_~i~0 % 256); 25003#L67-1 assume !(3 == mp_add_~i~0 % 256); 25002#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25001#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 24889#L71-2 assume !(1 == mp_add_~i~0 % 256); 25000#L72-1 assume !(2 == mp_add_~i~0 % 256); 24999#L73-1 assume !(3 == mp_add_~i~0 % 256); 24998#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 24997#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 24872#L80-1 assume !(1 == mp_add_~i~0 % 256); 24996#L81-1 assume !(2 == mp_add_~i~0 % 256); 24995#L82-1 assume !(3 == mp_add_~i~0 % 256); 24994#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24993#L61-2 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; 24992#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24991#L65 assume !(0 == mp_add_~i~0 % 256); 24990#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; 24835#L66-1 assume !(2 == mp_add_~i~0 % 256); 24989#L67-1 assume !(3 == mp_add_~i~0 % 256); 24988#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24987#L71 assume !(0 == mp_add_~i~0 % 256); 24986#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; 24887#L72-1 assume !(2 == mp_add_~i~0 % 256); 24985#L73-1 assume !(3 == mp_add_~i~0 % 256); 24984#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 24983#L76-1 assume !(0 == mp_add_~i~0 % 256); 24982#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 24908#L81-1 assume !(2 == mp_add_~i~0 % 256); 24981#L82-1 assume !(3 == mp_add_~i~0 % 256); 24980#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24979#L61-2 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; 24978#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24977#L65 assume !(0 == mp_add_~i~0 % 256); 24976#L65-2 assume !(1 == mp_add_~i~0 % 256); 24975#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; 24833#L67-1 assume !(3 == mp_add_~i~0 % 256); 24974#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24973#L71 assume !(0 == mp_add_~i~0 % 256); 24972#L71-2 assume !(1 == mp_add_~i~0 % 256); 24971#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; 24884#L73-1 assume !(3 == mp_add_~i~0 % 256); 24963#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 24959#L76-1 assume !(0 == mp_add_~i~0 % 256); 24958#L80-1 assume !(1 == mp_add_~i~0 % 256); 24957#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 24863#L82-1 assume !(3 == mp_add_~i~0 % 256); 24941#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24938#L61-2 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; 24935#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24934#L65 assume !(0 == mp_add_~i~0 % 256); 24933#L65-2 assume !(1 == mp_add_~i~0 % 256); 24932#L66-1 assume !(2 == mp_add_~i~0 % 256); 24931#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; 24831#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24926#L71 assume !(0 == mp_add_~i~0 % 256); 24923#L71-2 assume !(1 == mp_add_~i~0 % 256); 24922#L72-1 assume !(2 == mp_add_~i~0 % 256); 24921#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; 24880#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; 24919#L76-1 assume !(0 == mp_add_~i~0 % 256); 24917#L80-1 assume !(1 == mp_add_~i~0 % 256); 24915#L81-1 assume !(2 == mp_add_~i~0 % 256); 24907#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 24903#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24902#L61-2 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; 24900#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24898#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 24895#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; 24894#L76-1 assume !(0 == mp_add_~i~0 % 256); 24893#L80-1 assume !(1 == mp_add_~i~0 % 256); 24892#L81-1 assume !(2 == mp_add_~i~0 % 256); 24891#L82-1 assume !(3 == mp_add_~i~0 % 256); 24890#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24888#L61-2 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; 24885#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24858#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 24882#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; 24909#L76-1 assume !(0 == mp_add_~i~0 % 256); 24874#L80-1 assume !(1 == mp_add_~i~0 % 256); 24875#L81-1 assume !(2 == mp_add_~i~0 % 256); 24853#L82-1 assume !(3 == mp_add_~i~0 % 256); 24854#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24843#L61-2 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; 24844#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24836#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 24837#L65-2 [2019-01-14 02:50:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:50,775 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 3 times [2019-01-14 02:50:50,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:50,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:50,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:50,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:50,809 INFO L82 PathProgramCache]: Analyzing trace with hash -169767625, now seen corresponding path program 1 times [2019-01-14 02:50:50,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:50,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:50,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:51,216 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-14 02:50:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-01-14 02:50:51,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:51,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:51,231 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:50:51,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:50:51,231 INFO L87 Difference]: Start difference. First operand 1566 states and 1992 transitions. cyclomatic complexity: 441 Second operand 4 states. [2019-01-14 02:50:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:51,378 INFO L93 Difference]: Finished difference Result 2259 states and 2769 transitions. [2019-01-14 02:50:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:50:51,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2259 states and 2769 transitions. [2019-01-14 02:50:51,388 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 2138 [2019-01-14 02:50:51,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2259 states to 2259 states and 2769 transitions. [2019-01-14 02:50:51,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2259 [2019-01-14 02:50:51,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2259 [2019-01-14 02:50:51,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2259 states and 2769 transitions. [2019-01-14 02:50:51,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:51,408 INFO L706 BuchiCegarLoop]: Abstraction has 2259 states and 2769 transitions. [2019-01-14 02:50:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states and 2769 transitions. [2019-01-14 02:50:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1660. [2019-01-14 02:50:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-01-14 02:50:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2094 transitions. [2019-01-14 02:50:51,438 INFO L729 BuchiCegarLoop]: Abstraction has 1660 states and 2094 transitions. [2019-01-14 02:50:51,438 INFO L609 BuchiCegarLoop]: Abstraction has 1660 states and 2094 transitions. [2019-01-14 02:50:51,438 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 02:50:51,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1660 states and 2094 transitions. [2019-01-14 02:50:51,445 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1563 [2019-01-14 02:50:51,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:51,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:51,446 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:51,447 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:51,447 INFO L794 eck$LassoCheckResult]: Stem: 27462#ULTIMATE.startENTRY 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;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; 27430#L40 assume !(0 == mp_add_~a3~0 % 256); 27431#L40-1 mp_add_~nb~0 := 4; 27453#L50 assume !(0 == mp_add_~b3~0 % 256); 27454#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 28930#L61-2 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; 28929#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28928#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 28847#L65-2 [2019-01-14 02:50:51,447 INFO L796 eck$LassoCheckResult]: Loop: 28847#L65-2 assume !(1 == mp_add_~i~0 % 256); 28927#L66-1 assume !(2 == mp_add_~i~0 % 256); 28926#L67-1 assume !(3 == mp_add_~i~0 % 256); 28925#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28924#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 28837#L71-2 assume !(1 == mp_add_~i~0 % 256); 28923#L72-1 assume !(2 == mp_add_~i~0 % 256); 28922#L73-1 assume !(3 == mp_add_~i~0 % 256); 28921#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28920#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 28821#L80-1 assume !(1 == mp_add_~i~0 % 256); 28919#L81-1 assume !(2 == mp_add_~i~0 % 256); 28918#L82-1 assume !(3 == mp_add_~i~0 % 256); 28917#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28916#L61-2 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; 28915#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28914#L65 assume !(0 == mp_add_~i~0 % 256); 28913#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; 28846#L66-1 assume !(2 == mp_add_~i~0 % 256); 28912#L67-1 assume !(3 == mp_add_~i~0 % 256); 28911#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28910#L71 assume !(0 == mp_add_~i~0 % 256); 28909#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; 28834#L72-1 assume !(2 == mp_add_~i~0 % 256); 28908#L73-1 assume !(3 == mp_add_~i~0 % 256); 28907#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28906#L76-1 assume !(0 == mp_add_~i~0 % 256); 28905#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 28798#L81-1 assume !(2 == mp_add_~i~0 % 256); 28904#L82-1 assume !(3 == mp_add_~i~0 % 256); 28903#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28902#L61-2 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; 28901#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28900#L65 assume !(0 == mp_add_~i~0 % 256); 28899#L65-2 assume !(1 == mp_add_~i~0 % 256); 28898#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; 28844#L67-1 assume !(3 == mp_add_~i~0 % 256); 28897#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28896#L71 assume !(0 == mp_add_~i~0 % 256); 28895#L71-2 assume !(1 == mp_add_~i~0 % 256); 28894#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; 28831#L73-1 assume !(3 == mp_add_~i~0 % 256); 28893#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28892#L76-1 assume !(0 == mp_add_~i~0 % 256); 28891#L80-1 assume !(1 == mp_add_~i~0 % 256); 28890#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 28792#L82-1 assume !(3 == mp_add_~i~0 % 256); 28889#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28885#L61-2 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; 28884#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28873#L65 assume !(0 == mp_add_~i~0 % 256); 28872#L65-2 assume !(1 == mp_add_~i~0 % 256); 28870#L66-1 assume !(2 == mp_add_~i~0 % 256); 28868#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; 28841#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28867#L71 assume !(0 == mp_add_~i~0 % 256); 28866#L71-2 assume !(1 == mp_add_~i~0 % 256); 28865#L72-1 assume !(2 == mp_add_~i~0 % 256); 28864#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; 28828#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28862#L76-1 assume !(0 == mp_add_~i~0 % 256); 28861#L80-1 assume !(1 == mp_add_~i~0 % 256); 28860#L81-1 assume !(2 == mp_add_~i~0 % 256); 28858#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 28857#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28842#L61-2 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); 28692#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28835#L71 assume !(0 == mp_add_~i~0 % 256); 28832#L71-2 assume !(1 == mp_add_~i~0 % 256); 28829#L72-1 assume !(2 == mp_add_~i~0 % 256); 28826#L73-1 assume !(3 == mp_add_~i~0 % 256); 28822#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; 28819#L76-1 assume !(0 == mp_add_~i~0 % 256); 28817#L80-1 assume !(1 == mp_add_~i~0 % 256); 28815#L81-1 assume !(2 == mp_add_~i~0 % 256); 28812#L82-1 assume !(3 == mp_add_~i~0 % 256); 28810#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28808#L61-2 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; 28805#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28803#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 28802#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28801#L76-1 assume !(0 == mp_add_~i~0 % 256); 28799#L80-1 assume !(1 == mp_add_~i~0 % 256); 28800#L81-1 assume !(2 == mp_add_~i~0 % 256); 28787#L82-1 assume !(3 == mp_add_~i~0 % 256); 28786#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28785#L61-2 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; 28691#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 28847#L65-2 [2019-01-14 02:50:51,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:51,447 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 4 times [2019-01-14 02:50:51,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:51,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:51,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:51,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2083167059, now seen corresponding path program 2 times [2019-01-14 02:50:51,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:51,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:51,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:51,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 138 proven. 7 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-01-14 02:50:51,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:51,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:51,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:50:51,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:50:51,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:50:51,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 129 proven. 31 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 02:50:51,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:50:51,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 02:50:51,705 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:51,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:50:51,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:50:51,706 INFO L87 Difference]: Start difference. First operand 1660 states and 2094 transitions. cyclomatic complexity: 449 Second operand 4 states. [2019-01-14 02:50:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:51,776 INFO L93 Difference]: Finished difference Result 1765 states and 2039 transitions. [2019-01-14 02:50:51,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:50:51,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1765 states and 2039 transitions. [2019-01-14 02:50:51,784 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 1154 [2019-01-14 02:50:51,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1765 states to 1765 states and 2039 transitions. [2019-01-14 02:50:51,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1765 [2019-01-14 02:50:51,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1765 [2019-01-14 02:50:51,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1765 states and 2039 transitions. [2019-01-14 02:50:51,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:51,794 INFO L706 BuchiCegarLoop]: Abstraction has 1765 states and 2039 transitions. [2019-01-14 02:50:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states and 2039 transitions. [2019-01-14 02:50:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1222. [2019-01-14 02:50:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-01-14 02:50:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1440 transitions. [2019-01-14 02:50:51,816 INFO L729 BuchiCegarLoop]: Abstraction has 1222 states and 1440 transitions. [2019-01-14 02:50:51,816 INFO L609 BuchiCegarLoop]: Abstraction has 1222 states and 1440 transitions. [2019-01-14 02:50:51,816 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-14 02:50:51,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1222 states and 1440 transitions. [2019-01-14 02:50:51,822 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 822 [2019-01-14 02:50:51,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:51,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:51,822 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:51,822 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:51,823 INFO L794 eck$LassoCheckResult]: Stem: 31162#ULTIMATE.startENTRY 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;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; 31132#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 31133#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 31160#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 31166#L40-1 mp_add_~nb~0 := 4; 31221#L50 assume !(0 == mp_add_~b3~0 % 256); 31222#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 31679#L61-2 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; 31677#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31676#L65 [2019-01-14 02:50:51,823 INFO L796 eck$LassoCheckResult]: Loop: 31676#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 31675#L65-2 assume !(1 == mp_add_~i~0 % 256); 31674#L66-1 assume !(2 == mp_add_~i~0 % 256); 31673#L67-1 assume !(3 == mp_add_~i~0 % 256); 31672#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31671#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 31670#L71-2 assume !(1 == mp_add_~i~0 % 256); 31669#L72-1 assume !(2 == mp_add_~i~0 % 256); 31668#L73-1 assume !(3 == mp_add_~i~0 % 256); 31667#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31666#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 31665#L80-1 assume !(1 == mp_add_~i~0 % 256); 31664#L81-1 assume !(2 == mp_add_~i~0 % 256); 31663#L82-1 assume !(3 == mp_add_~i~0 % 256); 31662#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31661#L61-2 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; 31660#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 31659#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31658#L71 assume !(0 == mp_add_~i~0 % 256); 31657#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; 31612#L72-1 assume !(2 == mp_add_~i~0 % 256); 31656#L73-1 assume !(3 == mp_add_~i~0 % 256); 31655#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31654#L76-1 assume !(0 == mp_add_~i~0 % 256); 31653#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 31594#L81-1 assume !(2 == mp_add_~i~0 % 256); 31640#L82-1 assume !(3 == mp_add_~i~0 % 256); 31637#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31625#L61-2 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; 31624#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 31623#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31622#L71 assume !(0 == mp_add_~i~0 % 256); 31619#L71-2 assume !(1 == mp_add_~i~0 % 256); 31608#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; 31606#L73-1 assume !(3 == mp_add_~i~0 % 256); 31607#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; 31597#L76-1 assume !(0 == mp_add_~i~0 % 256); 31598#L80-1 assume !(1 == mp_add_~i~0 % 256); 31591#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 31590#L82-1 assume !(3 == mp_add_~i~0 % 256); 31589#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31588#L61-2 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; 31587#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 31585#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31586#L71 assume !(0 == mp_add_~i~0 % 256); 31596#L71-2 assume !(1 == mp_add_~i~0 % 256); 31592#L72-1 assume !(2 == mp_add_~i~0 % 256); 31583#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; 31584#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; 31636#L76-1 assume !(0 == mp_add_~i~0 % 256); 31635#L80-1 assume !(1 == mp_add_~i~0 % 256); 31634#L81-1 assume !(2 == mp_add_~i~0 % 256); 31632#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 31630#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31628#L61-2 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; 31620#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 31621#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31686#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31685#L76-1 assume !(0 == mp_add_~i~0 % 256); 31684#L80-1 assume !(1 == mp_add_~i~0 % 256); 31683#L81-1 assume !(2 == mp_add_~i~0 % 256); 31682#L82-1 assume !(3 == mp_add_~i~0 % 256); 31681#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31680#L61-2 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; 31678#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31676#L65 [2019-01-14 02:50:51,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:51,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 6 times [2019-01-14 02:50:51,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:51,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:51,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:51,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:51,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1377322413, now seen corresponding path program 1 times [2019-01-14 02:50:51,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:51,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:51,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:51,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 02:50:52,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:52,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:52,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:52,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 02:50:52,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:50:52,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-14 02:50:52,836 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:52,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 02:50:52,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-14 02:50:52,836 INFO L87 Difference]: Start difference. First operand 1222 states and 1440 transitions. cyclomatic complexity: 231 Second operand 14 states. [2019-01-14 02:50:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:55,339 INFO L93 Difference]: Finished difference Result 2065 states and 2336 transitions. [2019-01-14 02:50:55,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 02:50:55,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2065 states and 2336 transitions. [2019-01-14 02:50:55,346 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 1132 [2019-01-14 02:50:55,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2065 states to 1986 states and 2214 transitions. [2019-01-14 02:50:55,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1986 [2019-01-14 02:50:55,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1986 [2019-01-14 02:50:55,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1986 states and 2214 transitions. [2019-01-14 02:50:55,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:55,358 INFO L706 BuchiCegarLoop]: Abstraction has 1986 states and 2214 transitions. [2019-01-14 02:50:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states and 2214 transitions. [2019-01-14 02:50:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1221. [2019-01-14 02:50:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-01-14 02:50:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1364 transitions. [2019-01-14 02:50:55,380 INFO L729 BuchiCegarLoop]: Abstraction has 1221 states and 1364 transitions. [2019-01-14 02:50:55,380 INFO L609 BuchiCegarLoop]: Abstraction has 1221 states and 1364 transitions. [2019-01-14 02:50:55,380 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-14 02:50:55,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1221 states and 1364 transitions. [2019-01-14 02:50:55,387 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 582 [2019-01-14 02:50:55,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:55,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:55,388 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:55,388 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:55,388 INFO L794 eck$LassoCheckResult]: Stem: 34725#ULTIMATE.startENTRY 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;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; 34690#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 34691#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 34721#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 34728#L40-1 mp_add_~nb~0 := 4; 34713#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 34715#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 34695#L54 assume !(0 == mp_add_~b1~0 % 256); 34696#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 34709#L61-2 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; 35300#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35301#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34692#L65-2 assume !(1 == mp_add_~i~0 % 256); 34693#L66-1 assume !(2 == mp_add_~i~0 % 256); 35643#L67-1 assume !(3 == mp_add_~i~0 % 256); 35644#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35699#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; 35697#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 35698#L80-1 assume !(1 == mp_add_~i~0 % 256); 35693#L81-1 assume !(2 == mp_add_~i~0 % 256); 35694#L82-1 assume !(3 == mp_add_~i~0 % 256); 35689#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35690#L61-2 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; 35685#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35686#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35893#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35814#L76-1 [2019-01-14 02:50:55,389 INFO L796 eck$LassoCheckResult]: Loop: 35814#L76-1 assume !(0 == mp_add_~i~0 % 256); 35869#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 35710#L81-1 assume !(2 == mp_add_~i~0 % 256); 35866#L82-1 assume !(3 == mp_add_~i~0 % 256); 35864#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35862#L61-2 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; 35860#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35858#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35805#L71 assume !(0 == mp_add_~i~0 % 256); 35855#L71-2 assume !(1 == mp_add_~i~0 % 256); 35849#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; 35720#L73-1 assume !(3 == mp_add_~i~0 % 256); 35803#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; 35845#L76-1 assume !(0 == mp_add_~i~0 % 256); 35843#L80-1 assume !(1 == mp_add_~i~0 % 256); 35841#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 35839#L82-1 assume !(3 == mp_add_~i~0 % 256); 35838#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35794#L61-2 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; 35763#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35764#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35762#L71 assume !(0 == mp_add_~i~0 % 256); 35759#L71-2 assume !(1 == mp_add_~i~0 % 256); 35760#L72-1 assume !(2 == mp_add_~i~0 % 256); 35757#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; 35758#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; 35753#L76-1 assume !(0 == mp_add_~i~0 % 256); 35754#L80-1 assume !(1 == mp_add_~i~0 % 256); 35750#L81-1 assume !(2 == mp_add_~i~0 % 256); 35747#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 35748#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35472#L61-2 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; 35473#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35468#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35467#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35462#L76-1 assume !(0 == mp_add_~i~0 % 256); 35463#L80-1 assume !(1 == mp_add_~i~0 % 256); 35458#L81-1 assume !(2 == mp_add_~i~0 % 256); 35459#L82-1 assume !(3 == mp_add_~i~0 % 256); 35454#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35455#L61-2 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; 35726#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35727#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35722#L71 assume !(0 == mp_add_~i~0 % 256); 35723#L71-2 assume !(1 == mp_add_~i~0 % 256); 35715#L72-1 assume !(2 == mp_add_~i~0 % 256); 35716#L73-1 assume !(3 == mp_add_~i~0 % 256); 35783#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35784#L76-1 assume !(0 == mp_add_~i~0 % 256); 35779#L80-1 assume !(1 == mp_add_~i~0 % 256); 35780#L81-1 assume !(2 == mp_add_~i~0 % 256); 35707#L82-1 assume !(3 == mp_add_~i~0 % 256); 35166#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35167#L61-2 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; 35681#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35682#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35498#L71 assume !(0 == mp_add_~i~0 % 256); 35499#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; 35816#L72-1 assume !(2 == mp_add_~i~0 % 256); 35815#L73-1 assume !(3 == mp_add_~i~0 % 256); 35813#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35814#L76-1 [2019-01-14 02:50:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash 225456627, now seen corresponding path program 1 times [2019-01-14 02:50:55,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:55,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:55,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:55,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:55,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:50:55,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:55,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 02:50:55,531 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:55,531 INFO L82 PathProgramCache]: Analyzing trace with hash 642643045, now seen corresponding path program 1 times [2019-01-14 02:50:55,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:55,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:55,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:55,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:55,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-14 02:50:55,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:55,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:50:55,784 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:55,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:50:55,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:50:55,785 INFO L87 Difference]: Start difference. First operand 1221 states and 1364 transitions. cyclomatic complexity: 155 Second operand 8 states. [2019-01-14 02:50:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:56,650 INFO L93 Difference]: Finished difference Result 2045 states and 2238 transitions. [2019-01-14 02:50:56,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 02:50:56,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2045 states and 2238 transitions. [2019-01-14 02:50:56,658 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 912 [2019-01-14 02:50:56,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2045 states to 1861 states and 2045 transitions. [2019-01-14 02:50:56,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1861 [2019-01-14 02:50:56,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1861 [2019-01-14 02:50:56,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1861 states and 2045 transitions. [2019-01-14 02:50:56,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:56,672 INFO L706 BuchiCegarLoop]: Abstraction has 1861 states and 2045 transitions. [2019-01-14 02:50:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states and 2045 transitions. [2019-01-14 02:50:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1466. [2019-01-14 02:50:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2019-01-14 02:50:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1628 transitions. [2019-01-14 02:50:56,696 INFO L729 BuchiCegarLoop]: Abstraction has 1466 states and 1628 transitions. [2019-01-14 02:50:56,696 INFO L609 BuchiCegarLoop]: Abstraction has 1466 states and 1628 transitions. [2019-01-14 02:50:56,696 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-14 02:50:56,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1466 states and 1628 transitions. [2019-01-14 02:50:56,703 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 724 [2019-01-14 02:50:56,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:56,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:56,704 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:56,704 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:56,704 INFO L794 eck$LassoCheckResult]: Stem: 38013#ULTIMATE.startENTRY 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;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; 37981#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37983#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 38010#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 38016#L40-1 mp_add_~nb~0 := 4; 38029#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 38023#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 38025#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 38721#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 38720#L61-2 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; 38719#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 38718#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 38717#L65-2 assume !(1 == mp_add_~i~0 % 256); 38716#L66-1 assume !(2 == mp_add_~i~0 % 256); 38714#L67-1 assume !(3 == mp_add_~i~0 % 256); 38711#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 38709#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; 38708#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 38706#L80-1 assume !(1 == mp_add_~i~0 % 256); 38704#L81-1 assume !(2 == mp_add_~i~0 % 256); 38702#L82-1 assume !(3 == mp_add_~i~0 % 256); 38700#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38698#L61-2 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; 38693#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38694#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 38697#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38688#L76-1 [2019-01-14 02:50:56,709 INFO L796 eck$LassoCheckResult]: Loop: 38688#L76-1 assume !(0 == mp_add_~i~0 % 256); 38664#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 38663#L81-1 assume !(2 == mp_add_~i~0 % 256); 38661#L82-1 assume !(3 == mp_add_~i~0 % 256); 38662#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38657#L61-2 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; 38658#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38654#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38653#L71 assume !(0 == mp_add_~i~0 % 256); 38652#L71-2 assume !(1 == mp_add_~i~0 % 256); 38651#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; 38649#L73-1 assume !(3 == mp_add_~i~0 % 256); 38650#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; 38644#L76-1 assume !(0 == mp_add_~i~0 % 256); 38645#L80-1 assume !(1 == mp_add_~i~0 % 256); 38640#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 38641#L82-1 assume !(3 == mp_add_~i~0 % 256); 38627#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38628#L61-2 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; 38619#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38620#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 38629#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38584#L76-1 assume !(0 == mp_add_~i~0 % 256); 38625#L80-1 assume !(1 == mp_add_~i~0 % 256); 38626#L81-1 assume !(2 == mp_add_~i~0 % 256); 38611#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 38610#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38671#L61-2 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; 38670#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38669#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38560#L71 assume !(0 == mp_add_~i~0 % 256); 38668#L71-2 assume !(1 == mp_add_~i~0 % 256); 38667#L72-1 assume !(2 == mp_add_~i~0 % 256); 38557#L73-1 assume !(3 == mp_add_~i~0 % 256); 38558#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38553#L76-1 assume !(0 == mp_add_~i~0 % 256); 38554#L80-1 assume !(1 == mp_add_~i~0 % 256); 38549#L81-1 assume !(2 == mp_add_~i~0 % 256); 38550#L82-1 assume !(3 == mp_add_~i~0 % 256); 38545#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38546#L61-2 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; 38605#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38606#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38601#L71 assume !(0 == mp_add_~i~0 % 256); 38602#L71-2 assume !(1 == mp_add_~i~0 % 256); 38592#L72-1 assume !(2 == mp_add_~i~0 % 256); 38593#L73-1 assume !(3 == mp_add_~i~0 % 256); 38345#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38346#L76-1 assume !(0 == mp_add_~i~0 % 256); 38335#L80-1 assume !(1 == mp_add_~i~0 % 256); 38336#L81-1 assume !(2 == mp_add_~i~0 % 256); 38219#L82-1 assume !(3 == mp_add_~i~0 % 256); 38220#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38215#L61-2 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; 38216#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38539#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38540#L71 assume !(0 == mp_add_~i~0 % 256); 38596#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; 38597#L72-1 assume !(2 == mp_add_~i~0 % 256); 38689#L73-1 assume !(3 == mp_add_~i~0 % 256); 38687#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38688#L76-1 [2019-01-14 02:50:56,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1914400369, now seen corresponding path program 1 times [2019-01-14 02:50:56,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:56,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:56,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:56,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:50:56,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:56,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 02:50:56,950 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:56,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:56,951 INFO L82 PathProgramCache]: Analyzing trace with hash -255582207, now seen corresponding path program 1 times [2019-01-14 02:50:56,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:56,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:56,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:56,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:56,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 92 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 02:50:57,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:57,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:50:57,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:57,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:57,775 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_mp_add_~nb~0 Int)) (and (<= ULTIMATE.start_mp_add_~nb~0 (+ (* 256 (div ULTIMATE.start_mp_add_~nb~0 256)) 3)) (< (mod c_ULTIMATE.start_mp_add_~i~0 256) (mod ULTIMATE.start_mp_add_~nb~0 256)))) is different from true [2019-01-14 02:50:58,785 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 02:50:59,409 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 02:50:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 02:50:59,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:50:59,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2019-01-14 02:50:59,462 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:50:59,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:50:59,465 INFO L87 Difference]: Start difference. First operand 1466 states and 1628 transitions. cyclomatic complexity: 176 Second operand 9 states. [2019-01-14 02:51:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:00,435 INFO L93 Difference]: Finished difference Result 1308 states and 1410 transitions. [2019-01-14 02:51:00,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:51:00,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1308 states and 1410 transitions. [2019-01-14 02:51:00,441 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 498 [2019-01-14 02:51:00,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1308 states to 1174 states and 1268 transitions. [2019-01-14 02:51:00,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1174 [2019-01-14 02:51:00,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1174 [2019-01-14 02:51:00,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1174 states and 1268 transitions. [2019-01-14 02:51:00,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:00,451 INFO L706 BuchiCegarLoop]: Abstraction has 1174 states and 1268 transitions. [2019-01-14 02:51:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states and 1268 transitions. [2019-01-14 02:51:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1008. [2019-01-14 02:51:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2019-01-14 02:51:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1094 transitions. [2019-01-14 02:51:00,474 INFO L729 BuchiCegarLoop]: Abstraction has 1008 states and 1094 transitions. [2019-01-14 02:51:00,474 INFO L609 BuchiCegarLoop]: Abstraction has 1008 states and 1094 transitions. [2019-01-14 02:51:00,474 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-14 02:51:00,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1008 states and 1094 transitions. [2019-01-14 02:51:00,479 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 436 [2019-01-14 02:51:00,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:00,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:00,480 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:00,480 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:00,480 INFO L794 eck$LassoCheckResult]: Stem: 40998#ULTIMATE.startENTRY 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;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; 40963#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 40965#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 40996#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 41003#L40-1 mp_add_~nb~0 := 4; 40988#L50 assume !(0 == mp_add_~b3~0 % 256); 40989#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 41637#L61-2 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; 41633#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41634#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 41648#L65-2 assume !(1 == mp_add_~i~0 % 256); 41649#L66-1 assume !(2 == mp_add_~i~0 % 256); 41644#L67-1 assume !(3 == mp_add_~i~0 % 256); 41645#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41640#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 41641#L71-2 assume !(1 == mp_add_~i~0 % 256); 41710#L72-1 assume !(2 == mp_add_~i~0 % 256); 41711#L73-1 assume !(3 == mp_add_~i~0 % 256); 41706#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; 41707#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 41700#L80-1 assume !(1 == mp_add_~i~0 % 256); 41701#L81-1 assume !(2 == mp_add_~i~0 % 256); 41689#L82-1 assume !(3 == mp_add_~i~0 % 256); 41690#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41677#L61-2 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; 41678#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41665#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41666#L71 assume !(0 == mp_add_~i~0 % 256); 41651#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; 41652#L72-1 [2019-01-14 02:51:00,480 INFO L796 eck$LassoCheckResult]: Loop: 41652#L72-1 assume !(2 == mp_add_~i~0 % 256); 41869#L73-1 assume !(3 == mp_add_~i~0 % 256); 41868#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41867#L76-1 assume !(0 == mp_add_~i~0 % 256); 41866#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 41722#L81-1 assume !(2 == mp_add_~i~0 % 256); 41865#L82-1 assume !(3 == mp_add_~i~0 % 256); 41864#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41863#L61-2 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; 41862#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41861#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41860#L71 assume !(0 == mp_add_~i~0 % 256); 41859#L71-2 assume !(1 == mp_add_~i~0 % 256); 41858#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; 41771#L73-1 assume !(3 == mp_add_~i~0 % 256); 41857#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41856#L76-1 assume !(0 == mp_add_~i~0 % 256); 41855#L80-1 assume !(1 == mp_add_~i~0 % 256); 41854#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 41853#L82-1 assume !(3 == mp_add_~i~0 % 256); 41852#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41851#L61-2 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; 41850#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41849#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41848#L71 assume !(0 == mp_add_~i~0 % 256); 41847#L71-2 assume !(1 == mp_add_~i~0 % 256); 41846#L72-1 assume !(2 == mp_add_~i~0 % 256); 41844#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; 41841#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; 41839#L76-1 assume !(0 == mp_add_~i~0 % 256); 41837#L80-1 assume !(1 == mp_add_~i~0 % 256); 41835#L81-1 assume !(2 == mp_add_~i~0 % 256); 41833#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 41831#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41830#L61-2 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; 41828#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41825#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 41823#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41822#L76-1 assume !(0 == mp_add_~i~0 % 256); 41821#L80-1 assume !(1 == mp_add_~i~0 % 256); 41820#L81-1 assume !(2 == mp_add_~i~0 % 256); 41819#L82-1 assume !(3 == mp_add_~i~0 % 256); 41818#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41817#L61-2 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; 41816#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41815#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41814#L71 assume !(0 == mp_add_~i~0 % 256); 41812#L71-2 assume !(1 == mp_add_~i~0 % 256); 41813#L72-1 assume !(2 == mp_add_~i~0 % 256); 41738#L73-1 assume !(3 == mp_add_~i~0 % 256); 41739#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41728#L76-1 assume !(0 == mp_add_~i~0 % 256); 41729#L80-1 assume !(1 == mp_add_~i~0 % 256); 41717#L81-1 assume !(2 == mp_add_~i~0 % 256); 41691#L82-1 assume !(3 == mp_add_~i~0 % 256); 41692#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41679#L61-2 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; 41680#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41667#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41668#L71 assume !(0 == mp_add_~i~0 % 256); 41653#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; 41652#L72-1 [2019-01-14 02:51:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:00,488 INFO L82 PathProgramCache]: Analyzing trace with hash 67958091, now seen corresponding path program 1 times [2019-01-14 02:51:00,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:00,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:00,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:00,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:00,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:00,517 INFO L82 PathProgramCache]: Analyzing trace with hash 526023181, now seen corresponding path program 2 times [2019-01-14 02:51:00,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:00,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:00,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:00,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:00,716 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2019-01-14 02:51:01,049 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-01-14 02:51:01,622 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2019-01-14 02:51:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-14 02:51:01,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:51:01,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:51:01,628 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:01,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:51:01,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:51:01,631 INFO L87 Difference]: Start difference. First operand 1008 states and 1094 transitions. cyclomatic complexity: 96 Second operand 5 states. [2019-01-14 02:51:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:01,839 INFO L93 Difference]: Finished difference Result 1015 states and 1097 transitions. [2019-01-14 02:51:01,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:51:01,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1015 states and 1097 transitions. [2019-01-14 02:51:01,843 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 412 [2019-01-14 02:51:01,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1015 states to 1015 states and 1097 transitions. [2019-01-14 02:51:01,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1015 [2019-01-14 02:51:01,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1015 [2019-01-14 02:51:01,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1097 transitions. [2019-01-14 02:51:01,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:01,848 INFO L706 BuchiCegarLoop]: Abstraction has 1015 states and 1097 transitions. [2019-01-14 02:51:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1097 transitions. [2019-01-14 02:51:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 891. [2019-01-14 02:51:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-01-14 02:51:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 966 transitions. [2019-01-14 02:51:01,861 INFO L729 BuchiCegarLoop]: Abstraction has 891 states and 966 transitions. [2019-01-14 02:51:01,861 INFO L609 BuchiCegarLoop]: Abstraction has 891 states and 966 transitions. [2019-01-14 02:51:01,861 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2019-01-14 02:51:01,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 891 states and 966 transitions. [2019-01-14 02:51:01,865 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 291 [2019-01-14 02:51:01,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:01,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:01,866 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:01,866 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:01,867 INFO L794 eck$LassoCheckResult]: Stem: 43026#ULTIMATE.startENTRY 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;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; 42994#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 42996#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 43025#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 43030#L40-1 mp_add_~nb~0 := 4; 43127#L50 assume !(0 == mp_add_~b3~0 % 256); 43016#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 43017#L61-2 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; 43603#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 43604#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 43679#L65-2 assume !(1 == mp_add_~i~0 % 256); 43680#L66-1 assume !(2 == mp_add_~i~0 % 256); 43675#L67-1 assume !(3 == mp_add_~i~0 % 256); 43676#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43671#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 43672#L71-2 assume !(1 == mp_add_~i~0 % 256); 43706#L72-1 assume !(2 == mp_add_~i~0 % 256); 43707#L73-1 assume !(3 == mp_add_~i~0 % 256); 43702#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; 43703#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 43698#L80-1 assume !(1 == mp_add_~i~0 % 256); 43699#L81-1 assume !(2 == mp_add_~i~0 % 256); 43694#L82-1 assume !(3 == mp_add_~i~0 % 256); 43695#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43690#L61-2 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; 43691#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43686#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43687#L71 assume !(0 == mp_add_~i~0 % 256); 43682#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; 43683#L72-1 assume !(2 == mp_add_~i~0 % 256); 43814#L73-1 assume !(3 == mp_add_~i~0 % 256); 43813#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; 43812#L76-1 assume !(0 == mp_add_~i~0 % 256); 43811#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 43810#L81-1 assume !(2 == mp_add_~i~0 % 256); 43809#L82-1 assume !(3 == mp_add_~i~0 % 256); 43808#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43807#L61-2 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; 43806#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43805#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43804#L71 assume !(0 == mp_add_~i~0 % 256); 43803#L71-2 assume !(1 == mp_add_~i~0 % 256); 43802#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; 43427#L73-1 [2019-01-14 02:51:01,870 INFO L796 eck$LassoCheckResult]: Loop: 43427#L73-1 assume !(3 == mp_add_~i~0 % 256); 43797#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43795#L76-1 assume !(0 == mp_add_~i~0 % 256); 43793#L80-1 assume !(1 == mp_add_~i~0 % 256); 43790#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 43341#L82-1 assume !(3 == mp_add_~i~0 % 256); 43786#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43787#L61-2 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; 43783#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43782#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43781#L71 assume !(0 == mp_add_~i~0 % 256); 43780#L71-2 assume !(1 == mp_add_~i~0 % 256); 43779#L72-1 assume !(2 == mp_add_~i~0 % 256); 43778#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; 43776#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; 43777#L76-1 assume !(0 == mp_add_~i~0 % 256); 43873#L80-1 assume !(1 == mp_add_~i~0 % 256); 43772#L81-1 assume !(2 == mp_add_~i~0 % 256); 43771#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 43020#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43012#L61-2 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; 43013#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43027#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 42998#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43015#L76-1 assume !(0 == mp_add_~i~0 % 256); 43828#L80-1 assume !(1 == mp_add_~i~0 % 256); 43826#L81-1 assume !(2 == mp_add_~i~0 % 256); 43825#L82-1 assume !(3 == mp_add_~i~0 % 256); 43824#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43823#L61-2 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; 43822#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43821#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43819#L71 assume !(0 == mp_add_~i~0 % 256); 43817#L71-2 assume !(1 == mp_add_~i~0 % 256); 43815#L72-1 assume !(2 == mp_add_~i~0 % 256); 43799#L73-1 assume !(3 == mp_add_~i~0 % 256); 43798#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43796#L76-1 assume !(0 == mp_add_~i~0 % 256); 43794#L80-1 assume !(1 == mp_add_~i~0 % 256); 43792#L81-1 assume !(2 == mp_add_~i~0 % 256); 43788#L82-1 assume !(3 == mp_add_~i~0 % 256); 43789#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43784#L61-2 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; 43785#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43820#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43818#L71 assume !(0 == mp_add_~i~0 % 256); 43816#L71-2 assume !(1 == mp_add_~i~0 % 256); 43800#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; 43427#L73-1 [2019-01-14 02:51:01,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 479796297, now seen corresponding path program 1 times [2019-01-14 02:51:01,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:01,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:01,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:51:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:01,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1511836427, now seen corresponding path program 1 times [2019-01-14 02:51:01,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:01,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:01,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:01,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:01,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-14 02:51:02,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:51:02,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:51:02,082 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:02,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:51:02,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:51:02,082 INFO L87 Difference]: Start difference. First operand 891 states and 966 transitions. cyclomatic complexity: 83 Second operand 6 states. [2019-01-14 02:51:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:02,355 INFO L93 Difference]: Finished difference Result 961 states and 1032 transitions. [2019-01-14 02:51:02,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:51:02,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 961 states and 1032 transitions. [2019-01-14 02:51:02,360 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 183 [2019-01-14 02:51:02,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 961 states to 786 states and 848 transitions. [2019-01-14 02:51:02,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 786 [2019-01-14 02:51:02,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 786 [2019-01-14 02:51:02,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 848 transitions. [2019-01-14 02:51:02,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:02,364 INFO L706 BuchiCegarLoop]: Abstraction has 786 states and 848 transitions. [2019-01-14 02:51:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 848 transitions. [2019-01-14 02:51:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 654. [2019-01-14 02:51:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-01-14 02:51:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 709 transitions. [2019-01-14 02:51:02,378 INFO L729 BuchiCegarLoop]: Abstraction has 654 states and 709 transitions. [2019-01-14 02:51:02,378 INFO L609 BuchiCegarLoop]: Abstraction has 654 states and 709 transitions. [2019-01-14 02:51:02,378 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2019-01-14 02:51:02,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 654 states and 709 transitions. [2019-01-14 02:51:02,383 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 175 [2019-01-14 02:51:02,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:02,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:02,384 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:02,385 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2019-01-14 02:51:02,388 INFO L794 eck$LassoCheckResult]: Stem: 44892#ULTIMATE.startENTRY 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;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; 44858#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 44860#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 44890#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 44896#L40-1 mp_add_~nb~0 := 4; 44883#L50 assume !(0 == mp_add_~b3~0 % 256); 44884#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 45407#L61-2 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; 45406#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 45355#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 44863#L65-2 assume !(1 == mp_add_~i~0 % 256); 44864#L66-1 assume !(2 == mp_add_~i~0 % 256); 44873#L67-1 assume !(3 == mp_add_~i~0 % 256); 44874#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45490#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 45491#L71-2 assume !(1 == mp_add_~i~0 % 256); 44882#L72-1 assume !(2 == mp_add_~i~0 % 256); 44861#L73-1 assume !(3 == mp_add_~i~0 % 256); 44862#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; 44879#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 45485#L80-1 assume !(1 == mp_add_~i~0 % 256); 45483#L81-1 assume !(2 == mp_add_~i~0 % 256); 45481#L82-1 assume !(3 == mp_add_~i~0 % 256); 45479#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45477#L61-2 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; 45475#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45473#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45471#L71 assume !(0 == mp_add_~i~0 % 256); 45469#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; 45468#L72-1 assume !(2 == mp_add_~i~0 % 256); 45467#L73-1 assume !(3 == mp_add_~i~0 % 256); 45466#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; 45464#L76-1 assume !(0 == mp_add_~i~0 % 256); 45462#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 45460#L81-1 assume !(2 == mp_add_~i~0 % 256); 45459#L82-1 assume !(3 == mp_add_~i~0 % 256); 45458#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45453#L61-2 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; 45451#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45448#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45445#L71 assume !(0 == mp_add_~i~0 % 256); 45442#L71-2 assume !(1 == mp_add_~i~0 % 256); 45438#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; 45233#L73-1 [2019-01-14 02:51:02,389 INFO L796 eck$LassoCheckResult]: Loop: 45233#L73-1 assume !(3 == mp_add_~i~0 % 256); 45435#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 45433#L76-1 assume !(0 == mp_add_~i~0 % 256); 45431#L80-1 assume !(1 == mp_add_~i~0 % 256); 45428#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 45227#L82-1 assume !(3 == mp_add_~i~0 % 256); 45455#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45454#L61-2 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; 45423#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45421#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45420#L71 assume !(0 == mp_add_~i~0 % 256); 45419#L71-2 assume !(1 == mp_add_~i~0 % 256); 45418#L72-1 assume !(2 == mp_add_~i~0 % 256); 45416#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; 45417#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 45496#L76-1 assume !(0 == mp_add_~i~0 % 256); 45495#L80-1 assume !(1 == mp_add_~i~0 % 256); 45494#L81-1 assume !(2 == mp_add_~i~0 % 256); 45493#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 45492#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 44876#L61-2 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; 44877#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45487#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45486#L71 assume !(0 == mp_add_~i~0 % 256); 45484#L71-2 assume !(1 == mp_add_~i~0 % 256); 45482#L72-1 assume !(2 == mp_add_~i~0 % 256); 45480#L73-1 assume !(3 == mp_add_~i~0 % 256); 45478#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 45476#L76-1 assume !(0 == mp_add_~i~0 % 256); 45474#L80-1 assume !(1 == mp_add_~i~0 % 256); 45472#L81-1 assume !(2 == mp_add_~i~0 % 256); 45470#L82-1 assume !(3 == mp_add_~i~0 % 256); 45457#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45456#L61-2 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; 45452#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45450#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45447#L71 assume !(0 == mp_add_~i~0 % 256); 45444#L71-2 assume !(1 == mp_add_~i~0 % 256); 45441#L72-1 assume !(2 == mp_add_~i~0 % 256); 45437#L73-1 assume !(3 == mp_add_~i~0 % 256); 45436#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 45434#L76-1 assume !(0 == mp_add_~i~0 % 256); 45432#L80-1 assume !(1 == mp_add_~i~0 % 256); 45430#L81-1 assume !(2 == mp_add_~i~0 % 256); 45427#L82-1 assume !(3 == mp_add_~i~0 % 256); 45426#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45424#L61-2 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; 45425#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45449#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45446#L71 assume !(0 == mp_add_~i~0 % 256); 45443#L71-2 assume !(1 == mp_add_~i~0 % 256); 45439#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; 45233#L73-1 [2019-01-14 02:51:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:02,389 INFO L82 PathProgramCache]: Analyzing trace with hash 479796297, now seen corresponding path program 2 times [2019-01-14 02:51:02,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:02,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:02,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1158440831, now seen corresponding path program 1 times [2019-01-14 02:51:02,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:02,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:02,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:02,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:51:02,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 02:51:02,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:51:02,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:51:02,618 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:02,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:51:02,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:51:02,619 INFO L87 Difference]: Start difference. First operand 654 states and 709 transitions. cyclomatic complexity: 61 Second operand 6 states. [2019-01-14 02:51:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:02,831 INFO L93 Difference]: Finished difference Result 659 states and 706 transitions. [2019-01-14 02:51:02,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:51:02,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 706 transitions. [2019-01-14 02:51:02,836 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 147 [2019-01-14 02:51:02,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 659 states and 706 transitions. [2019-01-14 02:51:02,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2019-01-14 02:51:02,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 659 [2019-01-14 02:51:02,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 659 states and 706 transitions. [2019-01-14 02:51:02,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:02,839 INFO L706 BuchiCegarLoop]: Abstraction has 659 states and 706 transitions. [2019-01-14 02:51:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states and 706 transitions. [2019-01-14 02:51:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 581. [2019-01-14 02:51:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-01-14 02:51:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 621 transitions. [2019-01-14 02:51:02,845 INFO L729 BuchiCegarLoop]: Abstraction has 581 states and 621 transitions. [2019-01-14 02:51:02,845 INFO L609 BuchiCegarLoop]: Abstraction has 581 states and 621 transitions. [2019-01-14 02:51:02,845 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2019-01-14 02:51:02,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 581 states and 621 transitions. [2019-01-14 02:51:02,846 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 92 [2019-01-14 02:51:02,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:02,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:02,847 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:02,847 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:51:02,848 INFO L794 eck$LassoCheckResult]: Stem: 46214#ULTIMATE.startENTRY 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;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; 46182#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 46183#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 46211#L44 assume !(0 == mp_add_~a1~0 % 256); 46218#L40-1 mp_add_~nb~0 := 4; 46225#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46206#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46208#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46303#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 46301#L61-2 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; 46299#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46297#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 46295#L65-2 assume !(1 == mp_add_~i~0 % 256); 46293#L66-1 assume !(2 == mp_add_~i~0 % 256); 46291#L67-1 assume !(3 == mp_add_~i~0 % 256); 46289#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 46287#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 46285#L71-2 assume !(1 == mp_add_~i~0 % 256); 46283#L72-1 assume !(2 == mp_add_~i~0 % 256); 46281#L73-1 assume !(3 == mp_add_~i~0 % 256); 46279#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; 46277#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 46275#L80-1 assume !(1 == mp_add_~i~0 % 256); 46273#L81-1 assume !(2 == mp_add_~i~0 % 256); 46271#L82-1 assume !(3 == mp_add_~i~0 % 256); 46269#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46267#L61-2 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; 46265#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46263#L65 assume !(0 == mp_add_~i~0 % 256); 46261#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; 46259#L66-1 assume !(2 == mp_add_~i~0 % 256); 46257#L67-1 assume !(3 == mp_add_~i~0 % 256); 46255#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 46252#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 46251#L76-1 assume !(0 == mp_add_~i~0 % 256); 46249#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 46247#L81-1 assume !(2 == mp_add_~i~0 % 256); 46245#L82-1 assume !(3 == mp_add_~i~0 % 256); 46243#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46241#L61-2 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); 46240#L88-1 assume !!(mp_add_~i~0 % 256 < 4); 46239#L89 assume !(0 == mp_add_~i~0 % 256); 46237#L89-2 assume !(1 == mp_add_~i~0 % 256); 46234#L90-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := 0; 46171#L91-1 assume !(3 == mp_add_~i~0 % 256); 46172#L92-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46200#L88-1 assume !!(mp_add_~i~0 % 256 < 4); 46196#L89 assume !(0 == mp_add_~i~0 % 256); 46192#L89-2 assume !(1 == mp_add_~i~0 % 256); 46193#L90-1 assume !(2 == mp_add_~i~0 % 256); 46221#L91-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := 0; 46226#L92-1 [2019-01-14 02:51:02,848 INFO L796 eck$LassoCheckResult]: Loop: 46226#L92-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46232#L88-1 assume !!(mp_add_~i~0 % 256 < 4); 46231#L89 assume !(0 == mp_add_~i~0 % 256); 46230#L89-2 assume !(1 == mp_add_~i~0 % 256); 46229#L90-1 assume !(2 == mp_add_~i~0 % 256); 46227#L91-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := 0; 46226#L92-1 [2019-01-14 02:51:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1702277999, now seen corresponding path program 1 times [2019-01-14 02:51:02,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:02,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:02,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:02,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:02,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:02,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:02,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1745943634, now seen corresponding path program 1 times [2019-01-14 02:51:02,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:02,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:02,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:02,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:02,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:02,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1391631586, now seen corresponding path program 2 times [2019-01-14 02:51:02,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:02,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:02,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:02,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:02,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 02:51:03,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:51:03,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 02:51:03,135 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:51:03,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:51:03,135 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:51:03,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:51:03,136 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:51:03,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:03,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:51:03,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:51:03,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration22_Loop [2019-01-14 02:51:03,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:51:03,136 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:51:03,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:03,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:03,287 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-14 02:51:03,316 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:03,316 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:03,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:51:03,323 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:03,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:51:03,358 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:51:03,499 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:51:03,501 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:51:03,501 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:51:03,501 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:51:03,501 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:51:03,501 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:51:03,501 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:03,502 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:51:03,502 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:51:03,502 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration22_Loop [2019-01-14 02:51:03,502 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:51:03,502 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:51:03,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:03,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:03,599 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:03,599 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:51:03,599 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 [2019-01-14 02:51:03,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:03,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:03,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:03,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,612 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 [2019-01-14 02:51:03,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:03,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:03,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:03,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,613 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:51:03,614 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 [2019-01-14 02:51:03,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:03,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,623 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:03,623 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:03,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,628 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 [2019-01-14 02:51:03,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:03,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,630 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:03,631 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:03,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,631 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:51:03,632 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 [2019-01-14 02:51:03,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:03,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,632 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:03,642 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:03,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,653 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 [2019-01-14 02:51:03,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:03,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,654 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:03,654 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:03,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,658 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:51:03,658 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 [2019-01-14 02:51:03,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:03,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,659 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:03,660 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:03,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,666 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 [2019-01-14 02:51:03,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:03,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,666 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:03,667 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:03,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,667 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:51:03,668 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 [2019-01-14 02:51:03,668 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:03,668 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:03,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,669 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:03,669 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:03,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,673 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 [2019-01-14 02:51:03,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:03,673 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:03,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,674 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:03,674 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:03,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,675 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:51:03,675 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 [2019-01-14 02:51:03,675 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:03,675 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:51:03,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,676 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:03,677 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:03,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,684 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 [2019-01-14 02:51:03,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:03,685 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:51:03,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:03,686 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:03,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,687 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:51:03,687 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 [2019-01-14 02:51:03,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:03,688 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:03,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,689 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:03,690 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:03,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:03,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:03,701 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:03,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,701 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:03,702 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:03,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,703 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:51:03,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:03,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:03,704 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:03,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,704 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:03,705 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:03,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,710 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 [2019-01-14 02:51:03,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:03,710 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:03,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:03,711 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:03,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,712 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:51:03,713 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 [2019-01-14 02:51:03,713 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:03,713 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:03,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,714 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:51:03,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:51:03,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,734 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 [2019-01-14 02:51:03,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:03,736 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:03,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:03,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:03,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:03,737 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:51:03,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:51:03,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:03,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:03,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:51:03,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:51:03,744 INFO L87 Difference]: Start difference. First operand 581 states and 621 transitions. cyclomatic complexity: 45 Second operand 7 states. [2019-01-14 02:51:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:04,267 INFO L93 Difference]: Finished difference Result 615 states and 652 transitions. [2019-01-14 02:51:04,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:51:04,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 615 states and 652 transitions. [2019-01-14 02:51:04,270 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 92 [2019-01-14 02:51:04,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 615 states to 337 states and 356 transitions. [2019-01-14 02:51:04,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 337 [2019-01-14 02:51:04,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 337 [2019-01-14 02:51:04,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 356 transitions. [2019-01-14 02:51:04,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:04,272 INFO L706 BuchiCegarLoop]: Abstraction has 337 states and 356 transitions. [2019-01-14 02:51:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 356 transitions. [2019-01-14 02:51:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 305. [2019-01-14 02:51:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-14 02:51:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 324 transitions. [2019-01-14 02:51:04,276 INFO L729 BuchiCegarLoop]: Abstraction has 305 states and 324 transitions. [2019-01-14 02:51:04,276 INFO L609 BuchiCegarLoop]: Abstraction has 305 states and 324 transitions. [2019-01-14 02:51:04,276 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2019-01-14 02:51:04,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 324 transitions. [2019-01-14 02:51:04,277 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 78 [2019-01-14 02:51:04,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:04,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:04,278 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:04,278 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-14 02:51:04,278 INFO L794 eck$LassoCheckResult]: Stem: 47402#ULTIMATE.startENTRY 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;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; 47394#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 47396#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 47400#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 47407#L40-1 mp_add_~nb~0 := 4; 47526#L50 assume !(0 == mp_add_~b3~0 % 256); 47387#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 47388#L61-2 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; 47523#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 47410#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 47398#L65-2 assume !(1 == mp_add_~i~0 % 256); 47399#L66-1 assume !(2 == mp_add_~i~0 % 256); 47408#L67-1 assume !(3 == mp_add_~i~0 % 256); 47409#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47625#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 47624#L71-2 assume !(1 == mp_add_~i~0 % 256); 47623#L72-1 assume !(2 == mp_add_~i~0 % 256); 47622#L73-1 assume !(3 == mp_add_~i~0 % 256); 47621#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; 47620#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 47619#L80-1 assume !(1 == mp_add_~i~0 % 256); 47618#L81-1 assume !(2 == mp_add_~i~0 % 256); 47617#L82-1 assume !(3 == mp_add_~i~0 % 256); 47616#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47615#L61-2 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; 47613#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47614#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47609#L71 assume !(0 == mp_add_~i~0 % 256); 47610#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; 47605#L72-1 assume !(2 == mp_add_~i~0 % 256); 47606#L73-1 assume !(3 == mp_add_~i~0 % 256); 47601#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; 47602#L76-1 assume !(0 == mp_add_~i~0 % 256); 47597#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 47598#L81-1 assume !(2 == mp_add_~i~0 % 256); 47669#L82-1 assume !(3 == mp_add_~i~0 % 256); 47668#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47591#L61-2 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; 47592#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47664#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47662#L71 assume !(0 == mp_add_~i~0 % 256); 47661#L71-2 assume !(1 == mp_add_~i~0 % 256); 47660#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; 47659#L73-1 assume !(3 == mp_add_~i~0 % 256); 47658#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; 47657#L76-1 assume !(0 == mp_add_~i~0 % 256); 47656#L80-1 assume !(1 == mp_add_~i~0 % 256); 47655#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 47654#L82-1 assume !(3 == mp_add_~i~0 % 256); 47653#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47565#L61-2 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; 47566#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47652#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47651#L71 assume !(0 == mp_add_~i~0 % 256); 47650#L71-2 assume !(1 == mp_add_~i~0 % 256); 47649#L72-1 assume !(2 == mp_add_~i~0 % 256); 47647#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; 47646#L70 [2019-01-14 02:51:04,279 INFO L796 eck$LassoCheckResult]: Loop: 47646#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 47645#L76-1 assume !(0 == mp_add_~i~0 % 256); 47644#L80-1 assume !(1 == mp_add_~i~0 % 256); 47643#L81-1 assume !(2 == mp_add_~i~0 % 256); 47642#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 47641#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47640#L61-2 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; 47639#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47638#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47637#L71 assume !(0 == mp_add_~i~0 % 256); 47636#L71-2 assume !(1 == mp_add_~i~0 % 256); 47635#L72-1 assume !(2 == mp_add_~i~0 % 256); 47634#L73-1 assume !(3 == mp_add_~i~0 % 256); 47633#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 47632#L76-1 assume !(0 == mp_add_~i~0 % 256); 47631#L80-1 assume !(1 == mp_add_~i~0 % 256); 47630#L81-1 assume !(2 == mp_add_~i~0 % 256); 47628#L82-1 assume !(3 == mp_add_~i~0 % 256); 47629#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47672#L61-2 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; 47671#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47670#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47582#L71 assume !(0 == mp_add_~i~0 % 256); 47583#L71-2 assume !(1 == mp_add_~i~0 % 256); 47578#L72-1 assume !(2 == mp_add_~i~0 % 256); 47579#L73-1 assume !(3 == mp_add_~i~0 % 256); 47648#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 47667#L76-1 assume !(0 == mp_add_~i~0 % 256); 47666#L80-1 assume !(1 == mp_add_~i~0 % 256); 47665#L81-1 assume !(2 == mp_add_~i~0 % 256); 47663#L82-1 assume !(3 == mp_add_~i~0 % 256); 47548#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47549#L61-2 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; 47544#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47545#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47540#L71 assume !(0 == mp_add_~i~0 % 256); 47541#L71-2 assume !(1 == mp_add_~i~0 % 256); 47536#L72-1 assume !(2 == mp_add_~i~0 % 256); 47537#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; 47646#L70 [2019-01-14 02:51:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash -62570223, now seen corresponding path program 1 times [2019-01-14 02:51:04,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:04,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:04,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:04,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:51:04,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash 910661453, now seen corresponding path program 1 times [2019-01-14 02:51:04,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:04,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:04,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-14 02:51:04,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:51:04,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:51:04,567 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:04,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:51:04,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:51:04,568 INFO L87 Difference]: Start difference. First operand 305 states and 324 transitions. cyclomatic complexity: 22 Second operand 7 states. [2019-01-14 02:51:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:04,755 INFO L93 Difference]: Finished difference Result 309 states and 326 transitions. [2019-01-14 02:51:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:51:04,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 309 states and 326 transitions. [2019-01-14 02:51:04,759 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2019-01-14 02:51:04,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 309 states to 309 states and 326 transitions. [2019-01-14 02:51:04,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 309 [2019-01-14 02:51:04,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2019-01-14 02:51:04,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 326 transitions. [2019-01-14 02:51:04,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:04,761 INFO L706 BuchiCegarLoop]: Abstraction has 309 states and 326 transitions. [2019-01-14 02:51:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 326 transitions. [2019-01-14 02:51:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 204. [2019-01-14 02:51:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-14 02:51:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2019-01-14 02:51:04,768 INFO L729 BuchiCegarLoop]: Abstraction has 204 states and 217 transitions. [2019-01-14 02:51:04,768 INFO L609 BuchiCegarLoop]: Abstraction has 204 states and 217 transitions. [2019-01-14 02:51:04,768 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2019-01-14 02:51:04,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 217 transitions. [2019-01-14 02:51:04,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-14 02:51:04,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:04,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:04,770 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [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] [2019-01-14 02:51:04,770 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:04,770 INFO L794 eck$LassoCheckResult]: Stem: 48027#ULTIMATE.startENTRY 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;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; 48019#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 48021#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 48025#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 48032#L40-1 mp_add_~nb~0 := 4; 48079#L50 assume !(0 == mp_add_~b3~0 % 256); 48010#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 48011#L61-2 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; 48151#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 48150#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 48022#L65-2 assume !(1 == mp_add_~i~0 % 256); 48023#L66-1 assume !(2 == mp_add_~i~0 % 256); 48033#L67-1 assume !(3 == mp_add_~i~0 % 256); 48034#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48204#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 48203#L71-2 assume !(1 == mp_add_~i~0 % 256); 48202#L72-1 assume !(2 == mp_add_~i~0 % 256); 48201#L73-1 assume !(3 == mp_add_~i~0 % 256); 48200#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; 48199#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 48198#L80-1 assume !(1 == mp_add_~i~0 % 256); 48197#L81-1 assume !(2 == mp_add_~i~0 % 256); 48196#L82-1 assume !(3 == mp_add_~i~0 % 256); 48195#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 48194#L61-2 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; 48193#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48192#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48191#L71 assume !(0 == mp_add_~i~0 % 256); 48190#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; 48189#L72-1 assume !(2 == mp_add_~i~0 % 256); 48188#L73-1 assume !(3 == mp_add_~i~0 % 256); 48187#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; 48186#L76-1 assume !(0 == mp_add_~i~0 % 256); 48185#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 48184#L81-1 assume !(2 == mp_add_~i~0 % 256); 48183#L82-1 assume !(3 == mp_add_~i~0 % 256); 48182#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 48181#L61-2 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; 48180#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48179#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48178#L71 assume !(0 == mp_add_~i~0 % 256); 48177#L71-2 assume !(1 == mp_add_~i~0 % 256); 48176#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; 48175#L73-1 assume !(3 == mp_add_~i~0 % 256); 48174#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; 48173#L76-1 assume !(0 == mp_add_~i~0 % 256); 48172#L80-1 assume !(1 == mp_add_~i~0 % 256); 48171#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 48170#L82-1 assume !(3 == mp_add_~i~0 % 256); 48169#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 48168#L61-2 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; 48166#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48164#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48163#L71 assume !(0 == mp_add_~i~0 % 256); 48162#L71-2 assume !(1 == mp_add_~i~0 % 256); 48161#L72-1 assume !(2 == mp_add_~i~0 % 256); 48160#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; 48159#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; 48158#L76-1 assume !(0 == mp_add_~i~0 % 256); 48157#L80-1 assume !(1 == mp_add_~i~0 % 256); 48156#L81-1 assume !(2 == mp_add_~i~0 % 256); 48155#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 48012#L83-1 [2019-01-14 02:51:04,771 INFO L796 eck$LassoCheckResult]: Loop: 48012#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 48006#L61-2 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; 48007#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48024#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48015#L71 assume !(0 == mp_add_~i~0 % 256); 48003#L71-2 assume !(1 == mp_add_~i~0 % 256); 48004#L72-1 assume !(2 == mp_add_~i~0 % 256); 48016#L73-1 assume !(3 == mp_add_~i~0 % 256); 48008#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 48009#L76-1 assume !(0 == mp_add_~i~0 % 256); 48001#L80-1 assume !(1 == mp_add_~i~0 % 256); 48002#L81-1 assume !(2 == mp_add_~i~0 % 256); 48005#L82-1 assume !(3 == mp_add_~i~0 % 256); 48012#L83-1 [2019-01-14 02:51:04,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:04,771 INFO L82 PathProgramCache]: Analyzing trace with hash -181276600, now seen corresponding path program 1 times [2019-01-14 02:51:04,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:04,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:04,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:04,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:04,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:04,820 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 1 times [2019-01-14 02:51:04,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:04,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:04,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:04,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:04,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1480807712, now seen corresponding path program 1 times [2019-01-14 02:51:04,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:04,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:04,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:05,396 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-01-14 02:51:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 57 proven. 32 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-01-14 02:51:05,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:51:05,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:51:05,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:05,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-14 02:51:05,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:51:05,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2019-01-14 02:51:05,738 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:51:05,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:51:05,738 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:51:05,738 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:51:05,739 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:51:05,739 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:05,739 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:51:05,739 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:51:05,739 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2019-01-14 02:51:05,739 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:51:05,740 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:51:05,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:05,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:05,958 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-14 02:51:06,018 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:06,018 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:06,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:51:06,024 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:51:06,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:51:06,033 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:06,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:51:06,056 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:06,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:51:06,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:51:06,893 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:51:06,896 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:51:06,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:51:06,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:51:06,896 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:51:06,897 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:51:06,897 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:06,897 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:51:06,897 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:51:06,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2019-01-14 02:51:06,897 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:51:06,897 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:51:06,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:06,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:07,187 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-14 02:51:07,246 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:07,247 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:51:07,247 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 [2019-01-14 02:51:07,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:07,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:07,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:07,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,252 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 [2019-01-14 02:51:07,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:07,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:07,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:07,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,267 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:51:07,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:07,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:07,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,269 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:07,270 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:07,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:07,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:07,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,272 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:07,272 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:07,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,285 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:51:07,286 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 [2019-01-14 02:51:07,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:07,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,287 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:07,287 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:07,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,292 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 [2019-01-14 02:51:07,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:07,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,293 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:07,293 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:07,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,305 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:51:07,305 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 [2019-01-14 02:51:07,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:07,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,310 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:07,311 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:07,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,312 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 [2019-01-14 02:51:07,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:07,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,313 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:07,313 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:07,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,325 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:51:07,325 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 [2019-01-14 02:51:07,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:07,326 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:07,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,326 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:07,328 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:07,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,329 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 [2019-01-14 02:51:07,329 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:07,330 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:07,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,330 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:07,334 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:07,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,348 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:51:07,348 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 [2019-01-14 02:51:07,349 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:07,349 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:51:07,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,349 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:07,353 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:07,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:07,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:07,359 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:51:07,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,363 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:07,370 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:07,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,393 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:51:07,393 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 [2019-01-14 02:51:07,394 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:07,394 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:07,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,394 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:07,399 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:07,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,401 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 [2019-01-14 02:51:07,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:07,401 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:07,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,405 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:07,411 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:07,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,440 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:51:07,440 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 [2019-01-14 02:51:07,444 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:07,444 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:07,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,445 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:07,449 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:07,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,454 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 [2019-01-14 02:51:07,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:07,457 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:07,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,458 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:07,460 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:07,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,481 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:51:07,481 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 [2019-01-14 02:51:07,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:07,482 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:07,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,485 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:51:07,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:51:07,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,502 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 [2019-01-14 02:51:07,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:07,502 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:07,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:07,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:07,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:07,503 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:51:07,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:51:07,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:07,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 02:51:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-01-14 02:51:07,516 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. cyclomatic complexity: 14 Second operand 14 states. [2019-01-14 02:51:08,986 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 14 [2019-01-14 02:51:09,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:09,191 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2019-01-14 02:51:09,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:51:09,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 217 transitions. [2019-01-14 02:51:09,194 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:51:09,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 0 states and 0 transitions. [2019-01-14 02:51:09,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:51:09,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:51:09,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:51:09,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:09,195 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:51:09,195 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:51:09,195 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:51:09,195 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2019-01-14 02:51:09,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:51:09,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:51:09,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:51:09,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:51:09 BoogieIcfgContainer [2019-01-14 02:51:09,207 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:51:09,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:51:09,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:51:09,207 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:51:09,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:03" (3/4) ... [2019-01-14 02:51:09,211 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:51:09,211 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:51:09,212 INFO L168 Benchmark]: Toolchain (without parser) took 66771.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 413.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 249.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:09,213 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:51:09,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.30 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:09,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.90 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:09,217 INFO L168 Benchmark]: Boogie Preprocessor took 114.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:09,218 INFO L168 Benchmark]: RCFGBuilder took 644.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:09,219 INFO L168 Benchmark]: BuchiAutomizer took 65464.91 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 292.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.6 MB). Peak memory consumption was 265.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:09,223 INFO L168 Benchmark]: Witness Printer took 4.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:51:09,231 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 474.30 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.90 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 644.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 65464.91 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 292.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.6 MB). Peak memory consumption was 265.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 24 terminating modules (24 trivial, 0 deterministic, 0 nondeterministic). 24 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 65.4s and 25 iterations. TraceHistogramMax:6. Analysis of lassos took 36.3s. Construction of modules took 20.7s. Büchi inclusion checks took 7.1s. Highest rank in rank-based complementation 0. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 7042 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 1660 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1330 SDtfs, 5071 SDslu, 3207 SDs, 0 SdLazy, 9474 SolverSat, 854 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 20.7s Time LassoAnalysisResults: nont0 unkn0 SFLI13 SFLT0 conc5 concLT0 SILN0 SILU0 SILI6 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital47 mio100 ax100 hnf98 lsp65 ukn100 mio100 lsp100 div631 bol100 ite100 ukn100 eq143 hnf41 smp85 dnf100 smp100 tf102 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 22ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 16.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...