./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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_2_true-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 889a23428ce9b0e3800ffce916f37e53fe302b49 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:07:39,760 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:07:39,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:07:39,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:07:39,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:07:39,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:07:39,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:07:39,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:07:39,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:07:39,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:07:39,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:07:39,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:07:39,796 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:07:39,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:07:39,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:07:39,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:07:39,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:07:39,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:07:39,813 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:07:39,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:07:39,816 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:07:39,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:07:39,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:07:39,820 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:07:39,820 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:07:39,821 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:07:39,822 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:07:39,823 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:07:39,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:07:39,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:07:39,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:07:39,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:07:39,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:07:39,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:07:39,828 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:07:39,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:07:39,829 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:07:39,858 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:07:39,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:07:39,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:07:39,861 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:07:39,861 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:07:39,861 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:07:39,861 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:07:39,861 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:07:39,863 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:07:39,863 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:07:39,863 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:07:39,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:07:39,863 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:07:39,864 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:07:39,864 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:07:39,864 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:07:39,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:07:39,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:07:39,864 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:07:39,865 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:07:39,866 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:07:39,866 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:07:39,866 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:07:39,866 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:07:39,867 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:07:39,867 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:07:39,867 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:07:39,867 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:07:39,867 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:07:39,867 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:07:39,868 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:07:39,869 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:07:39,869 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 -> 889a23428ce9b0e3800ffce916f37e53fe302b49 [2019-01-01 22:07:39,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:07:39,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:07:39,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:07:39,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:07:39,948 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:07:39,949 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2019-01-01 22:07:40,016 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab59c7e9/da81d21fadc54f8dbbda9a8bc7db5481/FLAG8d721ea08 [2019-01-01 22:07:40,486 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:07:40,487 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2019-01-01 22:07:40,495 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab59c7e9/da81d21fadc54f8dbbda9a8bc7db5481/FLAG8d721ea08 [2019-01-01 22:07:40,818 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab59c7e9/da81d21fadc54f8dbbda9a8bc7db5481 [2019-01-01 22:07:40,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:07:40,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:07:40,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:07:40,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:07:40,830 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:07:40,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570c6021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40, skipping insertion in model container [2019-01-01 22:07:40,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:07:40,875 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:07:41,189 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:07:41,201 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:07:41,261 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:07:41,279 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:07:41,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41 WrapperNode [2019-01-01 22:07:41,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:07:41,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:07:41,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:07:41,281 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:07:41,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (1/1) ... [2019-01-01 22:07:41,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (1/1) ... [2019-01-01 22:07:41,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:07:41,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:07:41,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:07:41,405 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:07:41,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (1/1) ... [2019-01-01 22:07:41,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (1/1) ... [2019-01-01 22:07:41,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (1/1) ... [2019-01-01 22:07:41,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (1/1) ... [2019-01-01 22:07:41,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (1/1) ... [2019-01-01 22:07:41,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (1/1) ... [2019-01-01 22:07:41,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (1/1) ... [2019-01-01 22:07:41,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:07:41,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:07:41,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:07:41,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:07:41,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (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-01 22:07:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:07:41,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:07:42,126 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:07:42,126 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-01 22:07:42,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:07:42 BoogieIcfgContainer [2019-01-01 22:07:42,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:07:42,127 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:07:42,128 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:07:42,132 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:07:42,133 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:07:42,133 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:07:40" (1/3) ... [2019-01-01 22:07:42,134 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28eb88da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:07:42, skipping insertion in model container [2019-01-01 22:07:42,134 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:07:42,134 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:41" (2/3) ... [2019-01-01 22:07:42,135 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28eb88da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:07:42, skipping insertion in model container [2019-01-01 22:07:42,135 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:07:42,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:07:42" (3/3) ... [2019-01-01 22:07:42,137 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2019-01-01 22:07:42,192 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:07:42,193 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:07:42,194 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:07:42,194 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:07:42,194 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:07:42,194 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:07:42,194 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:07:42,195 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:07:42,195 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:07:42,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2019-01-01 22:07:42,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-01-01 22:07:42,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:42,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:42,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:07:42,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:42,254 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:07:42,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2019-01-01 22:07:42,258 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-01-01 22:07:42,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:42,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:42,259 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:07:42,259 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:42,267 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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-01 22:07:42,268 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 > 255); 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-01 22:07:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:42,274 INFO L82 PathProgramCache]: Analyzing trace with hash 30109316, now seen corresponding path program 1 times [2019-01-01 22:07:42,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:42,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:42,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:42,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash -476987525, now seen corresponding path program 1 times [2019-01-01 22:07:42,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:42,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:42,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:42,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:42,498 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-01 22:07:42,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:42,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:07:42,508 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:42,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:07:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:07:42,528 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-01 22:07:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:43,093 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2019-01-01 22:07:43,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:07:43,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 93 transitions. [2019-01-01 22:07:43,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2019-01-01 22:07:43,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2019-01-01 22:07:43,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-01-01 22:07:43,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-01-01 22:07:43,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2019-01-01 22:07:43,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:43,111 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2019-01-01 22:07:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2019-01-01 22:07:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-01-01 22:07:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 22:07:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2019-01-01 22:07:43,151 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2019-01-01 22:07:43,151 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2019-01-01 22:07:43,152 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:07:43,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2019-01-01 22:07:43,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-01-01 22:07:43,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:43,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:43,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:43,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:43,156 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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-01 22:07:43,156 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 > 255); 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-01 22:07:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:43,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1129716831, now seen corresponding path program 1 times [2019-01-01 22:07:43,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:43,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:43,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:43,672 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-01-01 22:07:43,706 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-01 22:07:43,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:43,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:07:43,708 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:43,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 1 times [2019-01-01 22:07:43,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:43,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:43,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:43,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:43,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:43,874 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-01 22:07:43,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:43,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:07:43,875 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:43,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:07:43,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:07:43,876 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-01 22:07:44,345 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2019-01-01 22:07:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:46,067 INFO L93 Difference]: Finished difference Result 214 states and 320 transitions. [2019-01-01 22:07:46,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:07:46,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 320 transitions. [2019-01-01 22:07:46,076 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2019-01-01 22:07:46,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 320 transitions. [2019-01-01 22:07:46,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-01-01 22:07:46,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2019-01-01 22:07:46,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 320 transitions. [2019-01-01 22:07:46,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:46,083 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-01-01 22:07:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 320 transitions. [2019-01-01 22:07:46,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 128. [2019-01-01 22:07:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-01 22:07:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2019-01-01 22:07:46,101 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2019-01-01 22:07:46,101 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2019-01-01 22:07:46,101 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:07:46,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 181 transitions. [2019-01-01 22:07:46,104 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2019-01-01 22:07:46,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:46,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:46,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:46,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:46,106 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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-01 22:07:46,107 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 > 255); 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-01 22:07:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash -360547704, now seen corresponding path program 1 times [2019-01-01 22:07:46,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:46,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:46,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:46,390 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-01 22:07:46,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:46,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 22:07:46,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:46,391 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 2 times [2019-01-01 22:07:46,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:46,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:46,486 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-01 22:07:46,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:46,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:07:46,487 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:46,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:07:46,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:07:46,488 INFO L87 Difference]: Start difference. First operand 128 states and 181 transitions. cyclomatic complexity: 56 Second operand 7 states. [2019-01-01 22:07:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:47,957 INFO L93 Difference]: Finished difference Result 373 states and 546 transitions. [2019-01-01 22:07:47,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 22:07:47,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 546 transitions. [2019-01-01 22:07:47,965 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 255 [2019-01-01 22:07:47,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 546 transitions. [2019-01-01 22:07:47,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2019-01-01 22:07:47,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2019-01-01 22:07:47,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 546 transitions. [2019-01-01 22:07:47,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:47,975 INFO L705 BuchiCegarLoop]: Abstraction has 373 states and 546 transitions. [2019-01-01 22:07:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 546 transitions. [2019-01-01 22:07:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 201. [2019-01-01 22:07:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-01 22:07:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 289 transitions. [2019-01-01 22:07:47,995 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2019-01-01 22:07:47,995 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2019-01-01 22:07:47,996 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:07:47,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 289 transitions. [2019-01-01 22:07:47,999 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 119 [2019-01-01 22:07:47,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:47,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:48,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:48,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:48,000 INFO L794 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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-01 22:07:48,000 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 > 255); 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-01 22:07:48,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:48,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1341941206, now seen corresponding path program 1 times [2019-01-01 22:07:48,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:48,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:48,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:48,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:48,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:48,406 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-01 22:07:48,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:48,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 22:07:48,407 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 3 times [2019-01-01 22:07:48,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:48,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:48,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:48,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:48,524 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-01 22:07:48,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:48,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:07:48,524 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:48,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:07:48,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:07:48,525 INFO L87 Difference]: Start difference. First operand 201 states and 289 transitions. cyclomatic complexity: 93 Second operand 8 states. [2019-01-01 22:07:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:50,886 INFO L93 Difference]: Finished difference Result 418 states and 616 transitions. [2019-01-01 22:07:50,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 22:07:50,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 616 transitions. [2019-01-01 22:07:50,892 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 306 [2019-01-01 22:07:50,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 418 states and 616 transitions. [2019-01-01 22:07:50,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2019-01-01 22:07:50,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2019-01-01 22:07:50,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 418 states and 616 transitions. [2019-01-01 22:07:50,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:50,901 INFO L705 BuchiCegarLoop]: Abstraction has 418 states and 616 transitions. [2019-01-01 22:07:50,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 616 transitions. [2019-01-01 22:07:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 276. [2019-01-01 22:07:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-01 22:07:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2019-01-01 22:07:50,921 INFO L728 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2019-01-01 22:07:50,921 INFO L608 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2019-01-01 22:07:50,921 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:07:50,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 395 transitions. [2019-01-01 22:07:50,924 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 166 [2019-01-01 22:07:50,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:50,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:50,925 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:50,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:50,925 INFO L794 eck$LassoCheckResult]: Stem: 1613#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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-01 22:07:50,925 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 > 255); 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-01 22:07:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199508, now seen corresponding path program 1 times [2019-01-01 22:07:50,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:50,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:50,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:50,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:50,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:51,236 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-01 22:07:51,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:51,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 22:07:51,238 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:51,239 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 4 times [2019-01-01 22:07:51,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:51,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:51,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:51,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:51,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:51,400 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-01 22:07:51,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:51,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:07:51,401 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:07:51,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:07:51,402 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. cyclomatic complexity: 126 Second operand 8 states. [2019-01-01 22:07:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:53,000 INFO L93 Difference]: Finished difference Result 375 states and 533 transitions. [2019-01-01 22:07:53,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 22:07:53,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 533 transitions. [2019-01-01 22:07:53,008 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 229 [2019-01-01 22:07:53,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 533 transitions. [2019-01-01 22:07:53,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2019-01-01 22:07:53,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2019-01-01 22:07:53,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 533 transitions. [2019-01-01 22:07:53,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:53,013 INFO L705 BuchiCegarLoop]: Abstraction has 375 states and 533 transitions. [2019-01-01 22:07:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 533 transitions. [2019-01-01 22:07:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 300. [2019-01-01 22:07:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-01 22:07:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 431 transitions. [2019-01-01 22:07:53,028 INFO L728 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2019-01-01 22:07:53,029 INFO L608 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2019-01-01 22:07:53,029 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:07:53,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 431 transitions. [2019-01-01 22:07:53,032 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2019-01-01 22:07:53,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:53,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:53,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:53,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:53,033 INFO L794 eck$LassoCheckResult]: Stem: 2298#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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-01 22:07:53,033 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 > 255); 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-01 22:07:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:53,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 1 times [2019-01-01 22:07:53,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:53,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:53,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:53,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:53,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:53,066 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 5 times [2019-01-01 22:07:53,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:53,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:53,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:53,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:53,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:53,088 INFO L82 PathProgramCache]: Analyzing trace with hash -833715526, now seen corresponding path program 1 times [2019-01-01 22:07:53,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:53,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:53,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:53,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:53,428 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 22:07:53,493 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-01 22:07:53,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:53,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 22:07:53,625 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-01-01 22:07:53,666 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:07:53,667 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:07:53,667 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:07:53,667 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:07:53,667 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:07:53,669 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:07:53,669 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:07:53,669 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:07:53,669 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2019-01-01 22:07:53,669 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:07:53,669 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:07:53,688 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-01 22:07:53,703 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-01 22:07:53,838 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-01 22:07:54,042 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:07:54,043 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-01 22:07:54,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:07:54,049 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) [2019-01-01 22:07:54,097 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:07:54,097 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:07:55,923 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:07:55,926 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:07:55,926 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:07:55,926 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:07:55,926 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:07:55,927 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:07:55,927 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:07:55,927 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:07:55,927 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:07:55,927 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2019-01-01 22:07:55,927 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:07:55,927 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:07:55,929 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-01 22:07:55,937 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-01 22:07:56,066 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-01 22:07:56,242 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:07:56,249 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:07:56,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:56,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:56,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:56,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:56,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:56,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:56,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,274 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:07:56,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:56,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,277 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:07:56,282 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:07:56,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:56,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:56,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,285 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:07:56,292 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:07:56,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,304 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:07:56,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:56,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,308 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:56,313 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:56,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:56,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,324 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:56,331 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:56,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,340 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:07:56,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:56,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,342 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:07:56,348 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:07:56,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:56,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,358 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:07:56,362 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:07:56,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,379 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:07:56,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:56,380 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:07:56,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,385 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:07:56,389 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:07:56,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:56,396 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:07:56,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,399 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:07:56,402 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:07:56,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,427 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:07:56,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:56,428 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:07:56,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,429 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:56,441 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:56,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:56,451 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:07:56,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,454 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:56,459 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:56,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,490 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:07:56,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:56,491 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:07:56,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,497 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:07:56,510 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:07:56,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:56,517 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:07:56,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,522 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:07:56,528 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:07:56,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,548 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:07:56,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:56,551 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:07:56,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,552 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:56,556 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:56,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:56,571 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:07:56,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,572 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:56,573 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:56,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,586 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:07:56,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:56,587 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:07:56,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,590 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:07:56,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:56,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:56,622 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:56,622 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:07:56,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:56,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:56,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:56,625 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:07:56,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:56,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:56,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:56,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:07:56,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:07:56,653 INFO L87 Difference]: Start difference. First operand 300 states and 431 transitions. cyclomatic complexity: 139 Second operand 6 states. [2019-01-01 22:07:57,148 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2019-01-01 22:07:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:57,772 INFO L93 Difference]: Finished difference Result 612 states and 882 transitions. [2019-01-01 22:07:57,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:07:57,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 612 states and 882 transitions. [2019-01-01 22:07:57,780 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 325 [2019-01-01 22:07:57,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 612 states to 612 states and 882 transitions. [2019-01-01 22:07:57,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 612 [2019-01-01 22:07:57,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 612 [2019-01-01 22:07:57,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 612 states and 882 transitions. [2019-01-01 22:07:57,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:57,788 INFO L705 BuchiCegarLoop]: Abstraction has 612 states and 882 transitions. [2019-01-01 22:07:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states and 882 transitions. [2019-01-01 22:07:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 380. [2019-01-01 22:07:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-01 22:07:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 520 transitions. [2019-01-01 22:07:57,802 INFO L728 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2019-01-01 22:07:57,802 INFO L608 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2019-01-01 22:07:57,802 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:07:57,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 520 transitions. [2019-01-01 22:07:57,804 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2019-01-01 22:07:57,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:57,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:57,807 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:57,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:57,807 INFO L794 eck$LassoCheckResult]: Stem: 3219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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-01 22:07:57,807 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 > 255); 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-01 22:07:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash -438599534, now seen corresponding path program 1 times [2019-01-01 22:07:57,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:57,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:57,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:57,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:57,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:57,977 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-01 22:07:57,978 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-01 22:07:57,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:57,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:07:57,979 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:57,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:57,979 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 6 times [2019-01-01 22:07:57,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:57,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:57,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:57,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:57,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:58,568 WARN L181 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-01-01 22:07:58,776 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-01 22:07:58,786 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:07:58,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:07:58,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:07:58,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:07:58,788 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:07:58,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:07:58,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:07:58,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:07:58,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2019-01-01 22:07:58,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:07:58,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:07:58,789 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-01 22:07:58,934 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 22:07:58,935 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-01 22:07:59,063 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 22:07:59,292 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-01 22:07:59,398 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-01 22:07:59,493 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:07:59,493 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-01 22:07:59,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:07:59,501 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-01 22:07:59,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:07:59,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:11,586 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 22:08:11,588 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:11,589 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:11,589 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:11,589 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:11,589 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:11,589 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:11,589 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:11,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:11,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2019-01-01 22:08:11,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:11,590 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:11,591 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-01 22:08:11,603 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-01 22:08:11,754 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-01 22:08:11,948 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:11,948 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:11,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:11,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:11,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:11,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:11,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:11,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:11,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:11,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:11,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:11,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:11,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:11,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:11,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:11,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:11,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:11,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:11,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:11,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:11,964 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:08:11,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:11,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:11,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:11,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:11,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:11,968 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:11,970 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:11,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:11,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:11,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-01 22:08:11,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:11,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:11,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:11,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:11,976 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:11,976 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:11,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:11,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:11,981 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:08:11,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:11,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:11,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:11,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:11,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:11,986 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:11,987 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:11,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:11,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:11,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:11,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:11,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:11,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:11,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:11,995 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:11,999 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,002 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:08:12,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:12,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:12,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,004 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:12,008 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:12,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:12,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:12,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,018 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:12,021 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:12,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,023 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:08:12,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-01 22:08:12,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,025 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:12,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,028 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:12,030 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:12,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,038 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:12,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,039 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:12,043 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:12,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,046 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:08:12,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:12,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,048 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:12,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,049 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:12,054 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,070 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:12,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,070 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:12,076 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,082 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:08:12,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-01 22:08:12,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,085 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:12,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,086 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:12,090 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:12,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,106 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:12,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,107 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:12,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:12,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,117 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:08:12,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,118 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:12,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,122 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:12,123 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,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-01 22:08:12,134 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,134 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:12,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,134 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:12,139 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,146 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:08:12,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,147 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:12,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,151 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:12,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:12,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,172 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:12,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,173 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:12,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:12,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:08:12,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:08:12,192 INFO L87 Difference]: Start difference. First operand 380 states and 520 transitions. cyclomatic complexity: 148 Second operand 3 states. [2019-01-01 22:08:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:12,226 INFO L93 Difference]: Finished difference Result 295 states and 401 transitions. [2019-01-01 22:08:12,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:08:12,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 401 transitions. [2019-01-01 22:08:12,230 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 163 [2019-01-01 22:08:12,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 295 states and 401 transitions. [2019-01-01 22:08:12,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2019-01-01 22:08:12,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2019-01-01 22:08:12,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 401 transitions. [2019-01-01 22:08:12,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:12,235 INFO L705 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2019-01-01 22:08:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 401 transitions. [2019-01-01 22:08:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-01-01 22:08:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-01-01 22:08:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 401 transitions. [2019-01-01 22:08:12,243 INFO L728 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2019-01-01 22:08:12,243 INFO L608 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2019-01-01 22:08:12,243 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:08:12,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 295 states and 401 transitions. [2019-01-01 22:08:12,247 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 163 [2019-01-01 22:08:12,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:12,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:12,249 INFO L866 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] [2019-01-01 22:08:12,251 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:12,251 INFO L794 eck$LassoCheckResult]: Stem: 3896#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 3871#L40 assume !(0 == mp_add_~a3~0 % 256); 3867#L40-1 mp_add_~nb~0 := 4; 3868#L50 assume !(0 == mp_add_~b3~0 % 256); 3889#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3884#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; 3885#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3876#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3873#L65-2 assume !(1 == mp_add_~i~0 % 256); 3874#L66-1 assume !(2 == mp_add_~i~0 % 256); 3879#L67-1 assume !(3 == mp_add_~i~0 % 256); 3880#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4136#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4135#L71-2 assume !(1 == mp_add_~i~0 % 256); 4134#L72-1 assume !(2 == mp_add_~i~0 % 256); 4133#L73-1 assume !(3 == mp_add_~i~0 % 256); 4132#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4131#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4130#L80-1 assume !(1 == mp_add_~i~0 % 256); 4129#L81-1 assume !(2 == mp_add_~i~0 % 256); 4128#L82-1 assume !(3 == mp_add_~i~0 % 256); 4127#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4126#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; 4125#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4112#L65 [2019-01-01 22:08:12,251 INFO L796 eck$LassoCheckResult]: Loop: 4112#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4123#L65-2 assume !(1 == mp_add_~i~0 % 256); 4121#L66-1 assume !(2 == mp_add_~i~0 % 256); 4119#L67-1 assume !(3 == mp_add_~i~0 % 256); 4117#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4115#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4113#L71-2 assume !(1 == mp_add_~i~0 % 256); 4110#L72-1 assume !(2 == mp_add_~i~0 % 256); 4091#L73-1 assume !(3 == mp_add_~i~0 % 256); 3888#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3875#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3857#L80-1 assume !(1 == mp_add_~i~0 % 256); 3858#L81-1 assume !(2 == mp_add_~i~0 % 256); 3863#L82-1 assume !(3 == mp_add_~i~0 % 256); 3864#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3919#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; 3920#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4112#L65 [2019-01-01 22:08:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:12,252 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 1 times [2019-01-01 22:08:12,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:12,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:12,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:12,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:12,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1235554401, now seen corresponding path program 1 times [2019-01-01 22:08:12,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:12,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:12,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:12,326 INFO L82 PathProgramCache]: Analyzing trace with hash 350902213, now seen corresponding path program 1 times [2019-01-01 22:08:12,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:12,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:12,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:12,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:12,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:08:12,659 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:12,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:12,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:12,660 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:12,660 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:12,660 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:12,660 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:12,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:12,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2019-01-01 22:08:12,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:12,660 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:12,661 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-01 22:08:12,677 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-01 22:08:12,823 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 22:08:13,092 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-01 22:08:13,261 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-01 22:08:13,466 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-01 22:08:13,468 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:13,469 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:13,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:13,542 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) [2019-01-01 22:08:13,615 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:13,615 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:14,852 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:14,855 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:14,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:14,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:14,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:14,855 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:14,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:14,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:14,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:14,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2019-01-01 22:08:14,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:14,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:14,858 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-01 22:08:14,878 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-01 22:08:15,141 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-01 22:08:15,258 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:15,259 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:15,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:15,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:15,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:15,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:15,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:15,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:15,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,268 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:08:15,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:15,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,270 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:15,270 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:15,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:15,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,275 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:15,276 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:15,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,278 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:08:15,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:15,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:15,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,280 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:15,281 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:15,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,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-01 22:08:15,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:15,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,287 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:15,288 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:15,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,290 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:08:15,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:15,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:15,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,292 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:15,293 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:15,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:15,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,300 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:15,301 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:15,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,304 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:08:15,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:15,305 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:15,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,305 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:15,306 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:15,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:15,315 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:15,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,315 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:15,317 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:15,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,320 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:08:15,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:15,321 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:15,321 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:15,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,321 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:15,323 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:15,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,339 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:15,339 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:15,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,340 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:15,342 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:15,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,348 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:08:15,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-01 22:08:15,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:15,349 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:15,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,349 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:15,352 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:15,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:15,371 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:15,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,372 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:15,376 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:15,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,379 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:08:15,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:15,380 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:15,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,381 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:15,382 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:15,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:15,391 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:15,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,392 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:15,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:15,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,401 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:08:15,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:15,402 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:15,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,403 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:15,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:15,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:15,421 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:15,421 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:15,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:15,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:15,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:15,422 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:15,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:15,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:15,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:15,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:08:15,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:08:15,440 INFO L87 Difference]: Start difference. First operand 295 states and 401 transitions. cyclomatic complexity: 113 Second operand 4 states. [2019-01-01 22:08:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:16,468 INFO L93 Difference]: Finished difference Result 404 states and 572 transitions. [2019-01-01 22:08:16,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:08:16,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 572 transitions. [2019-01-01 22:08:16,473 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 283 [2019-01-01 22:08:16,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 402 states and 570 transitions. [2019-01-01 22:08:16,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2019-01-01 22:08:16,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 402 [2019-01-01 22:08:16,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 570 transitions. [2019-01-01 22:08:16,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:16,478 INFO L705 BuchiCegarLoop]: Abstraction has 402 states and 570 transitions. [2019-01-01 22:08:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 570 transitions. [2019-01-01 22:08:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 364. [2019-01-01 22:08:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-01-01 22:08:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 507 transitions. [2019-01-01 22:08:16,489 INFO L728 BuchiCegarLoop]: Abstraction has 364 states and 507 transitions. [2019-01-01 22:08:16,489 INFO L608 BuchiCegarLoop]: Abstraction has 364 states and 507 transitions. [2019-01-01 22:08:16,489 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:08:16,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 507 transitions. [2019-01-01 22:08:16,494 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 245 [2019-01-01 22:08:16,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:16,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:16,495 INFO L866 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] [2019-01-01 22:08:16,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:16,495 INFO L794 eck$LassoCheckResult]: Stem: 4602#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 4576#L40 assume !(0 == mp_add_~a3~0 % 256); 4573#L40-1 mp_add_~nb~0 := 4; 4574#L50 assume !(0 == mp_add_~b3~0 % 256); 4596#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4597#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; 4860#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4859#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4858#L65-2 assume !(1 == mp_add_~i~0 % 256); 4857#L66-1 assume !(2 == mp_add_~i~0 % 256); 4856#L67-1 assume !(3 == mp_add_~i~0 % 256); 4855#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4854#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4853#L71-2 assume !(1 == mp_add_~i~0 % 256); 4852#L72-1 assume !(2 == mp_add_~i~0 % 256); 4851#L73-1 assume !(3 == mp_add_~i~0 % 256); 4850#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4848#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4847#L80-1 assume !(1 == mp_add_~i~0 % 256); 4845#L81-1 assume !(2 == mp_add_~i~0 % 256); 4846#L82-1 assume !(3 == mp_add_~i~0 % 256); 4599#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4591#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; 4592#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4867#L65 [2019-01-01 22:08:16,496 INFO L796 eck$LassoCheckResult]: Loop: 4867#L65 assume !(0 == mp_add_~i~0 % 256); 4862#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; 4605#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; 4587#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; 4588#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4575#L71 assume !(0 == mp_add_~i~0 % 256); 4569#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; 4570#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; 4598#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; 4863#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4864#L76-1 assume !(0 == mp_add_~i~0 % 256); 4885#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 4926#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 4571#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 4572#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4619#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; 4620#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4890#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4865#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4866#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4636#L80-1 assume !(1 == mp_add_~i~0 % 256); 4637#L81-1 assume !(2 == mp_add_~i~0 % 256); 4884#L82-1 assume !(3 == mp_add_~i~0 % 256); 4882#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4611#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; 4612#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4867#L65 [2019-01-01 22:08:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 2 times [2019-01-01 22:08:16,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:16,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:16,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:16,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:16,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:16,533 INFO L82 PathProgramCache]: Analyzing trace with hash -929180227, now seen corresponding path program 1 times [2019-01-01 22:08:16,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:16,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:16,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:16,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:16,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 22:08:16,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:16,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:08:16,593 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:16,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:08:16,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:08:16,593 INFO L87 Difference]: Start difference. First operand 364 states and 507 transitions. cyclomatic complexity: 150 Second operand 3 states. [2019-01-01 22:08:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:17,089 INFO L93 Difference]: Finished difference Result 454 states and 625 transitions. [2019-01-01 22:08:17,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:08:17,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 454 states and 625 transitions. [2019-01-01 22:08:17,096 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 329 [2019-01-01 22:08:17,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 454 states to 454 states and 625 transitions. [2019-01-01 22:08:17,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2019-01-01 22:08:17,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 454 [2019-01-01 22:08:17,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 454 states and 625 transitions. [2019-01-01 22:08:17,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:17,101 INFO L705 BuchiCegarLoop]: Abstraction has 454 states and 625 transitions. [2019-01-01 22:08:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states and 625 transitions. [2019-01-01 22:08:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 407. [2019-01-01 22:08:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-01-01 22:08:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 565 transitions. [2019-01-01 22:08:17,111 INFO L728 BuchiCegarLoop]: Abstraction has 407 states and 565 transitions. [2019-01-01 22:08:17,111 INFO L608 BuchiCegarLoop]: Abstraction has 407 states and 565 transitions. [2019-01-01 22:08:17,111 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:08:17,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 565 transitions. [2019-01-01 22:08:17,114 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 285 [2019-01-01 22:08:17,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:17,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:17,118 INFO L866 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] [2019-01-01 22:08:17,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:17,121 INFO L794 eck$LassoCheckResult]: Stem: 5434#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 5403#L40 assume !(0 == mp_add_~a3~0 % 256); 5404#L40-1 mp_add_~nb~0 := 4; 5742#L50 assume !(0 == mp_add_~b3~0 % 256); 5741#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5740#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; 5739#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5738#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5737#L65-2 assume !(1 == mp_add_~i~0 % 256); 5736#L66-1 assume !(2 == mp_add_~i~0 % 256); 5735#L67-1 assume !(3 == mp_add_~i~0 % 256); 5734#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5733#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5732#L71-2 assume !(1 == mp_add_~i~0 % 256); 5731#L72-1 assume !(2 == mp_add_~i~0 % 256); 5730#L73-1 assume !(3 == mp_add_~i~0 % 256); 5729#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5728#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5727#L80-1 assume !(1 == mp_add_~i~0 % 256); 5726#L81-1 assume !(2 == mp_add_~i~0 % 256); 5725#L82-1 assume !(3 == mp_add_~i~0 % 256); 5724#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5723#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; 5722#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5687#L65 [2019-01-01 22:08:17,121 INFO L796 eck$LassoCheckResult]: Loop: 5687#L65 assume !(0 == mp_add_~i~0 % 256); 5721#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; 5719#L66-1 assume !(2 == mp_add_~i~0 % 256); 5717#L67-1 assume !(3 == mp_add_~i~0 % 256); 5715#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5714#L71 assume !(0 == mp_add_~i~0 % 256); 5711#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; 5709#L72-1 assume !(2 == mp_add_~i~0 % 256); 5707#L73-1 assume !(3 == mp_add_~i~0 % 256); 5681#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5677#L76-1 assume !(0 == mp_add_~i~0 % 256); 5672#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 5670#L81-1 assume !(2 == mp_add_~i~0 % 256); 5668#L82-1 assume !(3 == mp_add_~i~0 % 256); 5666#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5665#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; 5663#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5664#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5679#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5674#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5675#L80-1 assume !(1 == mp_add_~i~0 % 256); 5695#L81-1 assume !(2 == mp_add_~i~0 % 256); 5694#L82-1 assume !(3 == mp_add_~i~0 % 256); 5692#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5689#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; 5686#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5687#L65 [2019-01-01 22:08:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:17,121 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 3 times [2019-01-01 22:08:17,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:17,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:17,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:17,163 INFO L82 PathProgramCache]: Analyzing trace with hash 440290813, now seen corresponding path program 1 times [2019-01-01 22:08:17,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:17,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:17,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:17,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:17,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:17,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:17,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:08:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:17,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:17,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:08:17,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2019-01-01 22:08:17,740 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:17,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:08:17,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:08:17,740 INFO L87 Difference]: Start difference. First operand 407 states and 565 transitions. cyclomatic complexity: 164 Second operand 6 states. [2019-01-01 22:08:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:18,524 INFO L93 Difference]: Finished difference Result 482 states and 628 transitions. [2019-01-01 22:08:18,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:08:18,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 628 transitions. [2019-01-01 22:08:18,531 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 341 [2019-01-01 22:08:18,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 476 states and 619 transitions. [2019-01-01 22:08:18,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 476 [2019-01-01 22:08:18,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 476 [2019-01-01 22:08:18,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 476 states and 619 transitions. [2019-01-01 22:08:18,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:18,538 INFO L705 BuchiCegarLoop]: Abstraction has 476 states and 619 transitions. [2019-01-01 22:08:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states and 619 transitions. [2019-01-01 22:08:18,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 372. [2019-01-01 22:08:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-01 22:08:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 477 transitions. [2019-01-01 22:08:18,550 INFO L728 BuchiCegarLoop]: Abstraction has 372 states and 477 transitions. [2019-01-01 22:08:18,550 INFO L608 BuchiCegarLoop]: Abstraction has 372 states and 477 transitions. [2019-01-01 22:08:18,550 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 22:08:18,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 372 states and 477 transitions. [2019-01-01 22:08:18,554 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 241 [2019-01-01 22:08:18,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:18,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:18,556 INFO L866 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] [2019-01-01 22:08:18,556 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:18,556 INFO L794 eck$LassoCheckResult]: Stem: 6416#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 6383#L40 assume !(0 == mp_add_~a3~0 % 256); 6379#L40-1 mp_add_~nb~0 := 4; 6380#L50 assume !(0 == mp_add_~b3~0 % 256); 6404#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6405#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; 6632#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6633#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6628#L65-2 assume !(1 == mp_add_~i~0 % 256); 6629#L66-1 assume !(2 == mp_add_~i~0 % 256); 6624#L67-1 assume !(3 == mp_add_~i~0 % 256); 6625#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6620#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6621#L71-2 assume !(1 == mp_add_~i~0 % 256); 6616#L72-1 assume !(2 == mp_add_~i~0 % 256); 6617#L73-1 assume !(3 == mp_add_~i~0 % 256); 6612#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 6613#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6734#L80-1 assume !(1 == mp_add_~i~0 % 256); 6733#L81-1 assume !(2 == mp_add_~i~0 % 256); 6732#L82-1 assume !(3 == mp_add_~i~0 % 256); 6731#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6730#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; 6729#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6390#L65 [2019-01-01 22:08:18,556 INFO L796 eck$LassoCheckResult]: Loop: 6390#L65 assume !(0 == mp_add_~i~0 % 256); 6391#L65-2 assume !(1 == mp_add_~i~0 % 256); 6727#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; 6725#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; 6723#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6721#L71 assume !(0 == mp_add_~i~0 % 256); 6651#L71-2 assume !(1 == mp_add_~i~0 % 256); 6647#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; 6644#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; 6643#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6641#L76-1 assume !(0 == mp_add_~i~0 % 256); 6642#L80-1 assume !(1 == mp_add_~i~0 % 256); 6637#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 6638#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 6546#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6547#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; 6674#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6668#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6669#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6663#L71-2 assume !(1 == mp_add_~i~0 % 256); 6664#L72-1 assume !(2 == mp_add_~i~0 % 256); 6659#L73-1 assume !(3 == mp_add_~i~0 % 256); 6660#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6655#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6656#L80-1 assume !(1 == mp_add_~i~0 % 256); 6684#L81-1 assume !(2 == mp_add_~i~0 % 256); 6685#L82-1 assume !(3 == mp_add_~i~0 % 256); 6677#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6678#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; 6671#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6390#L65 [2019-01-01 22:08:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:18,562 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 4 times [2019-01-01 22:08:18,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:18,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:18,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:18,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:18,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:18,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash 293037747, now seen corresponding path program 1 times [2019-01-01 22:08:18,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:18,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:18,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:18,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:18,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-01 22:08:18,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:18,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:08:18,662 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:18,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:08:18,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:08:18,663 INFO L87 Difference]: Start difference. First operand 372 states and 477 transitions. cyclomatic complexity: 111 Second operand 3 states. [2019-01-01 22:08:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:19,536 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2019-01-01 22:08:19,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:08:19,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 422 states and 539 transitions. [2019-01-01 22:08:19,542 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 289 [2019-01-01 22:08:19,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 422 states to 422 states and 539 transitions. [2019-01-01 22:08:19,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 422 [2019-01-01 22:08:19,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 422 [2019-01-01 22:08:19,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 422 states and 539 transitions. [2019-01-01 22:08:19,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:19,549 INFO L705 BuchiCegarLoop]: Abstraction has 422 states and 539 transitions. [2019-01-01 22:08:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states and 539 transitions. [2019-01-01 22:08:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 375. [2019-01-01 22:08:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-01-01 22:08:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 483 transitions. [2019-01-01 22:08:19,560 INFO L728 BuchiCegarLoop]: Abstraction has 375 states and 483 transitions. [2019-01-01 22:08:19,560 INFO L608 BuchiCegarLoop]: Abstraction has 375 states and 483 transitions. [2019-01-01 22:08:19,561 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 22:08:19,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 483 transitions. [2019-01-01 22:08:19,566 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 247 [2019-01-01 22:08:19,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:19,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:19,569 INFO L866 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] [2019-01-01 22:08:19,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:19,574 INFO L794 eck$LassoCheckResult]: Stem: 7208#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 7179#L40 assume !(0 == mp_add_~a3~0 % 256); 7180#L40-1 mp_add_~nb~0 := 4; 7436#L50 assume !(0 == mp_add_~b3~0 % 256); 7435#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 7434#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; 7433#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7432#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7431#L65-2 assume !(1 == mp_add_~i~0 % 256); 7429#L66-1 assume !(2 == mp_add_~i~0 % 256); 7427#L67-1 assume !(3 == mp_add_~i~0 % 256); 7424#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7421#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7419#L71-2 assume !(1 == mp_add_~i~0 % 256); 7417#L72-1 assume !(2 == mp_add_~i~0 % 256); 7415#L73-1 assume !(3 == mp_add_~i~0 % 256); 7413#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7411#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7409#L80-1 assume !(1 == mp_add_~i~0 % 256); 7407#L81-1 assume !(2 == mp_add_~i~0 % 256); 7405#L82-1 assume !(3 == mp_add_~i~0 % 256); 7403#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7400#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; 7396#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7393#L65 [2019-01-01 22:08:19,574 INFO L796 eck$LassoCheckResult]: Loop: 7393#L65 assume !(0 == mp_add_~i~0 % 256); 7389#L65-2 assume !(1 == mp_add_~i~0 % 256); 7387#L66-1 assume !(2 == mp_add_~i~0 % 256); 7383#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; 7384#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7460#L71 assume !(0 == mp_add_~i~0 % 256); 7457#L71-2 assume !(1 == mp_add_~i~0 % 256); 7455#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; 7456#L73-1 assume !(3 == mp_add_~i~0 % 256); 7469#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7466#L76-1 assume !(0 == mp_add_~i~0 % 256); 7463#L80-1 assume !(1 == mp_add_~i~0 % 256); 7461#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7450#L82-1 assume !(3 == mp_add_~i~0 % 256); 7402#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7399#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; 7394#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7395#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7423#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7420#L71-2 assume !(1 == mp_add_~i~0 % 256); 7418#L72-1 assume !(2 == mp_add_~i~0 % 256); 7416#L73-1 assume !(3 == mp_add_~i~0 % 256); 7414#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7412#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7410#L80-1 assume !(1 == mp_add_~i~0 % 256); 7408#L81-1 assume !(2 == mp_add_~i~0 % 256); 7406#L82-1 assume !(3 == mp_add_~i~0 % 256); 7404#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7401#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; 7397#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7393#L65 [2019-01-01 22:08:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 5 times [2019-01-01 22:08:19,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:19,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:19,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:19,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:19,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:19,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1585928527, now seen corresponding path program 1 times [2019-01-01 22:08:19,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:19,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:19,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 22:08:19,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:19,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:08:19,687 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:19,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:08:19,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:08:19,687 INFO L87 Difference]: Start difference. First operand 375 states and 483 transitions. cyclomatic complexity: 113 Second operand 3 states. [2019-01-01 22:08:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:20,222 INFO L93 Difference]: Finished difference Result 419 states and 534 transitions. [2019-01-01 22:08:20,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:08:20,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 534 transitions. [2019-01-01 22:08:20,227 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 289 [2019-01-01 22:08:20,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 419 states and 534 transitions. [2019-01-01 22:08:20,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 419 [2019-01-01 22:08:20,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 419 [2019-01-01 22:08:20,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 534 transitions. [2019-01-01 22:08:20,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:20,234 INFO L705 BuchiCegarLoop]: Abstraction has 419 states and 534 transitions. [2019-01-01 22:08:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 534 transitions. [2019-01-01 22:08:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 398. [2019-01-01 22:08:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-01-01 22:08:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 511 transitions. [2019-01-01 22:08:20,244 INFO L728 BuchiCegarLoop]: Abstraction has 398 states and 511 transitions. [2019-01-01 22:08:20,244 INFO L608 BuchiCegarLoop]: Abstraction has 398 states and 511 transitions. [2019-01-01 22:08:20,244 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 22:08:20,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 398 states and 511 transitions. [2019-01-01 22:08:20,249 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 268 [2019-01-01 22:08:20,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:20,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:20,250 INFO L866 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] [2019-01-01 22:08:20,250 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:20,253 INFO L794 eck$LassoCheckResult]: Stem: 8008#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 7979#L40 assume !(0 == mp_add_~a3~0 % 256); 7976#L40-1 mp_add_~nb~0 := 4; 7977#L50 assume !(0 == mp_add_~b3~0 % 256); 8000#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8001#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; 8040#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8041#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8141#L65-2 assume !(1 == mp_add_~i~0 % 256); 8142#L66-1 assume !(2 == mp_add_~i~0 % 256); 8137#L67-1 assume !(3 == mp_add_~i~0 % 256); 8138#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8133#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8134#L71-2 assume !(1 == mp_add_~i~0 % 256); 8129#L72-1 assume !(2 == mp_add_~i~0 % 256); 8130#L73-1 assume !(3 == mp_add_~i~0 % 256); 8126#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8125#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8124#L80-1 assume !(1 == mp_add_~i~0 % 256); 8123#L81-1 assume !(2 == mp_add_~i~0 % 256); 8039#L82-1 assume !(3 == mp_add_~i~0 % 256); 8004#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7996#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; 7997#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8276#L65 [2019-01-01 22:08:20,253 INFO L796 eck$LassoCheckResult]: Loop: 8276#L65 assume !(0 == mp_add_~i~0 % 256); 8274#L65-2 assume !(1 == mp_add_~i~0 % 256); 8272#L66-1 assume !(2 == mp_add_~i~0 % 256); 8273#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; 8280#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8279#L71 assume !(0 == mp_add_~i~0 % 256); 8278#L71-2 assume !(1 == mp_add_~i~0 % 256); 8243#L72-1 assume !(2 == mp_add_~i~0 % 256); 8244#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; 8324#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8156#L76-1 assume !(0 == mp_add_~i~0 % 256); 8157#L80-1 assume !(1 == mp_add_~i~0 % 256); 8144#L81-1 assume !(2 == mp_add_~i~0 % 256); 8145#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 8037#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8038#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; 8032#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8034#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8165#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8121#L71-2 assume !(1 == mp_add_~i~0 % 256); 8120#L72-1 assume !(2 == mp_add_~i~0 % 256); 8119#L73-1 assume !(3 == mp_add_~i~0 % 256); 8118#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8117#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8116#L80-1 assume !(1 == mp_add_~i~0 % 256); 8115#L81-1 assume !(2 == mp_add_~i~0 % 256); 8113#L82-1 assume !(3 == mp_add_~i~0 % 256); 8114#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8023#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; 8024#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8276#L65 [2019-01-01 22:08:20,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 6 times [2019-01-01 22:08:20,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:20,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:20,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:20,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:20,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash 278948913, now seen corresponding path program 1 times [2019-01-01 22:08:20,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:20,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:20,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:20,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:20,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:20,864 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-01-01 22:08:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:20,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:20,972 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-01 22:08:20,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:21,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:21,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:08:21,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-01 22:08:21,331 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:21,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:08:21,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:08:21,331 INFO L87 Difference]: Start difference. First operand 398 states and 511 transitions. cyclomatic complexity: 118 Second operand 7 states. [2019-01-01 22:08:22,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:22,559 INFO L93 Difference]: Finished difference Result 1137 states and 1501 transitions. [2019-01-01 22:08:22,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 22:08:22,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1137 states and 1501 transitions. [2019-01-01 22:08:22,569 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 988 [2019-01-01 22:08:22,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1137 states to 1137 states and 1501 transitions. [2019-01-01 22:08:22,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1137 [2019-01-01 22:08:22,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1137 [2019-01-01 22:08:22,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1137 states and 1501 transitions. [2019-01-01 22:08:22,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:22,584 INFO L705 BuchiCegarLoop]: Abstraction has 1137 states and 1501 transitions. [2019-01-01 22:08:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states and 1501 transitions. [2019-01-01 22:08:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 516. [2019-01-01 22:08:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-01-01 22:08:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 669 transitions. [2019-01-01 22:08:22,601 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 669 transitions. [2019-01-01 22:08:22,601 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 669 transitions. [2019-01-01 22:08:22,602 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 22:08:22,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 669 transitions. [2019-01-01 22:08:22,606 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 386 [2019-01-01 22:08:22,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:22,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:22,609 INFO L866 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] [2019-01-01 22:08:22,609 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:22,609 INFO L794 eck$LassoCheckResult]: Stem: 9679#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 9648#L40 assume !(0 == mp_add_~a3~0 % 256); 9649#L40-1 mp_add_~nb~0 := 4; 9866#L50 assume !(0 == mp_add_~b3~0 % 256); 9865#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 9864#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; 9863#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9862#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9861#L65-2 assume !(1 == mp_add_~i~0 % 256); 9860#L66-1 assume !(2 == mp_add_~i~0 % 256); 9859#L67-1 assume !(3 == mp_add_~i~0 % 256); 9858#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9857#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 9856#L71-2 assume !(1 == mp_add_~i~0 % 256); 9855#L72-1 assume !(2 == mp_add_~i~0 % 256); 9854#L73-1 assume !(3 == mp_add_~i~0 % 256); 9853#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9852#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 9851#L80-1 assume !(1 == mp_add_~i~0 % 256); 9850#L81-1 assume !(2 == mp_add_~i~0 % 256); 9849#L82-1 assume !(3 == mp_add_~i~0 % 256); 9848#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9847#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; 9844#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9837#L65 [2019-01-01 22:08:22,612 INFO L796 eck$LassoCheckResult]: Loop: 9837#L65 assume !(0 == mp_add_~i~0 % 256); 9835#L65-2 assume !(1 == mp_add_~i~0 % 256); 9833#L66-1 assume !(2 == mp_add_~i~0 % 256); 9832#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; 9830#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9828#L71 assume !(0 == mp_add_~i~0 % 256); 9826#L71-2 assume !(1 == mp_add_~i~0 % 256); 9824#L72-1 assume !(2 == mp_add_~i~0 % 256); 9821#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; 9819#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 9820#L76-1 assume !(0 == mp_add_~i~0 % 256); 9815#L80-1 assume !(1 == mp_add_~i~0 % 256); 9816#L81-1 assume !(2 == mp_add_~i~0 % 256); 9810#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 9811#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9845#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; 9846#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9837#L65 [2019-01-01 22:08:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:22,612 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 7 times [2019-01-01 22:08:22,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:22,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:22,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:22,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:22,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash -459730205, now seen corresponding path program 1 times [2019-01-01 22:08:22,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:22,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:22,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1126726409, now seen corresponding path program 1 times [2019-01-01 22:08:22,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:22,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:22,966 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-01 22:08:23,304 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-01-01 22:08:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:23,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:23,335 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-01 22:08:23,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:23,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-01 22:08:23,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:08:23,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2019-01-01 22:08:23,840 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-01-01 22:08:23,870 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:23,870 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:23,870 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:23,870 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:23,870 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:23,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:23,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:23,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:23,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration14_Loop [2019-01-01 22:08:23,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:23,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:23,872 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-01 22:08:23,905 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-01 22:08:24,190 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-01 22:08:24,314 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:24,314 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:24,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:24,321 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:24,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:24,360 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:25,348 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:25,353 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:25,353 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:25,353 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:25,353 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:25,353 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:25,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:25,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:25,353 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:25,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration14_Loop [2019-01-01 22:08:25,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:25,354 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:25,355 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-01 22:08:25,370 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-01 22:08:25,639 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-01 22:08:25,769 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:25,769 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:25,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:25,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:25,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:25,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:25,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:25,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:25,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,779 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:08:25,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:25,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,781 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:25,781 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:25,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:25,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,785 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:25,786 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:25,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,788 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:08:25,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:25,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,789 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:25,790 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:25,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:25,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:25,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,795 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:25,796 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:25,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,798 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:08:25,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:25,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:25,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,800 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:25,801 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:25,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:25,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,808 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:25,810 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:25,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,812 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:08:25,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:25,813 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:25,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,814 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:25,815 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:25,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:25,827 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:25,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,828 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:25,830 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:25,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,832 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:08:25,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:25,833 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:25,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,834 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:25,836 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:25,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:25,851 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:25,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,852 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:25,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:25,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,866 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:08:25,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-01 22:08:25,867 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:25,867 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:25,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,867 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:25,871 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:25,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:25,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:25,884 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:25,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,885 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:25,889 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:25,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,892 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:08:25,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,893 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:25,893 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:25,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:25,894 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:25,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:25,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:25,903 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:25,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:25,906 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:25,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,913 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:08:25,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:25,915 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:25,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,915 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:25,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:25,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:25,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:25,951 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:25,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,955 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:25,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:25,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:25,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:08:25,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:08:25,981 INFO L87 Difference]: Start difference. First operand 516 states and 669 transitions. cyclomatic complexity: 159 Second operand 8 states. [2019-01-01 22:08:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:27,707 INFO L93 Difference]: Finished difference Result 656 states and 821 transitions. [2019-01-01 22:08:27,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 22:08:27,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 821 transitions. [2019-01-01 22:08:27,716 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 514 [2019-01-01 22:08:27,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 647 states and 808 transitions. [2019-01-01 22:08:27,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 647 [2019-01-01 22:08:27,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 647 [2019-01-01 22:08:27,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 808 transitions. [2019-01-01 22:08:27,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:27,722 INFO L705 BuchiCegarLoop]: Abstraction has 647 states and 808 transitions. [2019-01-01 22:08:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 808 transitions. [2019-01-01 22:08:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 574. [2019-01-01 22:08:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-01-01 22:08:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 729 transitions. [2019-01-01 22:08:27,739 INFO L728 BuchiCegarLoop]: Abstraction has 574 states and 729 transitions. [2019-01-01 22:08:27,739 INFO L608 BuchiCegarLoop]: Abstraction has 574 states and 729 transitions. [2019-01-01 22:08:27,739 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 22:08:27,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 729 transitions. [2019-01-01 22:08:27,745 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 447 [2019-01-01 22:08:27,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:27,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:27,746 INFO L866 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-01 22:08:27,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:27,750 INFO L794 eck$LassoCheckResult]: Stem: 10990#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 10959#L40 assume !(0 == mp_add_~a3~0 % 256); 10960#L40-1 mp_add_~nb~0 := 4; 11140#L50 assume !(0 == mp_add_~b3~0 % 256); 11139#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11138#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; 11137#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11136#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 11135#L65-2 assume !(1 == mp_add_~i~0 % 256); 11134#L66-1 assume !(2 == mp_add_~i~0 % 256); 11133#L67-1 assume !(3 == mp_add_~i~0 % 256); 11132#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11131#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 11130#L71-2 assume !(1 == mp_add_~i~0 % 256); 11129#L72-1 assume !(2 == mp_add_~i~0 % 256); 11128#L73-1 assume !(3 == mp_add_~i~0 % 256); 11127#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 11126#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 11125#L80-1 assume !(1 == mp_add_~i~0 % 256); 11124#L81-1 assume !(2 == mp_add_~i~0 % 256); 11123#L82-1 assume !(3 == mp_add_~i~0 % 256); 11122#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11121#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; 11120#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11119#L65 assume !(0 == mp_add_~i~0 % 256); 11118#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; 11051#L66-1 [2019-01-01 22:08:27,750 INFO L796 eck$LassoCheckResult]: Loop: 11051#L66-1 assume !(2 == mp_add_~i~0 % 256); 11117#L67-1 assume !(3 == mp_add_~i~0 % 256); 11116#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11115#L71 assume !(0 == mp_add_~i~0 % 256); 11114#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; 11113#L72-1 assume !(2 == mp_add_~i~0 % 256); 11112#L73-1 assume !(3 == mp_add_~i~0 % 256); 11111#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 11110#L76-1 assume !(0 == mp_add_~i~0 % 256); 11108#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 11107#L81-1 assume !(2 == mp_add_~i~0 % 256); 11052#L82-1 assume !(3 == mp_add_~i~0 % 256); 11043#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11044#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; 11039#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11040#L65 assume !(0 == mp_add_~i~0 % 256); 11050#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; 11051#L66-1 [2019-01-01 22:08:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 1 times [2019-01-01 22:08:27,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:27,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:27,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1434173717, now seen corresponding path program 1 times [2019-01-01 22:08:27,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:27,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:27,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:27,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:28,000 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-01 22:08:28,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:28,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:08:28,001 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:28,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:08:28,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:08:28,002 INFO L87 Difference]: Start difference. First operand 574 states and 729 transitions. cyclomatic complexity: 163 Second operand 5 states. [2019-01-01 22:08:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:28,227 INFO L93 Difference]: Finished difference Result 896 states and 1144 transitions. [2019-01-01 22:08:28,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:08:28,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 896 states and 1144 transitions. [2019-01-01 22:08:28,234 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 763 [2019-01-01 22:08:28,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 896 states to 896 states and 1144 transitions. [2019-01-01 22:08:28,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 896 [2019-01-01 22:08:28,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 896 [2019-01-01 22:08:28,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 896 states and 1144 transitions. [2019-01-01 22:08:28,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:28,245 INFO L705 BuchiCegarLoop]: Abstraction has 896 states and 1144 transitions. [2019-01-01 22:08:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states and 1144 transitions. [2019-01-01 22:08:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 644. [2019-01-01 22:08:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-01-01 22:08:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 817 transitions. [2019-01-01 22:08:28,262 INFO L728 BuchiCegarLoop]: Abstraction has 644 states and 817 transitions. [2019-01-01 22:08:28,262 INFO L608 BuchiCegarLoop]: Abstraction has 644 states and 817 transitions. [2019-01-01 22:08:28,262 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-01 22:08:28,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 644 states and 817 transitions. [2019-01-01 22:08:28,267 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 523 [2019-01-01 22:08:28,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:28,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:28,270 INFO L866 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-01 22:08:28,270 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:28,271 INFO L794 eck$LassoCheckResult]: Stem: 12469#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 12438#L40 assume !(0 == mp_add_~a3~0 % 256); 12439#L40-1 mp_add_~nb~0 := 4; 12708#L50 assume !(0 == mp_add_~b3~0 % 256); 12707#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 12706#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; 12705#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12704#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12703#L65-2 assume !(1 == mp_add_~i~0 % 256); 12702#L66-1 assume !(2 == mp_add_~i~0 % 256); 12701#L67-1 assume !(3 == mp_add_~i~0 % 256); 12700#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12699#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12698#L71-2 assume !(1 == mp_add_~i~0 % 256); 12697#L72-1 assume !(2 == mp_add_~i~0 % 256); 12696#L73-1 assume !(3 == mp_add_~i~0 % 256); 12695#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12694#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12693#L80-1 assume !(1 == mp_add_~i~0 % 256); 12692#L81-1 assume !(2 == mp_add_~i~0 % 256); 12691#L82-1 assume !(3 == mp_add_~i~0 % 256); 12690#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12689#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; 12688#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12687#L65 assume !(0 == mp_add_~i~0 % 256); 12686#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; 12685#L66-1 [2019-01-01 22:08:28,271 INFO L796 eck$LassoCheckResult]: Loop: 12685#L66-1 assume !(2 == mp_add_~i~0 % 256); 12684#L67-1 assume !(3 == mp_add_~i~0 % 256); 12683#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12682#L71 assume !(0 == mp_add_~i~0 % 256); 12681#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; 12680#L72-1 assume !(2 == mp_add_~i~0 % 256); 12679#L73-1 assume !(3 == mp_add_~i~0 % 256); 12678#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12677#L76-1 assume !(0 == mp_add_~i~0 % 256); 12676#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 12675#L81-1 assume !(2 == mp_add_~i~0 % 256); 12674#L82-1 assume !(3 == mp_add_~i~0 % 256); 12673#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12621#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; 12622#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12611#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12613#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12606#L76-1 assume !(0 == mp_add_~i~0 % 256); 12521#L80-1 assume !(1 == mp_add_~i~0 % 256); 12522#L81-1 assume !(2 == mp_add_~i~0 % 256); 12517#L82-1 assume !(3 == mp_add_~i~0 % 256); 12512#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12510#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; 12511#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12615#L65 assume !(0 == mp_add_~i~0 % 256); 12655#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; 12685#L66-1 [2019-01-01 22:08:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:28,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 2 times [2019-01-01 22:08:28,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:28,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:28,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:28,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:28,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:28,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:28,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1615640065, now seen corresponding path program 1 times [2019-01-01 22:08:28,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:28,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:28,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:28,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:28,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:28,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:28,549 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-01 22:08:28,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:28,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:29,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:08:29,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2019-01-01 22:08:29,464 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:29,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 22:08:29,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=104, Unknown=1, NotChecked=0, Total=132 [2019-01-01 22:08:29,465 INFO L87 Difference]: Start difference. First operand 644 states and 817 transitions. cyclomatic complexity: 181 Second operand 12 states. [2019-01-01 22:08:31,452 WARN L181 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-01 22:08:32,301 WARN L181 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-01-01 22:08:35,152 WARN L181 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2019-01-01 22:08:38,098 WARN L181 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-01-01 22:08:40,200 WARN L181 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-01-01 22:08:41,125 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-01-01 22:09:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:05,034 INFO L93 Difference]: Finished difference Result 1619 states and 2002 transitions. [2019-01-01 22:09:05,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 22:09:05,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1619 states and 2002 transitions. [2019-01-01 22:09:05,042 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1445 [2019-01-01 22:09:05,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1619 states to 1584 states and 1937 transitions. [2019-01-01 22:09:05,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1584 [2019-01-01 22:09:05,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1584 [2019-01-01 22:09:05,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1584 states and 1937 transitions. [2019-01-01 22:09:05,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:05,057 INFO L705 BuchiCegarLoop]: Abstraction has 1584 states and 1937 transitions. [2019-01-01 22:09:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states and 1937 transitions. [2019-01-01 22:09:05,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1090. [2019-01-01 22:09:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-01-01 22:09:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1367 transitions. [2019-01-01 22:09:05,082 INFO L728 BuchiCegarLoop]: Abstraction has 1090 states and 1367 transitions. [2019-01-01 22:09:05,082 INFO L608 BuchiCegarLoop]: Abstraction has 1090 states and 1367 transitions. [2019-01-01 22:09:05,082 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-01 22:09:05,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1090 states and 1367 transitions. [2019-01-01 22:09:05,089 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1007 [2019-01-01 22:09:05,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:05,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:05,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:05,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:05,091 INFO L794 eck$LassoCheckResult]: Stem: 14868#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 14842#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14844#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14866#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14839#L40-1 mp_add_~nb~0 := 4; 14840#L50 assume !(0 == mp_add_~b3~0 % 256); 14862#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 14863#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; 15689#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14850#L65 [2019-01-01 22:09:05,091 INFO L796 eck$LassoCheckResult]: Loop: 14850#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 14847#L65-2 assume !(1 == mp_add_~i~0 % 256); 14848#L66-1 assume !(2 == mp_add_~i~0 % 256); 15879#L67-1 assume !(3 == mp_add_~i~0 % 256); 15878#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15877#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 15876#L71-2 assume !(1 == mp_add_~i~0 % 256); 15875#L72-1 assume !(2 == mp_add_~i~0 % 256); 15874#L73-1 assume !(3 == mp_add_~i~0 % 256); 15873#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15872#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 15871#L80-1 assume !(1 == mp_add_~i~0 % 256); 15870#L81-1 assume !(2 == mp_add_~i~0 % 256); 15869#L82-1 assume !(3 == mp_add_~i~0 % 256); 15868#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15866#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; 15865#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15864#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15863#L71 assume !(0 == mp_add_~i~0 % 256); 15855#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; 15706#L72-1 assume !(2 == mp_add_~i~0 % 256); 15854#L73-1 assume !(3 == mp_add_~i~0 % 256); 15853#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15852#L76-1 assume !(0 == mp_add_~i~0 % 256); 15839#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 15777#L81-1 assume !(2 == mp_add_~i~0 % 256); 15775#L82-1 assume !(3 == mp_add_~i~0 % 256); 15773#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14905#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; 14906#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15295#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15293#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15292#L76-1 assume !(0 == mp_add_~i~0 % 256); 15291#L80-1 assume !(1 == mp_add_~i~0 % 256); 15289#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15290#L82-1 assume !(3 == mp_add_~i~0 % 256); 14908#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14909#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; 15738#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15736#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15734#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15731#L76-1 assume !(0 == mp_add_~i~0 % 256); 15728#L80-1 assume !(1 == mp_add_~i~0 % 256); 15722#L81-1 assume !(2 == mp_add_~i~0 % 256); 15719#L82-1 assume !(3 == mp_add_~i~0 % 256); 15708#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15692#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; 15693#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14850#L65 [2019-01-01 22:09:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:05,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 2 times [2019-01-01 22:09:05,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:05,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:05,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:05,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:05,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2024966345, now seen corresponding path program 1 times [2019-01-01 22:09:05,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:05,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:05,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:09:05,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 22:09:05,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:05,270 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-01 22:09:05,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:05,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 22:09:05,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:09:05,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-01-01 22:09:05,432 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:09:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:09:05,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:09:05,433 INFO L87 Difference]: Start difference. First operand 1090 states and 1367 transitions. cyclomatic complexity: 285 Second operand 8 states. [2019-01-01 22:09:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:05,640 INFO L93 Difference]: Finished difference Result 1814 states and 2183 transitions. [2019-01-01 22:09:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:09:05,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1814 states and 2183 transitions. [2019-01-01 22:09:05,649 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1716 [2019-01-01 22:09:05,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1814 states to 1814 states and 2183 transitions. [2019-01-01 22:09:05,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1814 [2019-01-01 22:09:05,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1814 [2019-01-01 22:09:05,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1814 states and 2183 transitions. [2019-01-01 22:09:05,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:05,664 INFO L705 BuchiCegarLoop]: Abstraction has 1814 states and 2183 transitions. [2019-01-01 22:09:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states and 2183 transitions. [2019-01-01 22:09:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1589. [2019-01-01 22:09:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2019-01-01 22:09:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1939 transitions. [2019-01-01 22:09:05,696 INFO L728 BuchiCegarLoop]: Abstraction has 1589 states and 1939 transitions. [2019-01-01 22:09:05,696 INFO L608 BuchiCegarLoop]: Abstraction has 1589 states and 1939 transitions. [2019-01-01 22:09:05,696 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-01 22:09:05,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1589 states and 1939 transitions. [2019-01-01 22:09:05,705 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1506 [2019-01-01 22:09:05,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:05,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:05,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:05,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:05,708 INFO L794 eck$LassoCheckResult]: Stem: 17932#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 17900#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17902#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17928#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17896#L40-1 mp_add_~nb~0 := 4; 17897#L50 assume !(0 == mp_add_~b3~0 % 256); 17921#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 17922#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; 18526#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18527#L65 [2019-01-01 22:09:05,708 INFO L796 eck$LassoCheckResult]: Loop: 18527#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18893#L65-2 assume !(1 == mp_add_~i~0 % 256); 19174#L66-1 assume !(2 == mp_add_~i~0 % 256); 19173#L67-1 assume !(3 == mp_add_~i~0 % 256); 19172#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19171#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 19170#L71-2 assume !(1 == mp_add_~i~0 % 256); 19169#L72-1 assume !(2 == mp_add_~i~0 % 256); 19168#L73-1 assume !(3 == mp_add_~i~0 % 256); 19167#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19166#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 19165#L80-1 assume !(1 == mp_add_~i~0 % 256); 19164#L81-1 assume !(2 == mp_add_~i~0 % 256); 19163#L82-1 assume !(3 == mp_add_~i~0 % 256); 19162#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19161#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; 19154#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19152#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19143#L71 assume !(0 == mp_add_~i~0 % 256); 19141#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; 18993#L72-1 assume !(2 == mp_add_~i~0 % 256); 19138#L73-1 assume !(3 == mp_add_~i~0 % 256); 19134#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19132#L76-1 assume !(0 == mp_add_~i~0 % 256); 19129#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 19125#L81-1 assume !(2 == mp_add_~i~0 % 256); 19126#L82-1 assume !(3 == mp_add_~i~0 % 256); 19117#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19118#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; 19147#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19145#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19107#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19106#L76-1 assume !(0 == mp_add_~i~0 % 256); 19104#L80-1 assume !(1 == mp_add_~i~0 % 256); 19102#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 19100#L82-1 assume !(3 == mp_add_~i~0 % 256); 19077#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19078#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; 19060#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19061#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19079#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19090#L76-1 assume !(0 == mp_add_~i~0 % 256); 19089#L80-1 assume !(1 == mp_add_~i~0 % 256); 19046#L81-1 assume !(2 == mp_add_~i~0 % 256); 19012#L82-1 assume !(3 == mp_add_~i~0 % 256); 18999#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19030#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; 19027#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18527#L65 [2019-01-01 22:09:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 3 times [2019-01-01 22:09:05,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:05,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:05,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:05,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:05,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:05,733 INFO L82 PathProgramCache]: Analyzing trace with hash 310688569, now seen corresponding path program 1 times [2019-01-01 22:09:05,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:05,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:05,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:09:05,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:06,125 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-01 22:09:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-01 22:09:06,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:09:06,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:09:06,129 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:09:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:09:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:09:06,130 INFO L87 Difference]: Start difference. First operand 1589 states and 1939 transitions. cyclomatic complexity: 358 Second operand 4 states. [2019-01-01 22:09:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:06,270 INFO L93 Difference]: Finished difference Result 1982 states and 2357 transitions. [2019-01-01 22:09:06,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:09:06,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1982 states and 2357 transitions. [2019-01-01 22:09:06,281 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1884 [2019-01-01 22:09:06,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1982 states to 1982 states and 2357 transitions. [2019-01-01 22:09:06,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1982 [2019-01-01 22:09:06,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1982 [2019-01-01 22:09:06,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1982 states and 2357 transitions. [2019-01-01 22:09:06,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:06,293 INFO L705 BuchiCegarLoop]: Abstraction has 1982 states and 2357 transitions. [2019-01-01 22:09:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states and 2357 transitions. [2019-01-01 22:09:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1675. [2019-01-01 22:09:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1675 states. [2019-01-01 22:09:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2012 transitions. [2019-01-01 22:09:06,324 INFO L728 BuchiCegarLoop]: Abstraction has 1675 states and 2012 transitions. [2019-01-01 22:09:06,324 INFO L608 BuchiCegarLoop]: Abstraction has 1675 states and 2012 transitions. [2019-01-01 22:09:06,324 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-01 22:09:06,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1675 states and 2012 transitions. [2019-01-01 22:09:06,332 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1592 [2019-01-01 22:09:06,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:06,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:06,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:06,334 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:06,334 INFO L794 eck$LassoCheckResult]: Stem: 21506#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 21478#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21479#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21503#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21508#L40-1 mp_add_~nb~0 := 4; 21499#L50 assume !(0 == mp_add_~b3~0 % 256); 21500#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 22402#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; 22399#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22398#L65 [2019-01-01 22:09:06,334 INFO L796 eck$LassoCheckResult]: Loop: 22398#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22397#L65-2 assume !(1 == mp_add_~i~0 % 256); 22396#L66-1 assume !(2 == mp_add_~i~0 % 256); 22395#L67-1 assume !(3 == mp_add_~i~0 % 256); 22394#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22393#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 22392#L71-2 assume !(1 == mp_add_~i~0 % 256); 22391#L72-1 assume !(2 == mp_add_~i~0 % 256); 22390#L73-1 assume !(3 == mp_add_~i~0 % 256); 22389#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22388#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 22387#L80-1 assume !(1 == mp_add_~i~0 % 256); 22386#L81-1 assume !(2 == mp_add_~i~0 % 256); 22385#L82-1 assume !(3 == mp_add_~i~0 % 256); 22383#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22379#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; 22367#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22366#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22364#L71 assume !(0 == mp_add_~i~0 % 256); 22306#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; 21581#L72-1 assume !(2 == mp_add_~i~0 % 256); 21582#L73-1 assume !(3 == mp_add_~i~0 % 256); 21576#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 21577#L76-1 assume !(0 == mp_add_~i~0 % 256); 21557#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 21558#L81-1 assume !(2 == mp_add_~i~0 % 256); 21550#L82-1 assume !(3 == mp_add_~i~0 % 256); 21551#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 21538#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; 21539#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21985#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21592#L71 assume !(0 == mp_add_~i~0 % 256); 21962#L71-2 assume !(1 == mp_add_~i~0 % 256); 22301#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; 21589#L73-1 assume !(3 == mp_add_~i~0 % 256); 21590#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22337#L76-1 assume !(0 == mp_add_~i~0 % 256); 22336#L80-1 assume !(1 == mp_add_~i~0 % 256); 22335#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 22334#L82-1 assume !(3 == mp_add_~i~0 % 256); 22333#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22332#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; 22331#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22329#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22328#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22286#L76-1 assume !(0 == mp_add_~i~0 % 256); 22287#L80-1 assume !(1 == mp_add_~i~0 % 256); 22245#L81-1 assume !(2 == mp_add_~i~0 % 256); 22246#L82-1 assume !(3 == mp_add_~i~0 % 256); 22403#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22400#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; 22401#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22398#L65 [2019-01-01 22:09:06,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:06,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 4 times [2019-01-01 22:09:06,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:06,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:06,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:06,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:06,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash 982437249, now seen corresponding path program 1 times [2019-01-01 22:09:06,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:06,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:06,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:06,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:09:06,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 22:09:06,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:06,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:09:06,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:06,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 22:09:06,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:09:06,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-01-01 22:09:06,985 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:09:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 22:09:06,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-01-01 22:09:06,985 INFO L87 Difference]: Start difference. First operand 1675 states and 2012 transitions. cyclomatic complexity: 345 Second operand 10 states. [2019-01-01 22:09:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:09,036 INFO L93 Difference]: Finished difference Result 2084 states and 2327 transitions. [2019-01-01 22:09:09,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 22:09:09,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2084 states and 2327 transitions. [2019-01-01 22:09:09,045 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1480 [2019-01-01 22:09:09,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2084 states to 1947 states and 2180 transitions. [2019-01-01 22:09:09,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1947 [2019-01-01 22:09:09,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1947 [2019-01-01 22:09:09,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1947 states and 2180 transitions. [2019-01-01 22:09:09,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:09,056 INFO L705 BuchiCegarLoop]: Abstraction has 1947 states and 2180 transitions. [2019-01-01 22:09:09,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states and 2180 transitions. [2019-01-01 22:09:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1165. [2019-01-01 22:09:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-01-01 22:09:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1337 transitions. [2019-01-01 22:09:09,080 INFO L728 BuchiCegarLoop]: Abstraction has 1165 states and 1337 transitions. [2019-01-01 22:09:09,080 INFO L608 BuchiCegarLoop]: Abstraction has 1165 states and 1337 transitions. [2019-01-01 22:09:09,080 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2019-01-01 22:09:09,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1165 states and 1337 transitions. [2019-01-01 22:09:09,087 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 926 [2019-01-01 22:09:09,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:09,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:09,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:09,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:09,088 INFO L794 eck$LassoCheckResult]: Stem: 25504#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 25477#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25478#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25500#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25506#L40-1 mp_add_~nb~0 := 4; 26045#L50 assume !(0 == mp_add_~b3~0 % 256); 26042#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 26043#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; 26039#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26038#L65 [2019-01-01 22:09:09,088 INFO L796 eck$LassoCheckResult]: Loop: 26038#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 26037#L65-2 assume !(1 == mp_add_~i~0 % 256); 26036#L66-1 assume !(2 == mp_add_~i~0 % 256); 26035#L67-1 assume !(3 == mp_add_~i~0 % 256); 26034#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26033#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 26032#L71-2 assume !(1 == mp_add_~i~0 % 256); 26031#L72-1 assume !(2 == mp_add_~i~0 % 256); 26030#L73-1 assume !(3 == mp_add_~i~0 % 256); 26028#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 26027#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 26026#L80-1 assume !(1 == mp_add_~i~0 % 256); 26025#L81-1 assume !(2 == mp_add_~i~0 % 256); 26024#L82-1 assume !(3 == mp_add_~i~0 % 256); 26022#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26020#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; 26018#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26016#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26011#L71 assume !(0 == mp_add_~i~0 % 256); 26009#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; 26007#L72-1 assume !(2 == mp_add_~i~0 % 256); 26005#L73-1 assume !(3 == mp_add_~i~0 % 256); 26001#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25999#L76-1 assume !(0 == mp_add_~i~0 % 256); 25996#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 25997#L81-1 assume !(2 == mp_add_~i~0 % 256); 25992#L82-1 assume !(3 == mp_add_~i~0 % 256); 25993#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25980#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; 25981#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26013#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26012#L71 assume !(0 == mp_add_~i~0 % 256); 25966#L71-2 assume !(1 == mp_add_~i~0 % 256); 25965#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; 25964#L73-1 assume !(3 == mp_add_~i~0 % 256); 25962#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25961#L76-1 assume !(0 == mp_add_~i~0 % 256); 25960#L80-1 assume !(1 == mp_add_~i~0 % 256); 25959#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 25958#L82-1 assume !(3 == mp_add_~i~0 % 256); 25957#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25956#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; 25955#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25952#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25953#L71 assume !(0 == mp_add_~i~0 % 256); 26062#L71-2 assume !(1 == mp_add_~i~0 % 256); 26061#L72-1 assume !(2 == mp_add_~i~0 % 256); 26060#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; 26059#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 26058#L76-1 assume !(0 == mp_add_~i~0 % 256); 26057#L80-1 assume !(1 == mp_add_~i~0 % 256); 26056#L81-1 assume !(2 == mp_add_~i~0 % 256); 26055#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 26054#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26053#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; 26052#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26051#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 26050#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 26049#L76-1 assume !(0 == mp_add_~i~0 % 256); 26048#L80-1 assume !(1 == mp_add_~i~0 % 256); 26047#L81-1 assume !(2 == mp_add_~i~0 % 256); 26046#L82-1 assume !(3 == mp_add_~i~0 % 256); 26044#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26040#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; 26041#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26038#L65 [2019-01-01 22:09:09,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:09,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 5 times [2019-01-01 22:09:09,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:09,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:09,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:09,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:09,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2060926355, now seen corresponding path program 1 times [2019-01-01 22:09:09,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:09,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:09,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:09:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:09,374 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-01 22:09:09,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:09,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:09:09,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:09,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:10,047 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-01 22:09:10,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:09:10,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-01 22:09:10,079 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:09:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 22:09:10,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-01 22:09:10,080 INFO L87 Difference]: Start difference. First operand 1165 states and 1337 transitions. cyclomatic complexity: 179 Second operand 14 states. [2019-01-01 22:09:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:12,413 INFO L93 Difference]: Finished difference Result 2420 states and 2686 transitions. [2019-01-01 22:09:12,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-01 22:09:12,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2420 states and 2686 transitions. [2019-01-01 22:09:12,422 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1373 [2019-01-01 22:09:12,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2420 states to 2384 states and 2617 transitions. [2019-01-01 22:09:12,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2384 [2019-01-01 22:09:12,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2384 [2019-01-01 22:09:12,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2384 states and 2617 transitions. [2019-01-01 22:09:12,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:12,437 INFO L705 BuchiCegarLoop]: Abstraction has 2384 states and 2617 transitions. [2019-01-01 22:09:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states and 2617 transitions. [2019-01-01 22:09:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1139. [2019-01-01 22:09:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-01-01 22:09:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1312 transitions. [2019-01-01 22:09:12,462 INFO L728 BuchiCegarLoop]: Abstraction has 1139 states and 1312 transitions. [2019-01-01 22:09:12,462 INFO L608 BuchiCegarLoop]: Abstraction has 1139 states and 1312 transitions. [2019-01-01 22:09:12,462 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2019-01-01 22:09:12,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1139 states and 1312 transitions. [2019-01-01 22:09:12,467 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 870 [2019-01-01 22:09:12,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:12,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:12,469 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:12,469 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:12,469 INFO L794 eck$LassoCheckResult]: Stem: 29353#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 29330#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 29332#L42 assume !(0 == mp_add_~a2~0 % 256); 29352#L40-1 mp_add_~nb~0 := 4; 29817#L50 assume !(0 == mp_add_~b3~0 % 256); 29814#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 29812#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; 29813#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29807#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29808#L65-2 assume !(1 == mp_add_~i~0 % 256); 29803#L66-1 assume !(2 == mp_add_~i~0 % 256); 29804#L67-1 assume !(3 == mp_add_~i~0 % 256); 29799#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29800#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 29795#L71-2 assume !(1 == mp_add_~i~0 % 256); 29796#L72-1 assume !(2 == mp_add_~i~0 % 256); 29791#L73-1 assume !(3 == mp_add_~i~0 % 256); 29792#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29787#L76-1 [2019-01-01 22:09:12,469 INFO L796 eck$LassoCheckResult]: Loop: 29787#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 29788#L80-1 assume !(1 == mp_add_~i~0 % 256); 29783#L81-1 assume !(2 == mp_add_~i~0 % 256); 29784#L82-1 assume !(3 == mp_add_~i~0 % 256); 30391#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29777#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; 29778#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29772#L65 assume !(0 == mp_add_~i~0 % 256); 29426#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; 29427#L66-1 assume !(2 == mp_add_~i~0 % 256); 29420#L67-1 assume !(3 == mp_add_~i~0 % 256); 29421#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29414#L71 assume !(0 == mp_add_~i~0 % 256); 29415#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; 29407#L72-1 assume !(2 == mp_add_~i~0 % 256); 29408#L73-1 assume !(3 == mp_add_~i~0 % 256); 29397#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29399#L76-1 assume !(0 == mp_add_~i~0 % 256); 29761#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 29759#L81-1 assume !(2 == mp_add_~i~0 % 256); 29757#L82-1 assume !(3 == mp_add_~i~0 % 256); 29755#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29753#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; 29750#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29747#L65 assume !(0 == mp_add_~i~0 % 256); 29745#L65-2 assume !(1 == mp_add_~i~0 % 256); 29743#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; 29742#L67-1 assume !(3 == mp_add_~i~0 % 256); 29741#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29738#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29737#L76-1 assume !(0 == mp_add_~i~0 % 256); 29736#L80-1 assume !(1 == mp_add_~i~0 % 256); 29735#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 29734#L82-1 assume !(3 == mp_add_~i~0 % 256); 29733#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29732#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; 29731#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29728#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29729#L71 assume !(0 == mp_add_~i~0 % 256); 29895#L71-2 assume !(1 == mp_add_~i~0 % 256); 29893#L72-1 assume !(2 == mp_add_~i~0 % 256); 29891#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; 29889#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29887#L76-1 assume !(0 == mp_add_~i~0 % 256); 29885#L80-1 assume !(1 == mp_add_~i~0 % 256); 29883#L81-1 assume !(2 == mp_add_~i~0 % 256); 29881#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 29876#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29875#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; 29873#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29870#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29868#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29867#L76-1 assume !(0 == mp_add_~i~0 % 256); 29866#L80-1 assume !(1 == mp_add_~i~0 % 256); 29865#L81-1 assume !(2 == mp_add_~i~0 % 256); 29864#L82-1 assume !(3 == mp_add_~i~0 % 256); 29863#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29862#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; 29861#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29829#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29823#L71 assume !(0 == mp_add_~i~0 % 256); 29839#L71-2 assume !(1 == mp_add_~i~0 % 256); 29838#L72-1 assume !(2 == mp_add_~i~0 % 256); 29837#L73-1 assume !(3 == mp_add_~i~0 % 256); 29836#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29835#L76-1 assume !(0 == mp_add_~i~0 % 256); 29834#L80-1 assume !(1 == mp_add_~i~0 % 256); 29833#L81-1 assume !(2 == mp_add_~i~0 % 256); 29832#L82-1 assume !(3 == mp_add_~i~0 % 256); 29831#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29830#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; 29828#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29827#L65 assume !(0 == mp_add_~i~0 % 256); 29826#L65-2 assume !(1 == mp_add_~i~0 % 256); 29825#L66-1 assume !(2 == mp_add_~i~0 % 256); 29824#L67-1 assume !(3 == mp_add_~i~0 % 256); 29822#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29528#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29821#L76-1 assume !(0 == mp_add_~i~0 % 256); 29820#L80-1 assume !(1 == mp_add_~i~0 % 256); 29819#L81-1 assume !(2 == mp_add_~i~0 % 256); 29818#L82-1 assume !(3 == mp_add_~i~0 % 256); 29815#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29816#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; 29809#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29810#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29805#L65-2 assume !(1 == mp_add_~i~0 % 256); 29806#L66-1 assume !(2 == mp_add_~i~0 % 256); 29801#L67-1 assume !(3 == mp_add_~i~0 % 256); 29802#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29797#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 29798#L71-2 assume !(1 == mp_add_~i~0 % 256); 29793#L72-1 assume !(2 == mp_add_~i~0 % 256); 29794#L73-1 assume !(3 == mp_add_~i~0 % 256); 29789#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29787#L76-1 [2019-01-01 22:09:12,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash 149431148, now seen corresponding path program 1 times [2019-01-01 22:09:12,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:12,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:12,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:12,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:12,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:12,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1087474253, now seen corresponding path program 1 times [2019-01-01 22:09:12,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:12,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:12,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 155 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-01 22:09:12,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:12,660 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-01 22:09:12,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:12,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:13,152 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_3 Int) (ULTIMATE.start_mp_add_~nb~0 Int)) (let ((.cse0 (mod ULTIMATE.start_mp_add_~nb~0 256)) (.cse1 (mod v_prenex_3 256))) (and (< (mod c_ULTIMATE.start_mp_add_~i~0 256) .cse0) (<= .cse0 .cse1) (<= .cse1 2)))) is different from true [2019-01-01 22:09:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 160 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-01-01 22:09:13,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:09:13,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-01-01 22:09:13,190 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:09:13,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 22:09:13,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2019-01-01 22:09:13,191 INFO L87 Difference]: Start difference. First operand 1139 states and 1312 transitions. cyclomatic complexity: 181 Second operand 9 states. [2019-01-01 22:09:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:14,217 INFO L93 Difference]: Finished difference Result 1325 states and 1486 transitions. [2019-01-01 22:09:14,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 22:09:14,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1325 states and 1486 transitions. [2019-01-01 22:09:14,223 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 766 [2019-01-01 22:09:14,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1325 states to 1283 states and 1443 transitions. [2019-01-01 22:09:14,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1283 [2019-01-01 22:09:14,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1283 [2019-01-01 22:09:14,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1283 states and 1443 transitions. [2019-01-01 22:09:14,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:14,229 INFO L705 BuchiCegarLoop]: Abstraction has 1283 states and 1443 transitions. [2019-01-01 22:09:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states and 1443 transitions. [2019-01-01 22:09:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1029. [2019-01-01 22:09:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-01-01 22:09:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1178 transitions. [2019-01-01 22:09:14,250 INFO L728 BuchiCegarLoop]: Abstraction has 1029 states and 1178 transitions. [2019-01-01 22:09:14,251 INFO L608 BuchiCegarLoop]: Abstraction has 1029 states and 1178 transitions. [2019-01-01 22:09:14,251 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2019-01-01 22:09:14,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1029 states and 1178 transitions. [2019-01-01 22:09:14,256 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 648 [2019-01-01 22:09:14,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:14,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:14,257 INFO L866 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] [2019-01-01 22:09:14,257 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:14,257 INFO L794 eck$LassoCheckResult]: Stem: 32150#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 32121#L40 assume !(0 == mp_add_~a3~0 % 256); 32122#L40-1 mp_add_~nb~0 := 4; 32143#L50 assume !(0 == mp_add_~b3~0 % 256); 32144#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 32661#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; 32662#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32656#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32657#L65-2 assume !(1 == mp_add_~i~0 % 256); 32652#L66-1 assume !(2 == mp_add_~i~0 % 256); 32653#L67-1 assume !(3 == mp_add_~i~0 % 256); 32648#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32649#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32644#L71-2 assume !(1 == mp_add_~i~0 % 256); 32645#L72-1 assume !(2 == mp_add_~i~0 % 256); 32640#L73-1 assume !(3 == mp_add_~i~0 % 256); 32641#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32965#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 32964#L80-1 assume !(1 == mp_add_~i~0 % 256); 32963#L81-1 assume !(2 == mp_add_~i~0 % 256); 32962#L82-1 assume !(3 == mp_add_~i~0 % 256); 32957#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32956#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; 32611#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32610#L65 [2019-01-01 22:09:14,257 INFO L796 eck$LassoCheckResult]: Loop: 32610#L65 assume !(0 == mp_add_~i~0 % 256); 32609#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; 32554#L66-1 assume !(2 == mp_add_~i~0 % 256); 32608#L67-1 assume !(3 == mp_add_~i~0 % 256); 32607#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32606#L71 assume !(0 == mp_add_~i~0 % 256); 32605#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; 32604#L72-1 assume !(2 == mp_add_~i~0 % 256); 32603#L73-1 assume !(3 == mp_add_~i~0 % 256); 32601#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32597#L76-1 assume !(0 == mp_add_~i~0 % 256); 32598#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 32591#L81-1 assume !(2 == mp_add_~i~0 % 256); 32592#L82-1 assume !(3 == mp_add_~i~0 % 256); 32584#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32585#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; 32564#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32565#L65 assume !(0 == mp_add_~i~0 % 256); 32552#L65-2 assume !(1 == mp_add_~i~0 % 256); 32548#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; 32549#L67-1 assume !(3 == mp_add_~i~0 % 256); 32727#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32726#L71 assume !(0 == mp_add_~i~0 % 256); 32725#L71-2 assume !(1 == mp_add_~i~0 % 256); 32724#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; 32723#L73-1 assume !(3 == mp_add_~i~0 % 256); 32721#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32722#L76-1 assume !(0 == mp_add_~i~0 % 256); 32717#L80-1 assume !(1 == mp_add_~i~0 % 256); 32718#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 32713#L82-1 assume !(3 == mp_add_~i~0 % 256); 32714#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32709#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; 32710#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32706#L65 assume !(0 == mp_add_~i~0 % 256); 32705#L65-2 assume !(1 == mp_add_~i~0 % 256); 32704#L66-1 assume !(2 == mp_add_~i~0 % 256); 32703#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; 32701#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32699#L71 assume !(0 == mp_add_~i~0 % 256); 32697#L71-2 assume !(1 == mp_add_~i~0 % 256); 32695#L72-1 assume !(2 == mp_add_~i~0 % 256); 32693#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; 32690#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32687#L76-1 assume !(0 == mp_add_~i~0 % 256); 32685#L80-1 assume !(1 == mp_add_~i~0 % 256); 32683#L81-1 assume !(2 == mp_add_~i~0 % 256); 32681#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 32679#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32677#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; 32675#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 32672#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32669#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32668#L76-1 assume !(0 == mp_add_~i~0 % 256); 32667#L80-1 assume !(1 == mp_add_~i~0 % 256); 32666#L81-1 assume !(2 == mp_add_~i~0 % 256); 32665#L82-1 assume !(3 == mp_add_~i~0 % 256); 32663#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32664#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; 32658#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32659#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32654#L65-2 assume !(1 == mp_add_~i~0 % 256); 32655#L66-1 assume !(2 == mp_add_~i~0 % 256); 32650#L67-1 assume !(3 == mp_add_~i~0 % 256); 32651#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32646#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32647#L71-2 assume !(1 == mp_add_~i~0 % 256); 32642#L72-1 assume !(2 == mp_add_~i~0 % 256); 32643#L73-1 assume !(3 == mp_add_~i~0 % 256); 32638#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32637#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 32636#L80-1 assume !(1 == mp_add_~i~0 % 256); 32635#L81-1 assume !(2 == mp_add_~i~0 % 256); 32634#L82-1 assume !(3 == mp_add_~i~0 % 256); 32633#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32631#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; 32632#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32610#L65 [2019-01-01 22:09:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 8 times [2019-01-01 22:09:14,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:14,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:14,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:14,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:14,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:14,295 INFO L82 PathProgramCache]: Analyzing trace with hash -872206489, now seen corresponding path program 1 times [2019-01-01 22:09:14,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:14,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:14,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:14,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:09:14,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-01 22:09:14,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:14,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:09:14,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:14,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-01 22:09:14,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:09:14,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-01-01 22:09:14,788 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:09:14,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:09:14,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:09:14,788 INFO L87 Difference]: Start difference. First operand 1029 states and 1178 transitions. cyclomatic complexity: 159 Second operand 8 states. [2019-01-01 22:09:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:16,376 INFO L93 Difference]: Finished difference Result 1463 states and 1626 transitions. [2019-01-01 22:09:16,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 22:09:16,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1463 states and 1626 transitions. [2019-01-01 22:09:16,382 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 853 [2019-01-01 22:09:16,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1463 states to 1381 states and 1516 transitions. [2019-01-01 22:09:16,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1381 [2019-01-01 22:09:16,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1381 [2019-01-01 22:09:16,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1381 states and 1516 transitions. [2019-01-01 22:09:16,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:16,390 INFO L705 BuchiCegarLoop]: Abstraction has 1381 states and 1516 transitions. [2019-01-01 22:09:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states and 1516 transitions. [2019-01-01 22:09:16,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 976. [2019-01-01 22:09:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-01-01 22:09:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1077 transitions. [2019-01-01 22:09:16,406 INFO L728 BuchiCegarLoop]: Abstraction has 976 states and 1077 transitions. [2019-01-01 22:09:16,406 INFO L608 BuchiCegarLoop]: Abstraction has 976 states and 1077 transitions. [2019-01-01 22:09:16,406 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2019-01-01 22:09:16,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 976 states and 1077 transitions. [2019-01-01 22:09:16,412 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 623 [2019-01-01 22:09:16,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:16,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:16,413 INFO L866 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-01 22:09:16,414 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:16,414 INFO L794 eck$LassoCheckResult]: Stem: 34880#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 34873#L40 assume !(0 == mp_add_~a3~0 % 256); 34874#L40-1 mp_add_~nb~0 := 4; 34871#L50 assume !(0 == mp_add_~b3~0 % 256); 34872#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 34944#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; 34945#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34935#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34936#L65-2 assume !(1 == mp_add_~i~0 % 256); 34928#L66-1 assume !(2 == mp_add_~i~0 % 256); 34929#L67-1 assume !(3 == mp_add_~i~0 % 256); 34924#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34925#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 34920#L71-2 assume !(1 == mp_add_~i~0 % 256); 34921#L72-1 assume !(2 == mp_add_~i~0 % 256); 34916#L73-1 assume !(3 == mp_add_~i~0 % 256); 34917#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35413#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 35412#L80-1 assume !(1 == mp_add_~i~0 % 256); 35411#L81-1 assume !(2 == mp_add_~i~0 % 256); 35410#L82-1 assume !(3 == mp_add_~i~0 % 256); 35409#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35408#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; 35407#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34891#L65 assume !(0 == mp_add_~i~0 % 256); 34892#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; 35173#L66-1 [2019-01-01 22:09:16,414 INFO L796 eck$LassoCheckResult]: Loop: 35173#L66-1 assume !(2 == mp_add_~i~0 % 256); 35406#L67-1 assume !(3 == mp_add_~i~0 % 256); 35405#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35404#L71 assume !(0 == mp_add_~i~0 % 256); 35403#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; 35402#L72-1 assume !(2 == mp_add_~i~0 % 256); 35401#L73-1 assume !(3 == mp_add_~i~0 % 256); 35399#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35397#L76-1 assume !(0 == mp_add_~i~0 % 256); 35395#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 35393#L81-1 assume !(2 == mp_add_~i~0 % 256); 35391#L82-1 assume !(3 == mp_add_~i~0 % 256); 35389#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35376#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; 35364#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35362#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35359#L71 assume !(0 == mp_add_~i~0 % 256); 35360#L71-2 assume !(1 == mp_add_~i~0 % 256); 35452#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; 35451#L73-1 assume !(3 == mp_add_~i~0 % 256); 35449#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35448#L76-1 assume !(0 == mp_add_~i~0 % 256); 35447#L80-1 assume !(1 == mp_add_~i~0 % 256); 35446#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 35445#L82-1 assume !(3 == mp_add_~i~0 % 256); 35346#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35347#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; 35332#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35329#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35275#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35302#L76-1 assume !(0 == mp_add_~i~0 % 256); 35298#L80-1 assume !(1 == mp_add_~i~0 % 256); 35292#L81-1 assume !(2 == mp_add_~i~0 % 256); 35268#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 35267#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35266#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; 35265#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35264#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35263#L71 assume !(0 == mp_add_~i~0 % 256); 35245#L71-2 assume !(1 == mp_add_~i~0 % 256); 35246#L72-1 assume !(2 == mp_add_~i~0 % 256); 35230#L73-1 assume !(3 == mp_add_~i~0 % 256); 35231#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35220#L76-1 assume !(0 == mp_add_~i~0 % 256); 35221#L80-1 assume !(1 == mp_add_~i~0 % 256); 35209#L81-1 assume !(2 == mp_add_~i~0 % 256); 35210#L82-1 assume !(3 == mp_add_~i~0 % 256); 35201#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35202#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; 35180#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35178#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35177#L71 assume !(0 == mp_add_~i~0 % 256); 35172#L71-2 assume !(1 == mp_add_~i~0 % 256); 35168#L72-1 assume !(2 == mp_add_~i~0 % 256); 35167#L73-1 assume !(3 == mp_add_~i~0 % 256); 35166#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35165#L76-1 assume !(0 == mp_add_~i~0 % 256); 35164#L80-1 assume !(1 == mp_add_~i~0 % 256); 35162#L81-1 assume !(2 == mp_add_~i~0 % 256); 35163#L82-1 assume !(3 == mp_add_~i~0 % 256); 35158#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35159#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; 35153#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35155#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35643#L71 assume !(0 == mp_add_~i~0 % 256); 35280#L71-2 assume !(1 == mp_add_~i~0 % 256); 35277#L72-1 assume !(2 == mp_add_~i~0 % 256); 35274#L73-1 assume !(3 == mp_add_~i~0 % 256); 35273#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35272#L76-1 assume !(0 == mp_add_~i~0 % 256); 35271#L80-1 assume !(1 == mp_add_~i~0 % 256); 35270#L81-1 assume !(2 == mp_add_~i~0 % 256); 35269#L82-1 assume !(3 == mp_add_~i~0 % 256); 35214#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35133#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; 35134#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35127#L65 assume !(0 == mp_add_~i~0 % 256); 35129#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; 35173#L66-1 [2019-01-01 22:09:16,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:16,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 3 times [2019-01-01 22:09:16,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:16,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:16,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:16,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:16,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1984374623, now seen corresponding path program 1 times [2019-01-01 22:09:16,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:16,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:16,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:09:16,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 139 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-01 22:09:16,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:16,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:09:16,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:16,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:17,735 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 22:09:18,166 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_mp_add_~i~0 Int) (ULTIMATE.start_mp_add_~nb~0 Int)) (let ((.cse0 (mod ULTIMATE.start_mp_add_~i~0 256))) (and (<= (mod c_ULTIMATE.start_mp_add_~na~0 256) .cse0) (<= ULTIMATE.start_mp_add_~nb~0 (+ (* 256 (div ULTIMATE.start_mp_add_~nb~0 256)) 3)) (< .cse0 (mod ULTIMATE.start_mp_add_~nb~0 256)) (not (= 2 .cse0))))) is different from true [2019-01-01 22:09:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 32 not checked. [2019-01-01 22:09:21,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:09:21,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-01-01 22:09:21,901 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:09:21,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 22:09:21,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=4, NotChecked=20, Total=156 [2019-01-01 22:09:21,901 INFO L87 Difference]: Start difference. First operand 976 states and 1077 transitions. cyclomatic complexity: 109 Second operand 13 states. [2019-01-01 22:09:23,195 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 22:09:23,963 WARN L181 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-01 22:09:24,712 WARN L181 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-01-01 22:09:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:24,753 INFO L93 Difference]: Finished difference Result 618 states and 651 transitions. [2019-01-01 22:09:24,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 22:09:24,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 618 states and 651 transitions. [2019-01-01 22:09:24,757 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2019-01-01 22:09:24,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 618 states to 522 states and 553 transitions. [2019-01-01 22:09:24,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2019-01-01 22:09:24,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 522 [2019-01-01 22:09:24,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 553 transitions. [2019-01-01 22:09:24,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:24,760 INFO L705 BuchiCegarLoop]: Abstraction has 522 states and 553 transitions. [2019-01-01 22:09:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 553 transitions. [2019-01-01 22:09:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 472. [2019-01-01 22:09:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-01-01 22:09:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 502 transitions. [2019-01-01 22:09:24,767 INFO L728 BuchiCegarLoop]: Abstraction has 472 states and 502 transitions. [2019-01-01 22:09:24,767 INFO L608 BuchiCegarLoop]: Abstraction has 472 states and 502 transitions. [2019-01-01 22:09:24,767 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2019-01-01 22:09:24,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 472 states and 502 transitions. [2019-01-01 22:09:24,768 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2019-01-01 22:09:24,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:24,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:24,769 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 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-01 22:09:24,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:24,770 INFO L794 eck$LassoCheckResult]: Stem: 36731#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 36724#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 36726#L42 assume !(0 == mp_add_~a2~0 % 256); 36716#L40-1 mp_add_~nb~0 := 4; 36717#L50 assume !(0 == mp_add_~b3~0 % 256); 36784#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 36785#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; 36780#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36781#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 36776#L65-2 assume !(1 == mp_add_~i~0 % 256); 36777#L66-1 assume !(2 == mp_add_~i~0 % 256); 36772#L67-1 assume !(3 == mp_add_~i~0 % 256); 36773#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36768#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 36769#L71-2 assume !(1 == mp_add_~i~0 % 256); 36764#L72-1 assume !(2 == mp_add_~i~0 % 256); 36765#L73-1 assume !(3 == mp_add_~i~0 % 256); 36759#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 36761#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 36755#L80-1 assume !(1 == mp_add_~i~0 % 256); 36756#L81-1 assume !(2 == mp_add_~i~0 % 256); 36751#L82-1 assume !(3 == mp_add_~i~0 % 256); 36752#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36747#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; 36748#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37111#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37109#L71 assume !(0 == mp_add_~i~0 % 256); 37107#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; 37105#L72-1 assume !(2 == mp_add_~i~0 % 256); 37103#L73-1 assume !(3 == mp_add_~i~0 % 256); 37100#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37098#L76-1 assume !(0 == mp_add_~i~0 % 256); 37097#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 37096#L81-1 assume !(2 == mp_add_~i~0 % 256); 37095#L82-1 assume !(3 == mp_add_~i~0 % 256); 37094#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37093#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; 37091#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37092#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37169#L71 assume !(0 == mp_add_~i~0 % 256); 37167#L71-2 assume !(1 == mp_add_~i~0 % 256); 37165#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; 37163#L73-1 assume !(3 == mp_add_~i~0 % 256); 37158#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37157#L76-1 assume !(0 == mp_add_~i~0 % 256); 37156#L80-1 assume !(1 == mp_add_~i~0 % 256); 37155#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 37154#L82-1 assume !(3 == mp_add_~i~0 % 256); 37153#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37152#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; 37151#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37149#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37148#L71 assume !(0 == mp_add_~i~0 % 256); 37145#L71-2 assume !(1 == mp_add_~i~0 % 256); 37144#L72-1 assume !(2 == mp_add_~i~0 % 256); 37142#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; 37140#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37139#L76-1 assume !(0 == mp_add_~i~0 % 256); 37138#L80-1 assume !(1 == mp_add_~i~0 % 256); 37137#L81-1 assume !(2 == mp_add_~i~0 % 256); 37136#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 36715#L83-1 [2019-01-01 22:09:24,770 INFO L796 eck$LassoCheckResult]: Loop: 36715#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37161#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; 37159#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37150#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37147#L71 assume !(0 == mp_add_~i~0 % 256); 37146#L71-2 assume !(1 == mp_add_~i~0 % 256); 36719#L72-1 assume !(2 == mp_add_~i~0 % 256); 36720#L73-1 assume !(3 == mp_add_~i~0 % 256); 36711#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36712#L76-1 assume !(0 == mp_add_~i~0 % 256); 36704#L80-1 assume !(1 == mp_add_~i~0 % 256); 36705#L81-1 assume !(2 == mp_add_~i~0 % 256); 36708#L82-1 assume !(3 == mp_add_~i~0 % 256); 36715#L83-1 [2019-01-01 22:09:24,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash -959140882, now seen corresponding path program 1 times [2019-01-01 22:09:24,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:24,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:24,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-01 22:09:25,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:25,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:09:25,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:25,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-01 22:09:25,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:09:25,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-01-01 22:09:25,461 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:09:25,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:25,461 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 1 times [2019-01-01 22:09:25,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:25,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:25,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:25,677 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-01 22:09:25,704 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:25,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:25,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:25,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:25,705 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:25,705 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:25,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:25,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:25,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2019-01-01 22:09:25,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:25,706 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:25,707 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-01 22:09:25,718 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-01 22:09:25,929 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-01 22:09:26,057 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-01 22:09:26,059 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:26,059 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:26,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:26,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:26,074 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:09:26,074 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:26,097 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:26,097 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:09:26,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:26,221 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:38,233 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 22:09:38,236 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:38,236 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:38,236 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:38,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:38,237 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:38,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:38,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:38,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:38,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2019-01-01 22:09:38,237 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:38,237 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:38,238 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-01 22:09:38,253 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-01 22:09:38,497 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-01 22:09:38,558 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:38,558 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:38,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:38,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:38,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:38,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:38,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:38,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:38,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:38,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:38,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,574 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:09:38,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:38,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:38,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,577 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:09:38,577 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:09:38,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:38,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:38,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,579 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:09:38,583 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:09:38,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,586 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:09:38,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:38,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:38,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,592 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:38,593 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:38,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:38,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:38,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,595 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:38,596 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:38,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,606 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:09:38,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:38,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:38,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,611 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:09:38,611 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:09:38,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,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-01 22:09:38,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:38,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,613 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:09:38,616 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:09:38,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,623 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:09:38,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:38,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:38,623 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:09:38,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,627 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:09:38,628 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:09:38,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,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-01 22:09:38,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:38,633 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:09:38,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,633 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:09:38,637 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:09:38,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,649 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:09:38,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-01 22:09:38,650 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:38,650 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:09:38,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,653 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:38,654 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:38,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,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-01 22:09:38,659 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:38,660 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:09:38,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,660 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:38,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:38,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,687 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:09:38,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:38,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:38,688 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:09:38,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,692 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:09:38,694 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:09:38,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:38,699 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:38,699 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:09:38,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,700 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:09:38,702 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:09:38,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,739 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:09:38,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:38,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:38,742 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:09:38,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,743 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:38,744 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:38,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:38,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:38,754 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:09:38,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,754 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:38,755 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:38,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,769 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:09:38,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:38,773 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:38,773 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:09:38,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,774 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:09:38,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:09:38,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:38,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:38,787 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:09:38,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:38,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:38,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:38,787 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:09:38,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:09:38,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:38,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:38,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 22:09:38,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-01 22:09:38,817 INFO L87 Difference]: Start difference. First operand 472 states and 502 transitions. cyclomatic complexity: 34 Second operand 12 states. [2019-01-01 22:09:39,404 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-01 22:09:39,592 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-01-01 22:09:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:40,484 INFO L93 Difference]: Finished difference Result 580 states and 608 transitions. [2019-01-01 22:09:40,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 22:09:40,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 608 transitions. [2019-01-01 22:09:40,489 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 123 [2019-01-01 22:09:40,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 561 states and 589 transitions. [2019-01-01 22:09:40,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2019-01-01 22:09:40,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 561 [2019-01-01 22:09:40,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 589 transitions. [2019-01-01 22:09:40,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:40,495 INFO L705 BuchiCegarLoop]: Abstraction has 561 states and 589 transitions. [2019-01-01 22:09:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 589 transitions. [2019-01-01 22:09:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 425. [2019-01-01 22:09:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-01-01 22:09:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 449 transitions. [2019-01-01 22:09:40,503 INFO L728 BuchiCegarLoop]: Abstraction has 425 states and 449 transitions. [2019-01-01 22:09:40,504 INFO L608 BuchiCegarLoop]: Abstraction has 425 states and 449 transitions. [2019-01-01 22:09:40,504 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2019-01-01 22:09:40,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 425 states and 449 transitions. [2019-01-01 22:09:40,510 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2019-01-01 22:09:40,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:40,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:40,511 INFO L866 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-01 22:09:40,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:40,511 INFO L794 eck$LassoCheckResult]: Stem: 37986#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 37978#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37980#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37984#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37991#L40-1 mp_add_~nb~0 := 4; 38030#L50 assume !(0 == mp_add_~b3~0 % 256); 37969#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 37970#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; 38100#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 38098#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 38099#L65-2 assume !(1 == mp_add_~i~0 % 256); 37989#L66-1 assume !(2 == mp_add_~i~0 % 256); 37990#L67-1 assume !(3 == mp_add_~i~0 % 256); 37983#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37972#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 37961#L71-2 assume !(1 == mp_add_~i~0 % 256); 37962#L72-1 assume !(2 == mp_add_~i~0 % 256); 37971#L73-1 assume !(3 == mp_add_~i~0 % 256); 38361#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 38360#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 38359#L80-1 assume !(1 == mp_add_~i~0 % 256); 38358#L81-1 assume !(2 == mp_add_~i~0 % 256); 38357#L82-1 assume !(3 == mp_add_~i~0 % 256); 38352#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38350#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; 38347#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38345#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38343#L71 assume !(0 == mp_add_~i~0 % 256); 38341#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; 38339#L72-1 assume !(2 == mp_add_~i~0 % 256); 38337#L73-1 assume !(3 == mp_add_~i~0 % 256); 38335#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 38333#L76-1 assume !(0 == mp_add_~i~0 % 256); 38331#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 38329#L81-1 assume !(2 == mp_add_~i~0 % 256); 38327#L82-1 assume !(3 == mp_add_~i~0 % 256); 38325#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38323#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; 38321#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38319#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38317#L71 assume !(0 == mp_add_~i~0 % 256); 38315#L71-2 assume !(1 == mp_add_~i~0 % 256); 38313#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; 38311#L73-1 assume !(3 == mp_add_~i~0 % 256); 38308#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 38307#L76-1 assume !(0 == mp_add_~i~0 % 256); 38306#L80-1 assume !(1 == mp_add_~i~0 % 256); 38305#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 38304#L82-1 assume !(3 == mp_add_~i~0 % 256); 38303#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38302#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; 38301#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38300#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38299#L71 assume !(0 == mp_add_~i~0 % 256); 38298#L71-2 assume !(1 == mp_add_~i~0 % 256); 38297#L72-1 assume !(2 == mp_add_~i~0 % 256); 38295#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; 38296#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 38371#L76-1 assume !(0 == mp_add_~i~0 % 256); 38369#L80-1 assume !(1 == mp_add_~i~0 % 256); 38367#L81-1 assume !(2 == mp_add_~i~0 % 256); 38365#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 37968#L83-1 [2019-01-01 22:09:40,513 INFO L796 eck$LassoCheckResult]: Loop: 37968#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37964#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; 37965#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37985#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38370#L71 assume !(0 == mp_add_~i~0 % 256); 38368#L71-2 assume !(1 == mp_add_~i~0 % 256); 38366#L72-1 assume !(2 == mp_add_~i~0 % 256); 37977#L73-1 assume !(3 == mp_add_~i~0 % 256); 37966#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37967#L76-1 assume !(0 == mp_add_~i~0 % 256); 37959#L80-1 assume !(1 == mp_add_~i~0 % 256); 37960#L81-1 assume !(2 == mp_add_~i~0 % 256); 37963#L82-1 assume !(3 == mp_add_~i~0 % 256); 37968#L83-1 [2019-01-01 22:09:40,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:40,513 INFO L82 PathProgramCache]: Analyzing trace with hash 773605064, now seen corresponding path program 1 times [2019-01-01 22:09:40,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:40,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:40,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 2 times [2019-01-01 22:09:40,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:40,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:40,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:40,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:40,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:40,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash -600207712, now seen corresponding path program 2 times [2019-01-01 22:09:40,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:40,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:40,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:40,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:09:40,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:41,160 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-01 22:09:41,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:41,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:09:41,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:09:41,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 22:09:41,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:09:41,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-01 22:09:41,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:09:41,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-01-01 22:09:41,416 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:41,417 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:41,417 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:41,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:41,417 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:41,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:41,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:41,418 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:41,418 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2019-01-01 22:09:41,418 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:41,418 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:41,419 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-01 22:09:41,443 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-01 22:09:41,556 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-01 22:09:41,650 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:41,651 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:41,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:41,701 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:09:41,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:41,755 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:50,003 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:50,005 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:50,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:50,006 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:50,006 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:50,006 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:50,006 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:50,006 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:50,006 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:50,006 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2019-01-01 22:09:50,006 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:50,006 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:50,008 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-01 22:09:50,045 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-01 22:09:50,232 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-01 22:09:50,327 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:50,327 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:50,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:50,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:50,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:50,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:50,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:50,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:50,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:50,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,344 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:09:50,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:50,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,345 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:09:50,347 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:09:50,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:50,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,352 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:09:50,352 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:09:50,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,353 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:09:50,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:50,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,364 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:50,365 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:50,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:50,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:50,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:50,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,377 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:09:50,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:50,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:50,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,384 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:09:50,385 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:09:50,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:50,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,400 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:09:50,400 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:09:50,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,407 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:09:50,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,408 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:50,408 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:09:50,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,408 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:09:50,414 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:09:50,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:50,428 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:09:50,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,428 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:09:50,429 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:09:50,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,435 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:09:50,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,436 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:50,436 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:09:50,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,436 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:50,440 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:50,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:50,457 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:09:50,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,458 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:50,459 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:50,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,464 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:09:50,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:50,465 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:09:50,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,465 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:09:50,471 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:09:50,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,482 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:50,482 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:09:50,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,483 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:09:50,484 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:09:50,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,486 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:09:50,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,486 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:50,486 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:09:50,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,487 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:50,488 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:50,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:50,495 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:09:50,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,495 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:09:50,496 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:09:50,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,498 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:09:50,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,499 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:50,499 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:09:50,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,500 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:09:50,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:09:50,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:09:50,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:09:50,512 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:09:50,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:50,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:50,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:50,512 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:09:50,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:09:50,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:50,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 22:09:50,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-01 22:09:50,518 INFO L87 Difference]: Start difference. First operand 425 states and 449 transitions. cyclomatic complexity: 28 Second operand 16 states. [2019-01-01 22:09:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:51,515 INFO L93 Difference]: Finished difference Result 349 states and 366 transitions. [2019-01-01 22:09:51,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 22:09:51,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 366 transitions. [2019-01-01 22:09:51,520 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:09:51,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 0 states and 0 transitions. [2019-01-01 22:09:51,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:09:51,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:09:51,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:09:51,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:51,521 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:51,521 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:51,521 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:51,521 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2019-01-01 22:09:51,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:09:51,521 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:09:51,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:09:51,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:09:51 BoogieIcfgContainer [2019-01-01 22:09:51,530 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:09:51,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:09:51,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:09:51,530 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:09:51,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:07:42" (3/4) ... [2019-01-01 22:09:51,535 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:09:51,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:09:51,536 INFO L168 Benchmark]: Toolchain (without parser) took 130712.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 379.6 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -248.9 MB). Peak memory consumption was 130.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:51,537 INFO L168 Benchmark]: CDTParser took 0.15 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-01 22:09:51,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.51 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:51,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:51,539 INFO L168 Benchmark]: Boogie Preprocessor took 36.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:51,540 INFO L168 Benchmark]: RCFGBuilder took 685.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:51,540 INFO L168 Benchmark]: BuchiAutomizer took 129402.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.1 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:51,541 INFO L168 Benchmark]: Witness Printer took 5.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:09:51,545 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 454.51 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 123.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 685.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 129402.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.1 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 25 terminating modules (25 trivial, 0 deterministic, 0 nondeterministic). 25 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 129.3s and 26 iterations. TraceHistogramMax:7. Analysis of lassos took 63.5s. Construction of modules took 51.3s. Büchi inclusion checks took 13.4s. Highest rank in rank-based complementation 0. Minimization of det autom 25. Minimization of nondet autom 0. Automata minimization 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 5810 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 1675 states and ocurred in iteration 18. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1042 SDtfs, 4979 SDslu, 2052 SDs, 0 SdLazy, 9077 SolverSat, 816 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 51.3s Time LassoAnalysisResults: nont0 unkn0 SFLI15 SFLT0 conc4 concLT0 SILN0 SILU2 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf98 lsp64 ukn100 mio100 lsp100 div580 bol100 ite100 ukn100 eq143 hnf42 smp84 dnf100 smp100 tf102 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 29ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 36.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...