./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/bitvector/soft_float_1_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 f756365182c9801d4a2ac186a40692687a86b469 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:50:41,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:50:41,463 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:50:41,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:50:41,480 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:50:41,481 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:50:41,484 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:50:41,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:50:41,490 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:50:41,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:50:41,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:50:41,495 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:50:41,496 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:50:41,497 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:50:41,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:50:41,499 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:50:41,500 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:50:41,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:50:41,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:50:41,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:50:41,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:50:41,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:50:41,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:50:41,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:50:41,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:50:41,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:50:41,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:50:41,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:50:41,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:50:41,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:50:41,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:50:41,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:50:41,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:50:41,517 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:50:41,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:50:41,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:50:41,519 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:50:41,537 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:50:41,538 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:50:41,539 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:50:41,539 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:50:41,540 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:50:41,540 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:50:41,540 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:50:41,541 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:50:41,541 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:50:41,541 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:50:41,541 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:50:41,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:50:41,541 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:50:41,542 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:50:41,543 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:50:41,543 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:50:41,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:50:41,543 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:50:41,543 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:50:41,543 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:50:41,544 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:50:41,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:50:41,545 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:50:41,545 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:50:41,545 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:50:41,545 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:50:41,545 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:50:41,546 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:50:41,546 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:50:41,546 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:50:41,546 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:50:41,548 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:50:41,549 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 -> f756365182c9801d4a2ac186a40692687a86b469 [2019-01-14 02:50:41,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:50:41,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:50:41,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:50:41,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:50:41,605 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:50:41,606 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-14 02:50:41,663 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c6cb340/b8468470479e43dd88262642ca74815e/FLAG71e1a414d [2019-01-14 02:50:42,132 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:50:42,133 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-14 02:50:42,142 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c6cb340/b8468470479e43dd88262642ca74815e/FLAG71e1a414d [2019-01-14 02:50:42,499 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c6cb340/b8468470479e43dd88262642ca74815e [2019-01-14 02:50:42,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:50:42,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:50:42,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:50:42,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:50:42,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:50:42,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:42,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a5f3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42, skipping insertion in model container [2019-01-14 02:50:42,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:42,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:50:42,560 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:50:42,861 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:50:42,865 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:50:42,927 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:50:42,943 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:50:42,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42 WrapperNode [2019-01-14 02:50:42,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:50:42,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:50:42,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:50:42,945 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:50:42,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:42,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:43,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:50:43,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:50:43,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:50:43,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:50:43,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:43,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:43,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:43,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:43,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:43,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:43,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (1/1) ... [2019-01-14 02:50:43,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:50:43,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:50:43,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:50:43,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:50:43,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:50:43,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:50:44,070 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:50:44,071 INFO L286 CfgBuilder]: Removed 28 assue(true) statements. [2019-01-14 02:50:44,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:44 BoogieIcfgContainer [2019-01-14 02:50:44,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:50:44,074 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:50:44,074 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:50:44,078 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:50:44,079 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:44,079 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:50:42" (1/3) ... [2019-01-14 02:50:44,081 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c24cd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:50:44, skipping insertion in model container [2019-01-14 02:50:44,081 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:44,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:42" (2/3) ... [2019-01-14 02:50:44,082 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c24cd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:50:44, skipping insertion in model container [2019-01-14 02:50:44,082 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:44,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:44" (3/3) ... [2019-01-14 02:50:44,085 INFO L375 chiAutomizerObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-14 02:50:44,145 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:50:44,145 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:50:44,146 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:50:44,146 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:50:44,146 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:50:44,147 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:50:44,147 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:50:44,147 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:50:44,147 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:50:44,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2019-01-14 02:50:44,196 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-14 02:50:44,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:44,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:44,202 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:50:44,203 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:44,203 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:50:44,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2019-01-14 02:50:44,211 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-14 02:50:44,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:44,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:44,212 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:50:44,212 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:44,219 INFO L794 eck$LassoCheckResult]: Stem: 37#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_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_add~0, main_~zero~0, main_~sa~0, main_~sb~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~tmp___2~0, main_~tmp___3~0, main_~tmp___4~0, main_~tmp___5~0, main_~tmp___6~0, main_~tmp___7~0, main_~tmp___8~0, main_~tmp___9~0, main_~__retres23~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_add~0;havoc main_~zero~0;havoc main_~sa~0;havoc main_~sb~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~tmp___2~0;havoc main_~tmp___3~0;havoc main_~tmp___4~0;havoc main_~tmp___5~0;havoc main_~tmp___6~0;havoc main_~tmp___7~0;havoc main_~tmp___8~0;havoc main_~tmp___9~0;havoc main_~__retres23~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; 33#L19true assume !(0 == base2flt_~m % 4294967296); 21#L25true assume !(base2flt_~m % 4294967296 < 16777216); 16#L47-2true [2019-01-14 02:50:44,219 INFO L796 eck$LassoCheckResult]: Loop: 16#L47-2true assume !false; 27#L48true assume base2flt_~m % 4294967296 >= 33554432; 55#L49true assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 16#L47-2true [2019-01-14 02:50:44,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:44,225 INFO L82 PathProgramCache]: Analyzing trace with hash 30973, now seen corresponding path program 1 times [2019-01-14 02:50:44,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:44,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:44,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:44,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:44,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 02:50:44,408 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 73619, now seen corresponding path program 1 times [2019-01-14 02:50:44,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:44,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:44,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:44,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:44,495 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:44,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:44,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:44,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:44,496 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:44,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:44,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:44,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:44,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-14 02:50:44,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:44,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:44,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:44,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:45,007 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:45,008 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) [2019-01-14 02:50:45,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:45,020 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:45,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:45,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:45,071 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:45,074 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:45,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:45,074 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:45,074 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:45,074 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:45,075 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:45,075 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:45,075 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:45,075 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-14 02:50:45,075 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:45,075 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:45,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:45,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:45,280 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-14 02:50:45,319 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:45,324 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:45,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:45,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:45,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:45,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:45,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:45,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:45,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:45,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:45,338 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:45,344 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:50:45,344 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:50:45,346 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:45,346 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:50:45,347 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:45,348 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-14 02:50:45,349 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:50:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:45,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:45,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:45,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:50:45,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states. Second operand 3 states. [2019-01-14 02:50:45,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states.. Second operand 3 states. Result 254 states and 411 transitions. Complement of second has 6 states. [2019-01-14 02:50:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:50:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 269 transitions. [2019-01-14 02:50:45,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 269 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-14 02:50:45,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:45,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 269 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:50:45,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:45,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 269 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:50:45,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:45,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 411 transitions. [2019-01-14 02:50:45,782 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2019-01-14 02:50:45,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 56 states and 81 transitions. [2019-01-14 02:50:45,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-14 02:50:45,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-14 02:50:45,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 81 transitions. [2019-01-14 02:50:45,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:45,794 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 81 transitions. [2019-01-14 02:50:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 81 transitions. [2019-01-14 02:50:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-01-14 02:50:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 02:50:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2019-01-14 02:50:45,822 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 69 transitions. [2019-01-14 02:50:45,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:45,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:45,825 INFO L87 Difference]: Start difference. First operand 45 states and 69 transitions. Second operand 3 states. [2019-01-14 02:50:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:45,891 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-01-14 02:50:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:45,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-14 02:50:45,893 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-14 02:50:45,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2019-01-14 02:50:45,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 02:50:45,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 02:50:45,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-01-14 02:50:45,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:45,895 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 02:50:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-01-14 02:50:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 02:50:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 02:50:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-01-14 02:50:45,899 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 02:50:45,899 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 02:50:45,899 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:50:45,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-01-14 02:50:45,900 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-14 02:50:45,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:45,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:45,901 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:50:45,901 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:45,901 INFO L794 eck$LassoCheckResult]: Stem: 469#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_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_add~0, main_~zero~0, main_~sa~0, main_~sb~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~tmp___2~0, main_~tmp___3~0, main_~tmp___4~0, main_~tmp___5~0, main_~tmp___6~0, main_~tmp___7~0, main_~tmp___8~0, main_~tmp___9~0, main_~__retres23~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_add~0;havoc main_~zero~0;havoc main_~sa~0;havoc main_~sb~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~tmp___2~0;havoc main_~tmp___3~0;havoc main_~tmp___4~0;havoc main_~tmp___5~0;havoc main_~tmp___6~0;havoc main_~tmp___7~0;havoc main_~tmp___8~0;havoc main_~tmp___9~0;havoc main_~__retres23~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; 468#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 456#L69 base2flt_#res := base2flt_~__retres4~0; 457#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;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; 464#L19-1 assume !(0 == base2flt_~m % 4294967296); 467#L25-1 assume !(base2flt_~m % 4294967296 < 16777216); 461#L47-5 [2019-01-14 02:50:45,901 INFO L796 eck$LassoCheckResult]: Loop: 461#L47-5 assume !false; 449#L48-1 assume base2flt_~m % 4294967296 >= 33554432; 451#L49-1 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 461#L47-5 [2019-01-14 02:50:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash 921737699, now seen corresponding path program 1 times [2019-01-14 02:50:45,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:45,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:45,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:45,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash 136178, now seen corresponding path program 1 times [2019-01-14 02:50:45,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:45,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:45,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:45,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:45,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1761973968, now seen corresponding path program 1 times [2019-01-14 02:50:45,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:45,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:45,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:45,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:46,026 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:46,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:46,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:46,027 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:46,027 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:46,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:46,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:46,029 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:46,029 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-14 02:50:46,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:46,029 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:46,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:46,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:46,236 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:46,236 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:46,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:46,240 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:46,310 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:50:46,310 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:46,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:46,334 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:46,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:46,399 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:46,523 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:46,525 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:46,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:46,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:46,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:46,526 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:46,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:46,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:46,526 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:46,526 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-14 02:50:46,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:46,526 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:46,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:46,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:46,725 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:46,725 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:46,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:46,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:46,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:46,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:46,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:46,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:46,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:46,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:46,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:46,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:46,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:46,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:46,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:46,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:46,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:46,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:46,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:46,751 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:46,755 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:50:46,755 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:50:46,756 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:46,756 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:50:46,756 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:46,756 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-14 02:50:46,757 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:50:46,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:46,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:46,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:46,814 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:50:46,815 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:50:46,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 40 states and 50 transitions. Complement of second has 5 states. [2019-01-14 02:50:46,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:50:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2019-01-14 02:50:46,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:50:46,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:46,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:50:46,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:46,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:50:46,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:46,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. [2019-01-14 02:50:46,864 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-14 02:50:46,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 46 transitions. [2019-01-14 02:50:46,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-14 02:50:46,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-14 02:50:46,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2019-01-14 02:50:46,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:46,868 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-01-14 02:50:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2019-01-14 02:50:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-01-14 02:50:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 02:50:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-01-14 02:50:46,874 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-14 02:50:46,874 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-14 02:50:46,874 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:50:46,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2019-01-14 02:50:46,875 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-14 02:50:46,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:46,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:46,880 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:50:46,880 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:46,880 INFO L794 eck$LassoCheckResult]: Stem: 583#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_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_add~0, main_~zero~0, main_~sa~0, main_~sb~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~tmp___2~0, main_~tmp___3~0, main_~tmp___4~0, main_~tmp___5~0, main_~tmp___6~0, main_~tmp___7~0, main_~tmp___8~0, main_~tmp___9~0, main_~__retres23~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_add~0;havoc main_~zero~0;havoc main_~sa~0;havoc main_~sb~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~tmp___2~0;havoc main_~tmp___3~0;havoc main_~tmp___4~0;havoc main_~tmp___5~0;havoc main_~tmp___6~0;havoc main_~tmp___7~0;havoc main_~tmp___8~0;havoc main_~tmp___9~0;havoc main_~__retres23~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; 580#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 568#L69 base2flt_#res := base2flt_~__retres4~0; 569#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;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; 576#L19-1 assume !(0 == base2flt_~m % 4294967296); 579#L25-1 assume base2flt_~m % 4294967296 < 16777216; 584#L37-3 [2019-01-14 02:50:46,880 INFO L796 eck$LassoCheckResult]: Loop: 584#L37-3 assume !false; 574#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 575#L37-2 assume base2flt_~m % 4294967296 < 16777216; 584#L37-3 [2019-01-14 02:50:46,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:46,881 INFO L82 PathProgramCache]: Analyzing trace with hash 921737673, now seen corresponding path program 1 times [2019-01-14 02:50:46,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:46,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:46,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:46,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:46,920 INFO L82 PathProgramCache]: Analyzing trace with hash 110419, now seen corresponding path program 1 times [2019-01-14 02:50:46,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:46,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:46,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:46,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:46,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1761173643, now seen corresponding path program 1 times [2019-01-14 02:50:46,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:46,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:46,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:46,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:46,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:46,999 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:46,999 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:46,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:46,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:46,999 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:47,000 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:47,000 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:47,000 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:47,000 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-14 02:50:47,000 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:47,000 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:47,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:47,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:47,138 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:47,138 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:47,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:47,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:47,155 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:50:47,155 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:47,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:47,176 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:47,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:47,199 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:47,221 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:47,223 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:47,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:47,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:47,224 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:47,224 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:47,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:47,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:47,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:47,224 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-14 02:50:47,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:47,226 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:47,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:47,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:47,399 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:47,399 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:47,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:47,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:47,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:47,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:47,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:47,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:47,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:47,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:47,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:47,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:47,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:47,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:47,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:47,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:47,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:47,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:47,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:47,416 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:47,421 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:50:47,421 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:50:47,421 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:47,422 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:50:47,425 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:47,425 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-01-14 02:50:47,426 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:50:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:47,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:47,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:47,502 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:50:47,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-14 02:50:47,523 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 44 states and 55 transitions. Complement of second has 5 states. [2019-01-14 02:50:47,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:50:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2019-01-14 02:50:47,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:50:47,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:47,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:50:47,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:47,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:50:47,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:47,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2019-01-14 02:50:47,532 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-14 02:50:47,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 51 transitions. [2019-01-14 02:50:47,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-14 02:50:47,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-14 02:50:47,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-01-14 02:50:47,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:47,533 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-01-14 02:50:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-01-14 02:50:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-01-14 02:50:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 02:50:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-01-14 02:50:47,538 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-14 02:50:47,538 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-14 02:50:47,538 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:50:47,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2019-01-14 02:50:47,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:50:47,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:47,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:47,540 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:47,540 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:47,540 INFO L794 eck$LassoCheckResult]: Stem: 702#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_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_add~0, main_~zero~0, main_~sa~0, main_~sb~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~tmp___2~0, main_~tmp___3~0, main_~tmp___4~0, main_~tmp___5~0, main_~tmp___6~0, main_~tmp___7~0, main_~tmp___8~0, main_~tmp___9~0, main_~__retres23~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_add~0;havoc main_~zero~0;havoc main_~sa~0;havoc main_~sb~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~tmp___2~0;havoc main_~tmp___3~0;havoc main_~tmp___4~0;havoc main_~tmp___5~0;havoc main_~tmp___6~0;havoc main_~tmp___7~0;havoc main_~tmp___8~0;havoc main_~tmp___9~0;havoc main_~__retres23~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; 699#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 688#L69 base2flt_#res := base2flt_~__retres4~0; 689#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;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; 695#L19-1 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 690#L69-1 base2flt_#res := base2flt_~__retres4~0; 686#L70-1 main_#t~ret5 := base2flt_#res;main_~a~0 := main_#t~ret5;havoc main_#t~ret5;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; 687#L19-2 assume !(0 == base2flt_~m % 4294967296); 696#L25-2 assume !(base2flt_~m % 4294967296 < 16777216); 683#L47-8 [2019-01-14 02:50:47,541 INFO L796 eck$LassoCheckResult]: Loop: 683#L47-8 assume !false; 697#L48-2 assume base2flt_~m % 4294967296 >= 33554432; 682#L49-2 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 683#L47-8 [2019-01-14 02:50:47,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:47,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1760951196, now seen corresponding path program 1 times [2019-01-14 02:50:47,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:47,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:47,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:47,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:47,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:47,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:47,575 INFO L82 PathProgramCache]: Analyzing trace with hash 198737, now seen corresponding path program 1 times [2019-01-14 02:50:47,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:47,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:47,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:47,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1766695638, now seen corresponding path program 1 times [2019-01-14 02:50:47,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:47,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:47,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:47,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:47,726 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:50:47,776 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:47,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:47,776 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:47,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:47,776 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:47,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:47,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:47,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:47,777 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-14 02:50:47,777 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:47,777 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:47,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:47,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:48,294 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-14 02:50:48,372 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:48,372 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:48,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:48,380 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:48,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:48,402 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:48,424 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:48,426 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:48,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:48,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:48,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:48,427 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:48,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:48,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:48,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:48,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-14 02:50:48,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:48,427 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:48,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:48,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:48,546 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:48,546 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:48,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:48,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:48,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:48,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:48,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:48,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:48,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:48,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:48,554 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:48,557 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:50:48,557 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:50:48,557 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:48,558 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:50:48,558 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:48,558 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-14 02:50:48,558 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:50:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:48,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:48,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:48,645 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:50:48,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-14 02:50:48,659 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 4 states. [2019-01-14 02:50:48,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:50:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2019-01-14 02:50:48,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:50:48,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:48,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 02:50:48,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:48,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:50:48,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:48,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-01-14 02:50:48,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:50:48,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 34 transitions. [2019-01-14 02:50:48,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 02:50:48,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:50:48,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-01-14 02:50:48,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:48,665 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-14 02:50:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-01-14 02:50:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-14 02:50:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 02:50:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-01-14 02:50:48,670 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-14 02:50:48,671 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-14 02:50:48,672 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:50:48,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2019-01-14 02:50:48,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:50:48,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:48,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:48,674 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:48,674 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:50:48,675 INFO L794 eck$LassoCheckResult]: Stem: 815#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_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_add~0, main_~zero~0, main_~sa~0, main_~sb~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~tmp___2~0, main_~tmp___3~0, main_~tmp___4~0, main_~tmp___5~0, main_~tmp___6~0, main_~tmp___7~0, main_~tmp___8~0, main_~tmp___9~0, main_~__retres23~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_add~0;havoc main_~zero~0;havoc main_~sa~0;havoc main_~sb~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~tmp___2~0;havoc main_~tmp___3~0;havoc main_~tmp___4~0;havoc main_~tmp___5~0;havoc main_~tmp___6~0;havoc main_~tmp___7~0;havoc main_~tmp___8~0;havoc main_~tmp___9~0;havoc main_~__retres23~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; 812#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 800#L69 base2flt_#res := base2flt_~__retres4~0; 801#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;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; 809#L19-1 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 804#L69-1 base2flt_#res := base2flt_~__retres4~0; 802#L70-1 main_#t~ret5 := base2flt_#res;main_~a~0 := main_#t~ret5;havoc main_#t~ret5;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; 803#L19-2 assume !(0 == base2flt_~m % 4294967296); 810#L25-2 assume base2flt_~m % 4294967296 < 16777216; 814#L37-5 [2019-01-14 02:50:48,676 INFO L796 eck$LassoCheckResult]: Loop: 814#L37-5 assume !false; 798#L28-2 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 799#L37-4 assume base2flt_~m % 4294967296 < 16777216; 814#L37-5 [2019-01-14 02:50:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1760951170, now seen corresponding path program 1 times [2019-01-14 02:50:48,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:48,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:48,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:48,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:48,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:48,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:48,697 INFO L82 PathProgramCache]: Analyzing trace with hash 172978, now seen corresponding path program 1 times [2019-01-14 02:50:48,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:48,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:48,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1765895313, now seen corresponding path program 1 times [2019-01-14 02:50:48,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:48,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:48,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:48,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:48,765 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:48,765 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:48,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:48,765 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:48,765 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:48,765 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:48,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:48,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:48,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-14 02:50:48,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:48,766 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:48,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:48,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:48,889 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:48,890 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:48,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:48,926 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:48,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:48,951 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:48,991 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:48,993 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:48,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:48,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:48,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:48,993 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:48,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:48,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:48,994 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:48,994 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-14 02:50:48,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:48,994 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:48,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:49,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:49,101 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:49,102 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:49,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:49,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:49,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:49,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:49,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:49,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:49,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:49,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:49,108 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:49,111 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:50:49,111 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:50:49,112 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:49,112 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:50:49,112 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:49,112 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-01-14 02:50:49,112 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:50:49,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:49,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:49,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:49,197 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:50:49,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:50:49,203 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 30 states and 38 transitions. Complement of second has 4 states. [2019-01-14 02:50:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:50:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-01-14 02:50:49,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:50:49,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:49,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 02:50:49,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:49,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:50:49,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:49,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-01-14 02:50:49,206 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:50:49,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2019-01-14 02:50:49,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:50:49,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:50:49,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:50:49,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:49,207 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:50:49,207 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:50:49,207 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:50:49,207 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:50:49,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:50:49,207 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:50:49,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:50:49,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:50:49 BoogieIcfgContainer [2019-01-14 02:50:49,217 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:50:49,217 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:50:49,217 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:50:49,217 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:50:49,219 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:44" (3/4) ... [2019-01-14 02:50:49,223 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:50:49,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:50:49,225 INFO L168 Benchmark]: Toolchain (without parser) took 6720.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:50:49,226 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:50:49,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.59 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:50:49,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:50:49,228 INFO L168 Benchmark]: Boogie Preprocessor took 35.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:50:49,228 INFO L168 Benchmark]: RCFGBuilder took 974.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:50:49,229 INFO L168 Benchmark]: BuchiAutomizer took 5143.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.8 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:50:49,230 INFO L168 Benchmark]: Witness Printer took 5.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:50:49,235 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 438.59 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 974.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5143.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.8 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 5 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. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 3. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 272 SDtfs, 240 SDslu, 26 SDs, 0 SdLazy, 38 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf95 lsp57 ukn100 mio100 lsp100 div605 bol100 ite100 ukn100 eq131 hnf43 smp92 dnf100 smp100 tf105 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 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...