./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c -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 45b185c6c694406b0734db5727dff1b8fd93ebcf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:50:51,767 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:50:51,769 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:50:51,780 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:50:51,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:50:51,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:50:51,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:50:51,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:50:51,787 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:50:51,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:50:51,788 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:50:51,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:50:51,790 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:50:51,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:50:51,792 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:50:51,792 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:50:51,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:50:51,795 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:50:51,797 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:50:51,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:50:51,800 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:50:51,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:50:51,804 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:50:51,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:50:51,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:50:51,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:50:51,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:50:51,807 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:50:51,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:50:51,809 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:50:51,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:50:51,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:50:51,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:50:51,811 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:50:51,812 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:50:51,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:50:51,813 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:50:51,830 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:50:51,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:50:51,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:50:51,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:50:51,832 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:50:51,832 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:50:51,832 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:50:51,832 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:50:51,832 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:50:51,833 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:50:51,833 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:50:51,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:50:51,833 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:50:51,833 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:50:51,834 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:50:51,834 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:50:51,834 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:50:51,834 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:50:51,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:50:51,834 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:50:51,835 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:50:51,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:50:51,835 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:50:51,835 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:50:51,835 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:50:51,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:50:51,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:50:51,836 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:50:51,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:50:51,836 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:50:51,836 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:50:51,837 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:50:51,837 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 -> 45b185c6c694406b0734db5727dff1b8fd93ebcf [2019-01-14 02:50:51,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:50:51,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:50:51,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:50:51,900 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:50:51,901 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:50:51,901 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-14 02:50:51,961 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628330d90/fbd27611fe854abc87d1d7d00320241d/FLAG772f49040 [2019-01-14 02:50:52,429 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:50:52,429 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-14 02:50:52,438 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628330d90/fbd27611fe854abc87d1d7d00320241d/FLAG772f49040 [2019-01-14 02:50:52,796 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628330d90/fbd27611fe854abc87d1d7d00320241d [2019-01-14 02:50:52,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:50:52,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:50:52,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:50:52,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:50:52,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:50:52,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:50:52" (1/1) ... [2019-01-14 02:50:52,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d680728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:52, skipping insertion in model container [2019-01-14 02:50:52,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:50:52" (1/1) ... [2019-01-14 02:50:52,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:50:52,860 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:50:53,197 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:50:53,208 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:50:53,256 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:50:53,282 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:50:53,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53 WrapperNode [2019-01-14 02:50:53,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:50:53,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:50:53,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:50:53,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:50:53,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (1/1) ... [2019-01-14 02:50:53,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (1/1) ... [2019-01-14 02:50:53,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:50:53,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:50:53,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:50:53,405 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:50:53,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (1/1) ... [2019-01-14 02:50:53,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (1/1) ... [2019-01-14 02:50:53,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (1/1) ... [2019-01-14 02:50:53,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (1/1) ... [2019-01-14 02:50:53,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (1/1) ... [2019-01-14 02:50:53,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (1/1) ... [2019-01-14 02:50:53,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (1/1) ... [2019-01-14 02:50:53,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:50:53,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:50:53,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:50:53,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:50:53,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:50:53,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:50:54,370 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:50:54,370 INFO L286 CfgBuilder]: Removed 24 assue(true) statements. [2019-01-14 02:50:54,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:54 BoogieIcfgContainer [2019-01-14 02:50:54,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:50:54,373 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:50:54,373 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:50:54,377 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:50:54,378 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:54,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:50:52" (1/3) ... [2019-01-14 02:50:54,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5af8fa6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:50:54, skipping insertion in model container [2019-01-14 02:50:54,379 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:54,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:53" (2/3) ... [2019-01-14 02:50:54,380 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5af8fa6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:50:54, skipping insertion in model container [2019-01-14 02:50:54,380 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:54,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:54" (3/3) ... [2019-01-14 02:50:54,382 INFO L375 chiAutomizerObserver]: Analyzing ICFG soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-14 02:50:54,442 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:50:54,443 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:50:54,443 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:50:54,444 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:50:54,444 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:50:54,444 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:50:54,444 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:50:54,444 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:50:54,444 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:50:54,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-01-14 02:50:54,493 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-01-14 02:50:54,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:54,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:54,505 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:50:54,505 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:54,505 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:50:54,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-01-14 02:50:54,516 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-01-14 02:50:54,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:54,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:54,519 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:50:54,519 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:54,529 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 30#L19true assume !(0 == base2flt_~m % 4294967296); 17#L25true assume !(base2flt_~m % 4294967296 < 16777216); 13#L47-2true [2019-01-14 02:50:54,529 INFO L796 eck$LassoCheckResult]: Loop: 13#L47-2true assume !false; 22#L48true assume base2flt_~m % 4294967296 >= 33554432; 47#L49true assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 13#L47-2true [2019-01-14 02:50:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:54,536 INFO L82 PathProgramCache]: Analyzing trace with hash 30973, now seen corresponding path program 1 times [2019-01-14 02:50:54,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:54,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:54,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:54,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:54,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:54,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:54,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 02:50:54,703 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:54,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash 73619, now seen corresponding path program 1 times [2019-01-14 02:50:54,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:54,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:54,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:54,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:54,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:54,824 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:54,826 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:54,828 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:54,828 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:54,829 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:54,829 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:54,829 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:54,829 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:54,829 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-14 02:50:54,829 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:54,831 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:54,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:54,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:55,137 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:55,138 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:55,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:55,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:55,184 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:50:55,184 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m=-1} Honda state: {ULTIMATE.start_base2flt_~m=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:55,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:55,205 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:55,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:55,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:55,266 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:55,268 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:55,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:55,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:55,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:55,269 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:55,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:55,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:55,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:55,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-14 02:50:55,270 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:55,270 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:55,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:55,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:55,444 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:55,450 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:55,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:55,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:55,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:55,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:55,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:55,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:55,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:55,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:55,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:55,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:55,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:55,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:55,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:55,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:55,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:55,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:55,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:55,477 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:55,481 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:50:55,482 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:50:55,484 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:55,484 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:50:55,484 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:55,485 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-14 02:50:55,486 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:50:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:55,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:55,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:55,635 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:50:55,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states. Second operand 3 states. [2019-01-14 02:50:55,809 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states.. Second operand 3 states. Result 203 states and 343 transitions. Complement of second has 6 states. [2019-01-14 02:50:55,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:50:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 227 transitions. [2019-01-14 02:50:55,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-14 02:50:55,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:55,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:50:55,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:55,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:50:55,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:55,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 343 transitions. [2019-01-14 02:50:55,828 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2019-01-14 02:50:55,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 78 states and 119 transitions. [2019-01-14 02:50:55,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-01-14 02:50:55,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-01-14 02:50:55,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 119 transitions. [2019-01-14 02:50:55,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:55,839 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 119 transitions. [2019-01-14 02:50:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 119 transitions. [2019-01-14 02:50:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-01-14 02:50:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 02:50:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2019-01-14 02:50:55,871 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 107 transitions. [2019-01-14 02:50:55,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:55,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:55,875 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand 3 states. [2019-01-14 02:50:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:55,986 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2019-01-14 02:50:55,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:55,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-01-14 02:50:55,989 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-14 02:50:55,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 47 transitions. [2019-01-14 02:50:55,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-14 02:50:55,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-14 02:50:55,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 47 transitions. [2019-01-14 02:50:55,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:55,993 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-01-14 02:50:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 47 transitions. [2019-01-14 02:50:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-14 02:50:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 02:50:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-01-14 02:50:55,997 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-01-14 02:50:55,997 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-01-14 02:50:55,997 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:50:55,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 47 transitions. [2019-01-14 02:50:55,998 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-14 02:50:55,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:56,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:56,000 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:50:56,000 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:56,001 INFO L794 eck$LassoCheckResult]: Stem: 447#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 445#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 418#L69 base2flt_#res := base2flt_~__retres4~0; 419#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 442#L19-1 assume !(0 == base2flt_~m % 4294967296); 430#L25-1 assume !(base2flt_~m % 4294967296 < 16777216); 422#L47-5 [2019-01-14 02:50:56,001 INFO L796 eck$LassoCheckResult]: Loop: 422#L47-5 assume !false; 425#L48-1 assume base2flt_~m % 4294967296 >= 33554432; 420#L49-1 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 422#L47-5 [2019-01-14 02:50:56,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:56,002 INFO L82 PathProgramCache]: Analyzing trace with hash 921737699, now seen corresponding path program 1 times [2019-01-14 02:50:56,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:56,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:56,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:56,200 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-14 02:50:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:56,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:56,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:50:56,251 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:56,253 INFO L82 PathProgramCache]: Analyzing trace with hash 136178, now seen corresponding path program 1 times [2019-01-14 02:50:56,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:56,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:56,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:56,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:56,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:56,392 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:50:56,519 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:50:56,529 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:56,529 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:56,529 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:56,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:56,530 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:56,530 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:56,530 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:56,530 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:56,530 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-14 02:50:56,530 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:56,531 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:56,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:56,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:56,727 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:56,727 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:56,732 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:56,732 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:56,762 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:50:56,762 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m=-1} Honda state: {ULTIMATE.start_base2flt_~m=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-14 02:50:56,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:56,783 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:56,807 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:56,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:56,838 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:56,840 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:56,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:56,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:56,841 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:56,841 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:56,841 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:56,841 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:56,842 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:56,842 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-14 02:50:56,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:56,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:56,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:56,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:57,006 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-14 02:50:57,061 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:57,062 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:57,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:57,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:57,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:57,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:57,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:57,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:57,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:57,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:57,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:57,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:57,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:57,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:57,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:57,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:57,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:57,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:57,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:57,088 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:57,091 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:50:57,092 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:50:57,092 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:57,092 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:50:57,092 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:57,093 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-14 02:50:57,094 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:50:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:57,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:57,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:57,142 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:50:57,142 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 47 transitions. cyclomatic complexity: 19 Second operand 3 states. [2019-01-14 02:50:57,227 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 47 transitions. cyclomatic complexity: 19. Second operand 3 states. Result 62 states and 84 transitions. Complement of second has 5 states. [2019-01-14 02:50:57,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:50:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2019-01-14 02:50:57,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:50:57,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:57,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:50:57,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:57,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:50:57,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:57,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 84 transitions. [2019-01-14 02:50:57,234 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2019-01-14 02:50:57,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 59 states and 80 transitions. [2019-01-14 02:50:57,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-01-14 02:50:57,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-01-14 02:50:57,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 80 transitions. [2019-01-14 02:50:57,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:57,236 INFO L706 BuchiCegarLoop]: Abstraction has 59 states and 80 transitions. [2019-01-14 02:50:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 80 transitions. [2019-01-14 02:50:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-01-14 02:50:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 02:50:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-01-14 02:50:57,240 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-01-14 02:50:57,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:57,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:57,241 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2019-01-14 02:50:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:57,339 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-01-14 02:50:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:57,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2019-01-14 02:50:57,340 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-14 02:50:57,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 46 transitions. [2019-01-14 02:50:57,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-14 02:50:57,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-14 02:50:57,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. [2019-01-14 02:50:57,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:57,342 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-14 02:50:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. [2019-01-14 02:50:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-01-14 02:50:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 02:50:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-01-14 02:50:57,347 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-01-14 02:50:57,347 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-01-14 02:50:57,347 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:50:57,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2019-01-14 02:50:57,348 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-14 02:50:57,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:57,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:57,350 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:50:57,350 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:57,350 INFO L794 eck$LassoCheckResult]: Stem: 658#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 655#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 632#L69 base2flt_#res := base2flt_~__retres4~0; 633#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 652#L19-1 assume !(0 == base2flt_~m % 4294967296); 640#L25-1 assume base2flt_~m % 4294967296 < 16777216; 641#L37-3 [2019-01-14 02:50:57,351 INFO L796 eck$LassoCheckResult]: Loop: 641#L37-3 assume !false; 650#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 651#L37-2 assume base2flt_~m % 4294967296 < 16777216; 641#L37-3 [2019-01-14 02:50:57,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:57,351 INFO L82 PathProgramCache]: Analyzing trace with hash 921737673, now seen corresponding path program 1 times [2019-01-14 02:50:57,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:57,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:57,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:57,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:57,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash 110419, now seen corresponding path program 1 times [2019-01-14 02:50:57,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:57,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:57,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:57,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1761173643, now seen corresponding path program 1 times [2019-01-14 02:50:57,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:57,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:57,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:57,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:57,435 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:57,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:57,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:57,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:57,435 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:57,436 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:57,436 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:57,436 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:57,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-14 02:50:57,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:57,436 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:57,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:57,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:57,573 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 02:50:57,606 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:57,607 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:57,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:57,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:57,622 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:50:57,622 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m=0} Honda state: {ULTIMATE.start_base2flt_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:57,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:57,642 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:57,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:57,665 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:57,686 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:57,688 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:57,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:57,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:57,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:57,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:57,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:57,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:57,689 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:57,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-14 02:50:57,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:57,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:57,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:57,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:57,794 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:57,795 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:57,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:57,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:57,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:57,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:57,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:57,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:57,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:57,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:57,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:57,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:57,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:57,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:57,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:57,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:57,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:57,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:57,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:57,812 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:57,815 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:50:57,815 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:50:57,816 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:57,816 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:50:57,816 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:57,816 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-01-14 02:50:57,816 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:50:57,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:57,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:57,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:57,925 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:50:57,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-14 02:50:57,965 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 59 states and 78 transitions. Complement of second has 5 states. [2019-01-14 02:50:57,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:50:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-01-14 02:50:57,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:50:57,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:57,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:50:57,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:57,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:50:57,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:57,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2019-01-14 02:50:57,970 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-01-14 02:50:57,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 74 transitions. [2019-01-14 02:50:57,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-01-14 02:50:57,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-14 02:50:57,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2019-01-14 02:50:57,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:57,973 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2019-01-14 02:50:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2019-01-14 02:50:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2019-01-14 02:50:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 02:50:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-01-14 02:50:57,977 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-14 02:50:57,977 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-14 02:50:57,978 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:50:57,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-01-14 02:50:57,978 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-14 02:50:57,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:57,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:57,979 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:57,979 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:57,979 INFO L794 eck$LassoCheckResult]: Stem: 797#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 794#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 770#L69 base2flt_#res := base2flt_~__retres4~0; 771#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 791#L19-1 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 782#L69-1 base2flt_#res := base2flt_~__retres4~0; 783#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 786#L19-2 assume !(0 == base2flt_~m % 4294967296); 776#L25-2 assume !(base2flt_~m % 4294967296 < 16777216); 769#L47-8 [2019-01-14 02:50:57,979 INFO L796 eck$LassoCheckResult]: Loop: 769#L47-8 assume !false; 792#L48-2 assume base2flt_~m % 4294967296 >= 33554432; 767#L49-2 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 769#L47-8 [2019-01-14 02:50:57,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:57,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1760951196, now seen corresponding path program 1 times [2019-01-14 02:50:57,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:57,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:57,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:57,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:57,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:58,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:58,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:50:58,049 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:58,049 INFO L82 PathProgramCache]: Analyzing trace with hash 198737, now seen corresponding path program 1 times [2019-01-14 02:50:58,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:58,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:58,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:58,100 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:58,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:58,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:58,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:58,101 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:58,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:58,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:58,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:58,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-14 02:50:58,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:58,101 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:58,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:58,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:58,294 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:58,294 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-14 02:50:58,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:58,301 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-14 02:50:58,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:58,325 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:58,348 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:58,351 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:58,351 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:58,351 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:58,351 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:58,352 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:58,352 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:58,352 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:58,352 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:58,352 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-14 02:50:58,352 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:58,352 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:58,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:58,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:58,489 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:58,490 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:58,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-14 02:50:58,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:58,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:58,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:58,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:58,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:58,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:58,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:58,496 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:58,499 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:50:58,500 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:50:58,500 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:58,501 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:50:58,501 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:58,501 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-14 02:50:58,501 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:50:58,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:58,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:58,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:58,645 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:50:58,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-14 02:50:58,672 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 51 states and 65 transitions. Complement of second has 5 states. [2019-01-14 02:50:58,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:50:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-01-14 02:50:58,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:50:58,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:58,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 02:50:58,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:58,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:50:58,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:58,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2019-01-14 02:50:58,679 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-14 02:50:58,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 48 states and 61 transitions. [2019-01-14 02:50:58,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-14 02:50:58,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-14 02:50:58,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2019-01-14 02:50:58,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:58,680 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-01-14 02:50:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2019-01-14 02:50:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-01-14 02:50:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 02:50:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2019-01-14 02:50:58,685 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2019-01-14 02:50:58,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:58,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:58,686 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 3 states. [2019-01-14 02:50:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:58,783 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-01-14 02:50:58,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:58,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2019-01-14 02:50:58,786 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-14 02:50:58,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 52 transitions. [2019-01-14 02:50:58,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-14 02:50:58,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-14 02:50:58,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2019-01-14 02:50:58,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:58,789 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-01-14 02:50:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2019-01-14 02:50:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-01-14 02:50:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 02:50:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-01-14 02:50:58,794 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-01-14 02:50:58,795 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-01-14 02:50:58,795 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:50:58,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-01-14 02:50:58,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-14 02:50:58,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:58,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:58,798 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:58,798 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:58,798 INFO L794 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1015#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 989#L69 base2flt_#res := base2flt_~__retres4~0; 990#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1011#L19-1 assume !(0 == base2flt_~m % 4294967296); 998#L25-1 assume base2flt_~m % 4294967296 < 16777216; 999#L37-3 assume !false; 1008#L28-1 assume base2flt_~e <= -128;base2flt_~__retres4~0 := 0; 1002#L69-1 base2flt_#res := base2flt_~__retres4~0; 1003#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1006#L19-2 assume !(0 == base2flt_~m % 4294967296); 995#L25-2 assume base2flt_~m % 4294967296 < 16777216; 997#L37-5 [2019-01-14 02:50:58,798 INFO L796 eck$LassoCheckResult]: Loop: 997#L37-5 assume !false; 1004#L28-2 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1005#L37-4 assume base2flt_~m % 4294967296 < 16777216; 997#L37-5 [2019-01-14 02:50:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash -197167406, now seen corresponding path program 1 times [2019-01-14 02:50:58,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:58,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:58,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:58,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:58,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:58,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:58,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:58,862 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:58,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:58,863 INFO L82 PathProgramCache]: Analyzing trace with hash 172978, now seen corresponding path program 1 times [2019-01-14 02:50:58,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:58,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:58,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:58,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:58,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:58,910 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:58,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:58,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:58,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:58,911 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:58,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:58,911 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:58,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:58,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-14 02:50:58,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:58,912 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:58,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:58,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:59,021 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:59,021 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:59,032 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:59,032 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:59,051 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:50:59,051 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m=0} Honda state: {ULTIMATE.start_base2flt_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:50:59,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:59,083 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:59,106 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:59,106 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:59,128 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:59,130 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:59,130 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:59,130 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:59,130 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:59,130 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:59,130 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:59,130 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:59,130 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:59,131 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-14 02:50:59,131 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:59,131 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:59,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:59,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:59,233 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:59,233 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:59,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:59,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:59,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:59,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:59,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:59,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:59,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:59,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:59,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:59,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:59,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:59,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:59,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:59,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:59,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:59,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:59,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:59,242 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:59,244 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:50:59,245 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:50:59,245 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:59,245 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:50:59,245 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:59,245 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-01-14 02:50:59,246 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:50:59,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:59,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:59,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:59,445 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:50:59,445 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-14 02:50:59,479 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 48 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 55 states and 69 transitions. Complement of second has 5 states. [2019-01-14 02:50:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:50:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-01-14 02:50:59,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 02:50:59,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:59,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:50:59,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:59,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 6 letters. [2019-01-14 02:50:59,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:59,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 69 transitions. [2019-01-14 02:50:59,482 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-14 02:50:59,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 52 states and 65 transitions. [2019-01-14 02:50:59,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-01-14 02:50:59,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-01-14 02:50:59,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 65 transitions. [2019-01-14 02:50:59,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:59,485 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-01-14 02:50:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 65 transitions. [2019-01-14 02:50:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-01-14 02:50:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 02:50:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2019-01-14 02:50:59,491 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-01-14 02:50:59,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:50:59,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:50:59,491 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand 4 states. [2019-01-14 02:50:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:59,564 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-01-14 02:50:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:50:59,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2019-01-14 02:50:59,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:50:59,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 43 states and 54 transitions. [2019-01-14 02:50:59,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-14 02:50:59,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-14 02:50:59,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-01-14 02:50:59,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:59,571 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-14 02:50:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-01-14 02:50:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-14 02:50:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 02:50:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-01-14 02:50:59,573 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-01-14 02:50:59,573 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-01-14 02:50:59,573 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:50:59,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2019-01-14 02:50:59,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:50:59,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:59,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:59,574 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:59,575 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:59,575 INFO L794 eck$LassoCheckResult]: Stem: 1266#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1261#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1234#L69 base2flt_#res := base2flt_~__retres4~0; 1235#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1257#L19-1 assume !(0 == base2flt_~m % 4294967296); 1243#L25-1 assume base2flt_~m % 4294967296 < 16777216; 1244#L37-3 assume !false; 1255#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1256#L37-2 assume !(base2flt_~m % 4294967296 < 16777216); 1262#L63-1 base2flt_~m := ~bitwiseAnd(base2flt_~m, ~bitwiseComplement(16777216));base2flt_~res~0 := ~bitwiseOr(base2flt_~m, 16777216 * (128 + base2flt_~e));base2flt_~__retres4~0 := base2flt_~res~0; 1247#L69-1 base2flt_#res := base2flt_~__retres4~0; 1248#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1252#L19-2 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1231#L69-2 base2flt_#res := base2flt_~__retres4~0; 1245#L70-2 main_#t~ret6 := base2flt_#res;main_~a~0 := main_#t~ret6;havoc main_#t~ret6;base2flt_#in~m, base2flt_#in~e := main_~mb~2, main_~eb~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1253#L19-3 assume !(0 == base2flt_~m % 4294967296); 1238#L25-3 assume !(base2flt_~m % 4294967296 < 16777216); 1239#L47-11 [2019-01-14 02:50:59,575 INFO L796 eck$LassoCheckResult]: Loop: 1239#L47-11 assume !false; 1268#L48-3 assume base2flt_~m % 4294967296 >= 33554432; 1246#L49-3 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 1239#L47-11 [2019-01-14 02:50:59,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:59,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1360904017, now seen corresponding path program 1 times [2019-01-14 02:50:59,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:59,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:59,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:59,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:59,645 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:59,645 INFO L82 PathProgramCache]: Analyzing trace with hash 261296, now seen corresponding path program 1 times [2019-01-14 02:50:59,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:59,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:59,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:59,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:59,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:59,749 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:59,749 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:59,749 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:59,749 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:59,749 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:59,749 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:59,750 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:59,750 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:59,750 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration6_Loop [2019-01-14 02:50:59,750 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:59,750 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:59,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:59,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:59,887 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:59,887 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:59,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:59,891 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:59,914 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:59,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:59,934 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:59,936 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:59,936 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:59,936 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:59,936 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:59,936 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:59,937 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:59,937 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:59,937 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:59,937 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration6_Loop [2019-01-14 02:50:59,937 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:59,937 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:59,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:59,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:00,046 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:00,046 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:51:00,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:00,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:00,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:00,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:00,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:00,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:00,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:00,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:00,056 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:51:00,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:51:00,059 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:51:00,059 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:51:00,059 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:51:00,059 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:51:00,059 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-14 02:51:00,064 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:51:00,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:00,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:00,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:51:00,117 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:51:00,118 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 51 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-14 02:51:00,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 51 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 4 states. [2019-01-14 02:51:00,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:51:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:51:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-01-14 02:51:00,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-14 02:51:00,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:51:00,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 20 letters. Loop has 3 letters. [2019-01-14 02:51:00,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:51:00,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 17 letters. Loop has 6 letters. [2019-01-14 02:51:00,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:51:00,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2019-01-14 02:51:00,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:51:00,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 47 transitions. [2019-01-14 02:51:00,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 02:51:00,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 02:51:00,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2019-01-14 02:51:00,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:51:00,152 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-01-14 02:51:00,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2019-01-14 02:51:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-14 02:51:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 02:51:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2019-01-14 02:51:00,155 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-01-14 02:51:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:51:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:51:00,157 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 4 states. [2019-01-14 02:51:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:00,265 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-01-14 02:51:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:51:00,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 56 transitions. [2019-01-14 02:51:00,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:51:00,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 56 transitions. [2019-01-14 02:51:00,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-14 02:51:00,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-01-14 02:51:00,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2019-01-14 02:51:00,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:51:00,270 INFO L706 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-01-14 02:51:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2019-01-14 02:51:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-01-14 02:51:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 02:51:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-01-14 02:51:00,275 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-14 02:51:00,275 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-14 02:51:00,275 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:51:00,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2019-01-14 02:51:00,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:51:00,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:00,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:00,279 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:00,279 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:51:00,279 INFO L794 eck$LassoCheckResult]: Stem: 1506#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1503#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1478#L69 base2flt_#res := base2flt_~__retres4~0; 1479#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1499#L19-1 assume !(0 == base2flt_~m % 4294967296); 1486#L25-1 assume base2flt_~m % 4294967296 < 16777216; 1487#L37-3 assume !false; 1497#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1498#L37-2 assume base2flt_~m % 4294967296 < 16777216; 1509#L37-3 assume !false; 1496#L28-1 assume base2flt_~e <= -128;base2flt_~__retres4~0 := 0; 1489#L69-1 base2flt_#res := base2flt_~__retres4~0; 1490#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1494#L19-2 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1475#L69-2 base2flt_#res := base2flt_~__retres4~0; 1488#L70-2 main_#t~ret6 := base2flt_#res;main_~a~0 := main_#t~ret6;havoc main_#t~ret6;base2flt_#in~m, base2flt_#in~e := main_~mb~2, main_~eb~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1495#L19-3 assume !(0 == base2flt_~m % 4294967296); 1482#L25-3 assume base2flt_~m % 4294967296 < 16777216; 1480#L37-7 [2019-01-14 02:51:00,279 INFO L796 eck$LassoCheckResult]: Loop: 1480#L37-7 assume !false; 1481#L28-3 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1505#L37-6 assume base2flt_~m % 4294967296 < 16777216; 1480#L37-7 [2019-01-14 02:51:00,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:00,280 INFO L82 PathProgramCache]: Analyzing trace with hash -377438794, now seen corresponding path program 1 times [2019-01-14 02:51:00,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:00,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:00,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:00,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:00,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:51:00,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:51:00,339 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-14 02:51:00,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:00,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:51:00,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:51:00,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-14 02:51:00,396 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:51:00,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:00,396 INFO L82 PathProgramCache]: Analyzing trace with hash 235537, now seen corresponding path program 1 times [2019-01-14 02:51:00,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:00,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:00,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:00,436 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:51:00,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:51:00,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:51:00,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:51:00,437 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:51:00,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:00,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:51:00,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:51:00,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration7_Loop [2019-01-14 02:51:00,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:51:00,438 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:51:00,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:00,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:00,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:00,645 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:00,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:51:00,650 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:51:00,660 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:51:00,660 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m=0} Honda state: {ULTIMATE.start_base2flt_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:00,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:51:00,683 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-14 02:51:00,706 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:51:00,706 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:51:00,726 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:51:00,727 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:51:00,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:51:00,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:51:00,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:51:00,728 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:51:00,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:00,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:51:00,728 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:51:00,728 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration7_Loop [2019-01-14 02:51:00,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:51:00,728 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:51:00,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:00,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:00,815 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:00,816 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:51:00,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:00,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:00,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:00,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:00,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:00,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:00,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:00,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:00,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:00,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:00,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:00,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:00,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:00,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:00,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:00,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:00,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:00,832 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:51:00,833 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:51:00,833 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:51:00,838 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:51:00,838 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:51:00,838 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:51:00,838 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-01-14 02:51:00,839 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:51:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:00,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:00,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:51:00,942 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:51:00,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-14 02:51:00,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 43 states and 54 transitions. Complement of second has 4 states. [2019-01-14 02:51:00,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:51:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:51:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2019-01-14 02:51:00,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 02:51:00,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:51:00,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-14 02:51:00,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:51:00,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-14 02:51:00,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:51:00,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 54 transitions. [2019-01-14 02:51:00,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:51:00,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. [2019-01-14 02:51:00,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:51:00,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:51:00,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:51:00,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:00,961 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:51:00,961 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:51:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:51:00,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:51:00,962 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 02:51:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:00,962 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:51:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:51:00,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:51:00,963 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:51:00,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:51:00,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:51:00,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:51:00,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:51:00,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:00,965 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:51:00,965 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:51:00,966 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:51:00,966 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:51:00,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:51:00,966 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:51:00,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:51:00,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:51:00 BoogieIcfgContainer [2019-01-14 02:51:00,974 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:51:00,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:51:00,975 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:51:00,975 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:51:00,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:54" (3/4) ... [2019-01-14 02:51:00,982 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:51:00,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:51:00,983 INFO L168 Benchmark]: Toolchain (without parser) took 8181.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 948.7 MB in the beginning and 998.2 MB in the end (delta: -49.5 MB). Peak memory consumption was 162.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:00,985 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:51:00,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.59 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:00,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:00,988 INFO L168 Benchmark]: Boogie Preprocessor took 48.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-14 02:51:00,989 INFO L168 Benchmark]: RCFGBuilder took 918.97 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:00,990 INFO L168 Benchmark]: BuchiAutomizer took 6601.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 998.2 MB in the end (delta: 93.4 MB). Peak memory consumption was 165.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:51:00,991 INFO L168 Benchmark]: Witness Printer took 7.44 ms. Allocated memory is still 1.2 GB. Free memory is still 998.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:51:00,997 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.12 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 481.59 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.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 918.97 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6601.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 998.2 MB in the end (delta: 93.4 MB). Peak memory consumption was 165.2 MB. Max. memory is 11.5 GB. * Witness Printer took 7.44 ms. Allocated memory is still 1.2 GB. Free memory is still 998.2 MB. 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 13 terminating modules (6 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * e + 253 and consists of 4 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.6s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 95 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 5. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 542 SDtfs, 373 SDslu, 116 SDs, 0 SdLazy, 207 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf95 lsp57 ukn100 mio100 lsp100 div596 bol100 ite100 ukn100 eq131 hnf43 smp92 dnf100 smp100 tf105 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...