./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/bitvector/soft_float_5_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 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:08:57,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:08:57,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:08:57,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:08:57,752 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:08:57,753 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:08:57,755 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:08:57,757 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:08:57,759 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:08:57,760 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:08:57,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:08:57,761 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:08:57,763 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:08:57,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:08:57,765 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:08:57,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:08:57,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:08:57,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:08:57,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:08:57,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:08:57,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:08:57,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:08:57,778 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:08:57,779 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:08:57,779 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:08:57,780 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:08:57,781 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:08:57,782 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:08:57,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:08:57,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:08:57,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:08:57,786 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:08:57,786 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:08:57,786 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:08:57,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:08:57,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:08:57,789 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:08:57,816 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:08:57,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:08:57,819 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:08:57,819 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:08:57,820 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:08:57,820 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:08:57,820 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:08:57,820 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:08:57,820 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:08:57,821 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:08:57,821 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:08:57,821 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:08:57,821 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:08:57,821 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:08:57,821 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:08:57,822 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:08:57,822 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:08:57,823 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:08:57,823 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:08:57,823 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:08:57,823 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:08:57,823 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:08:57,824 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:08:57,825 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:08:57,825 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:08:57,825 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:08:57,825 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:08:57,826 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:08:57,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:08:57,826 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:08:57,826 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:08:57,827 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:08:57,828 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 -> 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 [2019-01-01 22:08:57,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:08:57,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:08:57,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:08:57,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:08:57,908 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:08:57,909 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:57,984 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/778a4bd7e/83e177db22e64c7caa7bfb96ada100bd/FLAG89b393ee2 [2019-01-01 22:08:58,466 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:08:58,468 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:58,478 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/778a4bd7e/83e177db22e64c7caa7bfb96ada100bd/FLAG89b393ee2 [2019-01-01 22:08:58,812 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/778a4bd7e/83e177db22e64c7caa7bfb96ada100bd [2019-01-01 22:08:58,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:08:58,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:08:58,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:08:58,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:08:58,822 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:08:58,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:08:58" (1/1) ... [2019-01-01 22:08:58,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dbefa8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:58, skipping insertion in model container [2019-01-01 22:08:58,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:08:58" (1/1) ... [2019-01-01 22:08:58,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:08:58,887 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:08:59,151 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:08:59,158 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:08:59,214 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:08:59,229 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:08:59,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59 WrapperNode [2019-01-01 22:08:59,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:08:59,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:08:59,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:08:59,231 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:08:59,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (1/1) ... [2019-01-01 22:08:59,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (1/1) ... [2019-01-01 22:08:59,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:08:59,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:08:59,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:08:59,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:08:59,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (1/1) ... [2019-01-01 22:08:59,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (1/1) ... [2019-01-01 22:08:59,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (1/1) ... [2019-01-01 22:08:59,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (1/1) ... [2019-01-01 22:08:59,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (1/1) ... [2019-01-01 22:08:59,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (1/1) ... [2019-01-01 22:08:59,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (1/1) ... [2019-01-01 22:08:59,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:08:59,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:08:59,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:08:59,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:08:59,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:59,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:08:59,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:09:00,349 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:09:00,349 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2019-01-01 22:09:00,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:09:00 BoogieIcfgContainer [2019-01-01 22:09:00,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:09:00,351 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:09:00,351 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:09:00,356 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:09:00,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:09:00,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:08:58" (1/3) ... [2019-01-01 22:09:00,359 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a54130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:09:00, skipping insertion in model container [2019-01-01 22:09:00,359 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:09:00,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:59" (2/3) ... [2019-01-01 22:09:00,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a54130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:09:00, skipping insertion in model container [2019-01-01 22:09:00,361 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:09:00,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:09:00" (3/3) ... [2019-01-01 22:09:00,363 INFO L375 chiAutomizerObserver]: Analyzing ICFG soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:09:00,429 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:09:00,430 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:09:00,430 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:09:00,431 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:09:00,431 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:09:00,431 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:09:00,431 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:09:00,432 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:09:00,432 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:09:00,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-01-01 22:09:00,486 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-01-01 22:09:00,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:00,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:00,496 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:09:00,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:09:00,496 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:09:00,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-01-01 22:09:00,503 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-01-01 22:09:00,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:00,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:00,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:09:00,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:09:00,514 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_~sb~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_~sb~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-01 22:09:00,514 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-01 22:09:00,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:00,523 INFO L82 PathProgramCache]: Analyzing trace with hash 30973, now seen corresponding path program 1 times [2019-01-01 22:09:00,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:00,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:00,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:00,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:09:00,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 22:09:00,713 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:09:00,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:00,713 INFO L82 PathProgramCache]: Analyzing trace with hash 73619, now seen corresponding path program 1 times [2019-01-01 22:09:00,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:00,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:00,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:00,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,865 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:00,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:00,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:00,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:00,867 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:00,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:00,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:00,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:00,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-01 22:09:00,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:00,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:00,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:00,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:01,083 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-01 22:09:01,185 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:01,186 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:01,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:01,191 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:01,228 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:09:01,228 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-01 22:09:01,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:01,249 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) [2019-01-01 22:09:01,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:01,299 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:01,348 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:01,352 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:01,352 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:01,352 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:01,352 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:01,352 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:01,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:01,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:01,353 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:01,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-01 22:09:01,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:01,353 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:01,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:01,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:01,529 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:01,536 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:01,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:01,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:01,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:01,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:01,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:01,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:01,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:01,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:01,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:01,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:01,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:01,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:01,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:01,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:01,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:01,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:01,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:01,569 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:09:01,578 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:09:01,579 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:09:01,582 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:09:01,583 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:09:01,583 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:09:01,583 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-01 22:09:01,585 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:09:01,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:01,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:01,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:01,738 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-01 22:09:01,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states. Second operand 3 states. [2019-01-01 22:09:01,965 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-01 22:09:01,966 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-01 22:09:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:09:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 227 transitions. [2019-01-01 22:09:01,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 22:09:01,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:01,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:09:01,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:01,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 22:09:01,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:01,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 343 transitions. [2019-01-01 22:09:02,009 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2019-01-01 22:09:02,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 78 states and 119 transitions. [2019-01-01 22:09:02,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-01-01 22:09:02,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-01-01 22:09:02,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 119 transitions. [2019-01-01 22:09:02,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:02,025 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 119 transitions. [2019-01-01 22:09:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 119 transitions. [2019-01-01 22:09:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-01-01 22:09:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-01 22:09:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2019-01-01 22:09:02,070 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 107 transitions. [2019-01-01 22:09:02,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:09:02,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:09:02,076 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand 3 states. [2019-01-01 22:09:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:02,332 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2019-01-01 22:09:02,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:09:02,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-01-01 22:09:02,335 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-01 22:09:02,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 47 transitions. [2019-01-01 22:09:02,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-01 22:09:02,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-01 22:09:02,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 47 transitions. [2019-01-01 22:09:02,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:02,337 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-01-01 22:09:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 47 transitions. [2019-01-01 22:09:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-01 22:09:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 22:09:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-01-01 22:09:02,341 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-01-01 22:09:02,341 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-01-01 22:09:02,341 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:09:02,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 47 transitions. [2019-01-01 22:09:02,342 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-01 22:09:02,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:02,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:02,343 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:09:02,343 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:09:02,343 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_~sb~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_~sb~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-01 22:09:02,343 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-01 22:09:02,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:02,344 INFO L82 PathProgramCache]: Analyzing trace with hash 921737699, now seen corresponding path program 1 times [2019-01-01 22:09:02,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:02,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:02,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:02,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:02,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:02,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:09:02,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:09:02,425 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:09:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash 136178, now seen corresponding path program 1 times [2019-01-01 22:09:02,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:02,493 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:02,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:02,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:02,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:02,494 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:02,494 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:02,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:02,494 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:02,495 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-01 22:09:02,495 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:02,495 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:02,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:02,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:02,670 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:02,670 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) [2019-01-01 22:09:02,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:02,679 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:02,711 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:09:02,711 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-01 22:09:02,735 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:02,735 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-01 22:09:02,760 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:02,760 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:02,786 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:02,788 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:02,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:02,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:02,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:02,789 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:02,789 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:02,789 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:02,789 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:02,789 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-01 22:09:02,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:02,789 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:02,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:02,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:02,960 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:02,960 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:02,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:02,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:02,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:02,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:02,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:02,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:02,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:02,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:02,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:02,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:02,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:02,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:02,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:02,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:02,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:02,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:02,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:02,986 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:09:02,989 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:09:02,990 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:09:02,991 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:09:02,991 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:09:02,991 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:09:02,991 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-01 22:09:02,992 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:09:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:03,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:03,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:03,048 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-01 22:09:03,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 47 transitions. cyclomatic complexity: 19 Second operand 3 states. [2019-01-01 22:09:03,128 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-01 22:09:03,130 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-01 22:09:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:09:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2019-01-01 22:09:03,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:09:03,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:03,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:09:03,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:03,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 22:09:03,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:03,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 84 transitions. [2019-01-01 22:09:03,134 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2019-01-01 22:09:03,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 59 states and 80 transitions. [2019-01-01 22:09:03,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-01-01 22:09:03,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-01-01 22:09:03,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 80 transitions. [2019-01-01 22:09:03,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:03,137 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 80 transitions. [2019-01-01 22:09:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 80 transitions. [2019-01-01 22:09:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-01-01 22:09:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 22:09:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-01-01 22:09:03,142 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-01-01 22:09:03,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:09:03,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:09:03,142 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2019-01-01 22:09:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:03,229 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-01-01 22:09:03,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:09:03,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2019-01-01 22:09:03,231 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-01 22:09:03,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 46 transitions. [2019-01-01 22:09:03,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-01 22:09:03,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-01 22:09:03,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. [2019-01-01 22:09:03,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:03,235 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-01 22:09:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. [2019-01-01 22:09:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-01-01 22:09:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 22:09:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-01-01 22:09:03,238 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-01-01 22:09:03,238 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-01-01 22:09:03,239 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:09:03,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2019-01-01 22:09:03,241 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-01 22:09:03,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:03,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:03,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:09:03,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:09:03,243 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_~sb~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_~sb~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-01 22:09:03,243 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-01 22:09:03,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash 921737673, now seen corresponding path program 1 times [2019-01-01 22:09:03,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:03,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:03,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:03,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:03,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:03,264 INFO L82 PathProgramCache]: Analyzing trace with hash 110419, now seen corresponding path program 1 times [2019-01-01 22:09:03,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:03,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:03,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:03,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:03,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1761173643, now seen corresponding path program 1 times [2019-01-01 22:09:03,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:03,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:03,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:03,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:03,367 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:03,367 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:03,368 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:03,368 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:03,368 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:03,368 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:03,369 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:03,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:03,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-01 22:09:03,369 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:03,369 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:03,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:03,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:03,547 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:03,547 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-01 22:09:03,552 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:03,552 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:03,565 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:09:03,565 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-01 22:09:03,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:03,586 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-01 22:09:03,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:03,612 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:03,634 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:03,636 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:03,636 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:03,636 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:03,636 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:03,636 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:03,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:03,637 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:03,637 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:03,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-01 22:09:03,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:03,637 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:03,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:03,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:03,789 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:03,790 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:03,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:03,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:03,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:03,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:03,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:03,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:03,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:03,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:03,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:03,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-01 22:09:03,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:03,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:03,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:03,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:03,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:03,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:03,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:03,802 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:09:03,804 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:09:03,805 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:09:03,805 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:09:03,805 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:09:03,805 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:09:03,806 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-01-01 22:09:03,806 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:09:03,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:03,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:03,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:03,928 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-01 22:09:03,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-01 22:09:03,950 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-01 22:09:03,952 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-01 22:09:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:09:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-01-01 22:09:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:09:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:09:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:03,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 22:09:03,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:03,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2019-01-01 22:09:03,955 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-01-01 22:09:03,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 74 transitions. [2019-01-01 22:09:03,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-01-01 22:09:03,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-01 22:09:03,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2019-01-01 22:09:03,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:03,957 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2019-01-01 22:09:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2019-01-01 22:09:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2019-01-01 22:09:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 22:09:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-01-01 22:09:03,960 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-01 22:09:03,960 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-01 22:09:03,960 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:09:03,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-01-01 22:09:03,961 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-01 22:09:03,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:03,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:03,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:03,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:09:03,962 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_~sb~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_~sb~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-01 22:09:03,962 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-01 22:09:03,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:03,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1760951196, now seen corresponding path program 1 times [2019-01-01 22:09:03,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:03,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:03,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:03,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:03,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:04,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:09:04,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:09:04,032 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:09:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash 198737, now seen corresponding path program 1 times [2019-01-01 22:09:04,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:04,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:04,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:04,088 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:04,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:04,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:04,089 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:04,089 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:04,089 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:04,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:04,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:04,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-01 22:09:04,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:04,089 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:04,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:04,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:04,247 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-01 22:09:04,275 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:04,275 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:04,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:04,281 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:04,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:04,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:04,327 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:04,330 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:04,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:04,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:04,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:04,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:04,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:04,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:04,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:04,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-01 22:09:04,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:04,332 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:04,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:04,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:04,491 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:04,491 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:04,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:04,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:04,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:04,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:04,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:04,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:04,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:04,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:04,502 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:09:04,505 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:09:04,505 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:09:04,506 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:09:04,506 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:09:04,506 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:09:04,506 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-01 22:09:04,507 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:09:04,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:04,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:04,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:04,570 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-01 22:09:04,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-01 22:09:04,610 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-01 22:09:04,611 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-01 22:09:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:09:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-01-01 22:09:04,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:09:04,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:04,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 22:09:04,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:04,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 22:09:04,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:04,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2019-01-01 22:09:04,614 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-01 22:09:04,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 48 states and 61 transitions. [2019-01-01 22:09:04,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-01 22:09:04,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-01 22:09:04,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2019-01-01 22:09:04,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:04,622 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-01-01 22:09:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2019-01-01 22:09:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-01-01 22:09:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 22:09:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2019-01-01 22:09:04,628 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2019-01-01 22:09:04,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:09:04,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:09:04,628 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 3 states. [2019-01-01 22:09:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:04,733 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-01-01 22:09:04,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:09:04,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2019-01-01 22:09:04,735 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:09:04,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 52 transitions. [2019-01-01 22:09:04,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-01 22:09:04,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-01 22:09:04,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2019-01-01 22:09:04,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:04,738 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-01-01 22:09:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2019-01-01 22:09:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-01-01 22:09:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 22:09:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-01-01 22:09:04,741 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-01-01 22:09:04,741 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-01-01 22:09:04,741 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:09:04,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-01-01 22:09:04,742 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:09:04,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:04,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:04,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:04,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:09:04,743 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_~sb~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_~sb~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-01 22:09:04,743 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-01 22:09:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash -197167406, now seen corresponding path program 1 times [2019-01-01 22:09:04,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:04,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:04,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:04,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:04,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:09:04,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:09:04,853 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:09:04,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:04,853 INFO L82 PathProgramCache]: Analyzing trace with hash 172978, now seen corresponding path program 1 times [2019-01-01 22:09:04,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:04,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:04,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:04,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:04,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:04,891 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:04,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:04,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:04,891 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:04,891 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:04,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:04,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:04,892 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:04,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-01 22:09:04,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:04,892 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:04,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:04,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:05,001 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:05,001 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-01 22:09:05,013 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:05,013 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:05,032 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:09:05,032 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:05,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:05,064 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01 22:09:05,087 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:05,087 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:05,109 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:05,110 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:05,110 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:05,110 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:05,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:05,111 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:05,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:05,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:05,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:05,111 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-01 22:09:05,111 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:05,111 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:05,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:05,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:05,203 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:05,203 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:05,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:05,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:05,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:05,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:05,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:05,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:05,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:05,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:05,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:05,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:05,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:05,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:05,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:05,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:05,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:05,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:05,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:05,212 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:09:05,215 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:09:05,215 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:09:05,215 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:09:05,215 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:09:05,215 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:09:05,215 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-01-01 22:09:05,216 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:09:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:05,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:05,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:05,315 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-01 22:09:05,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-01 22:09:05,332 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-01 22:09:05,334 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-01 22:09:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:09:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-01-01 22:09:05,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 22:09:05,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:05,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:09:05,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:05,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 6 letters. [2019-01-01 22:09:05,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:05,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 69 transitions. [2019-01-01 22:09:05,336 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-01 22:09:05,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 52 states and 65 transitions. [2019-01-01 22:09:05,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-01-01 22:09:05,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-01-01 22:09:05,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 65 transitions. [2019-01-01 22:09:05,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:05,339 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-01-01 22:09:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 65 transitions. [2019-01-01 22:09:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-01-01 22:09:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 22:09:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2019-01-01 22:09:05,345 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-01-01 22:09:05,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:09:05,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:09:05,345 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand 4 states. [2019-01-01 22:09:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:05,420 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-01-01 22:09:05,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:09:05,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2019-01-01 22:09:05,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:09:05,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 43 states and 54 transitions. [2019-01-01 22:09:05,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 22:09:05,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-01 22:09:05,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-01-01 22:09:05,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:05,424 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-01 22:09:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-01-01 22:09:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-01 22:09:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 22:09:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-01-01 22:09:05,430 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-01-01 22:09:05,430 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-01-01 22:09:05,430 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:09:05,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2019-01-01 22:09:05,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:09:05,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:05,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:05,431 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:05,431 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:09:05,432 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_~sb~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_~sb~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-01 22:09:05,432 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-01 22:09:05,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1360904017, now seen corresponding path program 1 times [2019-01-01 22:09:05,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:05,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:05,738 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-01-01 22:09:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:05,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:09:05,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:09:05,740 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:09:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 261296, now seen corresponding path program 1 times [2019-01-01 22:09:05,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:05,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:05,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:05,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:05,864 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:05,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:05,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:05,865 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:05,865 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:05,865 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:05,865 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:05,865 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:05,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration6_Loop [2019-01-01 22:09:05,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:05,866 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:05,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:05,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:05,971 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:05,971 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-01 22:09:05,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:05,981 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) [2019-01-01 22:09:06,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:06,034 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:06,061 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:06,062 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:06,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:06,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:06,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:06,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:06,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:06,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:06,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:06,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration6_Loop [2019-01-01 22:09:06,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:06,063 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:06,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:06,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:06,181 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:06,182 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:06,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:06,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:06,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:06,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:06,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:06,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:06,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:06,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:06,186 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:09:06,188 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:09:06,188 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:09:06,189 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:09:06,189 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:09:06,189 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:09:06,189 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-01 22:09:06,189 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:09:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:06,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:06,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:06,242 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-01 22:09:06,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 51 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-01 22:09:06,249 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-01 22:09:06,251 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-01 22:09:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:09:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-01-01 22:09:06,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-01 22:09:06,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:06,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 20 letters. Loop has 3 letters. [2019-01-01 22:09:06,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:06,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 17 letters. Loop has 6 letters. [2019-01-01 22:09:06,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:06,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2019-01-01 22:09:06,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:09:06,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 47 transitions. [2019-01-01 22:09:06,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 22:09:06,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 22:09:06,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2019-01-01 22:09:06,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:06,261 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-01-01 22:09:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2019-01-01 22:09:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-01 22:09:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 22:09:06,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2019-01-01 22:09:06,265 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-01-01 22:09:06,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:09:06,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:09:06,265 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 4 states. [2019-01-01 22:09:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:06,347 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-01-01 22:09:06,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:09:06,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 56 transitions. [2019-01-01 22:09:06,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:09:06,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 56 transitions. [2019-01-01 22:09:06,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-01 22:09:06,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-01-01 22:09:06,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2019-01-01 22:09:06,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:06,352 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-01-01 22:09:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2019-01-01 22:09:06,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-01-01 22:09:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 22:09:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-01-01 22:09:06,354 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-01 22:09:06,354 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-01 22:09:06,354 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:09:06,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2019-01-01 22:09:06,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:09:06,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:06,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:06,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:06,355 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:09:06,356 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_~sb~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_~sb~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-01 22:09:06,356 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-01 22:09:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash -377438794, now seen corresponding path program 1 times [2019-01-01 22:09:06,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:06,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:06,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:06,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:06,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:06,414 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-01 22:09:06,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:06,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:09:06,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:06,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:06,458 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-01 22:09:06,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:09:06,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-01 22:09:06,478 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:09:06,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash 235537, now seen corresponding path program 1 times [2019-01-01 22:09:06,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:06,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:06,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:06,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:06,526 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:06,526 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:06,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:06,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:06,527 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:06,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:06,527 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:06,527 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:06,527 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration7_Loop [2019-01-01 22:09:06,527 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:06,527 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:06,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:06,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:06,610 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:06,610 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-01 22:09:06,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:06,620 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:06,629 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:09:06,629 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-01 22:09:06,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:06,651 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-01 22:09:06,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:06,675 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:06,696 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:06,698 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:06,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:06,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:06,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:06,698 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:06,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:06,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:06,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:06,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration7_Loop [2019-01-01 22:09:06,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:06,699 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:06,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-01 22:09:06,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:09:06,781 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:06,781 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:06,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:06,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:06,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:06,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:06,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:06,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:06,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:06,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:06,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:06,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:09:06,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:06,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:06,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:06,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:06,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:06,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:06,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:06,789 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:09:06,791 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:09:06,791 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:09:06,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:09:06,791 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:09:06,792 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:09:06,792 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-01-01 22:09:06,792 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:09:06,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:06,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:06,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:09:06,987 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-01 22:09:06,987 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-01 22:09:07,013 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-01 22:09:07,013 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-01 22:09:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:09:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2019-01-01 22:09:07,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 22:09:07,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:07,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 22:09:07,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:07,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-01 22:09:07,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:07,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 54 transitions. [2019-01-01 22:09:07,015 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:09:07,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. [2019-01-01 22:09:07,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:09:07,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:09:07,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:09:07,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:07,016 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:07,016 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:07,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:09:07,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:09:07,017 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 22:09:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:07,017 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 22:09:07,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 22:09:07,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 22:09:07,017 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:09:07,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 22:09:07,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:09:07,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:09:07,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:09:07,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:07,018 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:07,018 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:07,018 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:07,018 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:09:07,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:09:07,018 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:09:07,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:09:07,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:09:07 BoogieIcfgContainer [2019-01-01 22:09:07,026 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:09:07,027 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:09:07,027 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:09:07,027 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:09:07,028 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:09:00" (3/4) ... [2019-01-01 22:09:07,032 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:09:07,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:09:07,033 INFO L168 Benchmark]: Toolchain (without parser) took 8216.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 947.3 MB in the beginning and 983.7 MB in the end (delta: -36.4 MB). Peak memory consumption was 175.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:07,034 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:09:07,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.56 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:07,035 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.94 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:09:07,035 INFO L168 Benchmark]: Boogie Preprocessor took 129.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:07,036 INFO L168 Benchmark]: RCFGBuilder took 935.23 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:07,037 INFO L168 Benchmark]: BuchiAutomizer took 6675.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 983.7 MB in the end (delta: 110.6 MB). Peak memory consumption was 184.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:07,038 INFO L168 Benchmark]: Witness Printer took 5.02 ms. Allocated memory is still 1.2 GB. Free memory is still 983.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:09:07,043 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 412.56 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 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 53.94 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 935.23 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6675.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 983.7 MB in the end (delta: 110.6 MB). Peak memory consumption was 184.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.02 ms. Allocated memory is still 1.2 GB. Free memory is still 983.7 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.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.7s. 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.7s 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: 18ms 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...