./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer --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 7e40a98558d0111ea95f3ee60a44cc14c7768182 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:47:02,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:47:02,155 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:47:02,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:47:02,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:47:02,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:47:02,162 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:47:02,163 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:47:02,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:47:02,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:47:02,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:47:02,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:47:02,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:47:02,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:47:02,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:47:02,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:47:02,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:47:02,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:47:02,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:47:02,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:47:02,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:47:02,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:47:02,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:47:02,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:47:02,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:47:02,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:47:02,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:47:02,177 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:47:02,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:47:02,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:47:02,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:47:02,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:47:02,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:47:02,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:47:02,179 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:47:02,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:47:02,180 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 10:47:02,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:47:02,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:47:02,190 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:47:02,190 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:47:02,190 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:47:02,190 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 10:47:02,190 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 10:47:02,191 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 10:47:02,191 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 10:47:02,191 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 10:47:02,191 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 10:47:02,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:47:02,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:47:02,191 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:47:02,192 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:47:02,192 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:47:02,192 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:47:02,192 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 10:47:02,192 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 10:47:02,192 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 10:47:02,192 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:47:02,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:47:02,193 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 10:47:02,193 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:47:02,193 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 10:47:02,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:47:02,193 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:47:02,193 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 10:47:02,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:47:02,194 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:47:02,194 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 10:47:02,195 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 10:47:02,195 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer 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 -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2018-12-09 10:47:02,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:47:02,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:47:02,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:47:02,228 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:47:02,228 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:47:02,229 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-09 10:47:02,267 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/data/2139f14ee/cde55b59c5514f32b0efa4b5b7716216/FLAGd729409fd [2018-12-09 10:47:02,693 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:47:02,693 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/sv-benchmarks/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-09 10:47:02,697 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/data/2139f14ee/cde55b59c5514f32b0efa4b5b7716216/FLAGd729409fd [2018-12-09 10:47:02,704 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/data/2139f14ee/cde55b59c5514f32b0efa4b5b7716216 [2018-12-09 10:47:02,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:47:02,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:47:02,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:47:02,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:47:02,711 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:47:02,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1782ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02, skipping insertion in model container [2018-12-09 10:47:02,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:47:02,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:47:02,807 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:47:02,809 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:47:02,817 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:47:02,824 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:47:02,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02 WrapperNode [2018-12-09 10:47:02,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:47:02,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:47:02,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:47:02,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:47:02,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:47:02,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:47:02,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:47:02,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:47:02,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (1/1) ... [2018-12-09 10:47:02,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:47:02,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:47:02,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:47:02,853 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:47:02,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/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 [2018-12-09 10:47:02,915 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-12-09 10:47:02,916 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-12-09 10:47:02,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:47:02,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:47:02,988 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:47:02,988 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 10:47:02,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:47:02 BoogieIcfgContainer [2018-12-09 10:47:02,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:47:02,989 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 10:47:02,989 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 10:47:02,991 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 10:47:02,992 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:47:02,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 10:47:02" (1/3) ... [2018-12-09 10:47:02,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@588239e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:47:02, skipping insertion in model container [2018-12-09 10:47:02,992 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:47:02,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:02" (2/3) ... [2018-12-09 10:47:02,993 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@588239e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:47:02, skipping insertion in model container [2018-12-09 10:47:02,993 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:47:02,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:47:02" (3/3) ... [2018-12-09 10:47:02,994 INFO L375 chiAutomizerObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-09 10:47:03,028 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:47:03,029 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 10:47:03,029 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 10:47:03,029 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 10:47:03,029 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:47:03,029 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:47:03,029 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 10:47:03,029 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:47:03,029 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 10:47:03,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-09 10:47:03,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:47:03,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:03,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:03,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:47:03,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:47:03,058 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 10:47:03,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-09 10:47:03,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:47:03,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:03,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:03,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:47:03,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:47:03,065 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6#L27true call main_#t~ret2 := fibonacci(main_~x~0);< 16#fibonacciENTRYtrue [2018-12-09 10:47:03,065 INFO L796 eck$LassoCheckResult]: Loop: 16#fibonacciENTRYtrue ~n := #in~n; 14#L15true assume !(~n < 1); 8#L17true assume !(1 == ~n); 5#L20true call #t~ret0 := fibonacci(~n - 1);< 16#fibonacciENTRYtrue [2018-12-09 10:47:03,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1426, now seen corresponding path program 1 times [2018-12-09 10:47:03,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:03,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:03,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 1 times [2018-12-09 10:47:03,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:03,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:03,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:03,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:03,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:03,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1316945065, now seen corresponding path program 1 times [2018-12-09 10:47:03,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:03,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:03,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:03,199 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:03,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:03,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:03,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:03,200 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:47:03,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:03,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:03,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:03,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-12-09 10:47:03,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:03,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:03,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,272 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:03,273 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:03,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:03,277 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:03,282 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:47:03,282 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/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 [2018-12-09 10:47:03,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:03,298 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:03,300 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:47:03,300 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/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 [2018-12-09 10:47:03,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:03,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:03,326 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:47:03,327 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/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 [2018-12-09 10:47:03,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:03,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:03,345 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:47:03,346 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/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 [2018-12-09 10:47:03,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:03,361 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/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 [2018-12-09 10:47:03,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:47:03,378 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:03,394 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:47:03,395 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:03,395 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:03,395 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:03,395 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:03,395 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:47:03,395 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:03,395 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:03,396 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:03,396 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-12-09 10:47:03,396 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:03,396 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:03,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,434 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:03,437 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:47:03,438 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 [2018-12-09 10:47:03,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:03,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:03,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:03,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:03,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:03,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:03,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:03,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:03,443 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 [2018-12-09 10:47:03,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:03,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:03,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:03,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:03,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:03,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:03,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:03,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:03,445 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 [2018-12-09 10:47:03,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:03,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:03,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:03,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:03,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:03,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:03,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:03,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:03,447 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 [2018-12-09 10:47:03,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:03,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:03,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:03,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:03,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:03,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:03,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:03,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:03,449 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 [2018-12-09 10:47:03,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:03,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:03,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:03,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:03,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:03,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:03,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:03,453 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:47:03,455 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:47:03,455 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:47:03,456 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:47:03,456 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:47:03,457 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:47:03,457 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2018-12-09 10:47:03,457 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:47:03,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:03,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:03,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:03,517 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:47:03,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2018-12-09 10:47:03,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2018-12-09 10:47:03,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:47:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-09 10:47:03,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-09 10:47:03,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:03,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 10:47:03,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:03,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-09 10:47:03,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:03,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-12-09 10:47:03,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:47:03,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 24 states and 33 transitions. [2018-12-09 10:47:03,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 10:47:03,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 10:47:03,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-12-09 10:47:03,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:03,593 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-09 10:47:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-12-09 10:47:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-09 10:47:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 10:47:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-12-09 10:47:03,610 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-09 10:47:03,610 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-09 10:47:03,610 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 10:47:03,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-12-09 10:47:03,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:47:03,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:03,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:03,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:03,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:03,612 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 120#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 128#fibonacciENTRY ~n := #in~n; 125#L15 assume !(~n < 1); 126#L17 assume !(1 == ~n); 118#L20 call #t~ret0 := fibonacci(~n - 1);< 119#fibonacciENTRY ~n := #in~n; 122#L15 assume ~n < 1;#res := 0; 123#fibonacciFINAL assume true; 121#fibonacciEXIT >#28#return; 116#L20-1 [2018-12-09 10:47:03,612 INFO L796 eck$LassoCheckResult]: Loop: 116#L20-1 call #t~ret1 := fibonacci(~n - 2);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume !(~n < 1); 131#L17 assume !(1 == ~n); 115#L20 call #t~ret0 := fibonacci(~n - 1);< 117#fibonacciENTRY ~n := #in~n; 133#L15 assume ~n < 1;#res := 0; 130#fibonacciFINAL assume true; 132#fibonacciEXIT >#28#return; 116#L20-1 [2018-12-09 10:47:03,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:03,612 INFO L82 PathProgramCache]: Analyzing trace with hash -940667652, now seen corresponding path program 1 times [2018-12-09 10:47:03,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:03,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:03,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:03,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:47:03,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:47:03,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:47:03,669 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:47:03,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:03,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1564066394, now seen corresponding path program 1 times [2018-12-09 10:47:03,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:03,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:03,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:03,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:47:03,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:47:03,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:47:03,697 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 10:47:03,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:47:03,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:47:03,700 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-09 10:47:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:03,745 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-12-09 10:47:03,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:47:03,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-12-09 10:47:03,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:47:03,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-12-09 10:47:03,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-09 10:47:03,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-09 10:47:03,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-12-09 10:47:03,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:03,749 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-09 10:47:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-12-09 10:47:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-09 10:47:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 10:47:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-09 10:47:03,752 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-09 10:47:03,752 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-09 10:47:03,752 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 10:47:03,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-12-09 10:47:03,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:47:03,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:03,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:03,754 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:03,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:03,754 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 184#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 191#fibonacciENTRY ~n := #in~n; 188#L15 assume !(~n < 1); 189#L17 assume !(1 == ~n); 183#L20 call #t~ret0 := fibonacci(~n - 1);< 185#fibonacciENTRY ~n := #in~n; 186#L15 assume !(~n < 1); 187#L17 assume 1 == ~n;#res := 1; 192#fibonacciFINAL assume true; 199#fibonacciEXIT >#28#return; 180#L20-1 [2018-12-09 10:47:03,755 INFO L796 eck$LassoCheckResult]: Loop: 180#L20-1 call #t~ret1 := fibonacci(~n - 2);< 182#fibonacciENTRY ~n := #in~n; 200#L15 assume !(~n < 1); 195#L17 assume !(1 == ~n); 179#L20 call #t~ret0 := fibonacci(~n - 1);< 182#fibonacciENTRY ~n := #in~n; 200#L15 assume !(~n < 1); 195#L17 assume 1 == ~n;#res := 1; 196#fibonacciFINAL assume true; 197#fibonacciEXIT >#28#return; 180#L20-1 [2018-12-09 10:47:03,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:03,755 INFO L82 PathProgramCache]: Analyzing trace with hash 904098378, now seen corresponding path program 1 times [2018-12-09 10:47:03,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:03,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:03,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:03,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:03,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:47:03,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:47:03,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:03,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:03,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:47:03,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 10:47:03,821 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:47:03,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1241393440, now seen corresponding path program 1 times [2018-12-09 10:47:03,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:03,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:03,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:03,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:03,889 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:03,889 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:03,889 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:03,889 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:03,889 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:47:03,890 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:03,890 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:03,890 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:03,890 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-12-09 10:47:03,890 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:03,890 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:03,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:03,925 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:03,925 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/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 [2018-12-09 10:47:03,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:03,927 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:03,929 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:47:03,930 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/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 [2018-12-09 10:47:03,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:03,945 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/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 [2018-12-09 10:47:03,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:47:03,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:04,577 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:47:04,578 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:04,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:04,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:04,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:04,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:47:04,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:04,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:04,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:04,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-12-09 10:47:04,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:04,579 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:04,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:04,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:04,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:04,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:04,611 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:04,611 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:47:04,611 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 [2018-12-09 10:47:04,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:04,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:04,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:04,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:04,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:04,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:04,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:04,616 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:47:04,618 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:47:04,618 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:47:04,618 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:47:04,618 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:47:04,618 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:47:04,618 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-12-09 10:47:04,619 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:47:04,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:04,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:04,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:04,710 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 10:47:04,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-12-09 10:47:04,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2018-12-09 10:47:04,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:47:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-12-09 10:47:04,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-09 10:47:04,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:04,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-12-09 10:47:04,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:04,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-12-09 10:47:04,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:04,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-12-09 10:47:04,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:47:04,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-12-09 10:47:04,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-12-09 10:47:04,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-09 10:47:04,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-12-09 10:47:04,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:04,811 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-12-09 10:47:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-12-09 10:47:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-12-09 10:47:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 10:47:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-12-09 10:47:04,819 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-12-09 10:47:04,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:47:04,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:47:04,819 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-12-09 10:47:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:04,871 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-12-09 10:47:04,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:47:04,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-12-09 10:47:04,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:47:04,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-12-09 10:47:04,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-09 10:47:04,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-09 10:47:04,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-12-09 10:47:04,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:04,876 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-12-09 10:47:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-12-09 10:47:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-12-09 10:47:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 10:47:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-12-09 10:47:04,883 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-09 10:47:04,883 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-09 10:47:04,883 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 10:47:04,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-12-09 10:47:04,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:47:04,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:04,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:04,885 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:04,885 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:04,885 INFO L794 eck$LassoCheckResult]: Stem: 706#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 696#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 711#fibonacciENTRY ~n := #in~n; 709#L15 assume !(~n < 1); 710#L17 assume !(1 == ~n); 695#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 714#L15 assume !(~n < 1); 718#L17 assume !(1 == ~n); 713#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 714#L15 assume !(~n < 1); 718#L17 assume !(1 == ~n); 713#L20 call #t~ret0 := fibonacci(~n - 1);< 697#fibonacciENTRY ~n := #in~n; 715#L15 assume !(~n < 1); 754#L17 assume 1 == ~n;#res := 1; 753#fibonacciFINAL assume true; 752#fibonacciEXIT >#28#return; 728#L20-1 call #t~ret1 := fibonacci(~n - 2);< 751#fibonacciENTRY ~n := #in~n; 781#L15 assume ~n < 1;#res := 0; 780#fibonacciFINAL assume true; 777#fibonacciEXIT >#30#return; 776#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 774#fibonacciFINAL assume true; 772#fibonacciEXIT >#28#return; 692#L20-1 [2018-12-09 10:47:04,885 INFO L796 eck$LassoCheckResult]: Loop: 692#L20-1 call #t~ret1 := fibonacci(~n - 2);< 694#fibonacciENTRY ~n := #in~n; 758#L15 assume !(~n < 1); 716#L17 assume !(1 == ~n); 691#L20 call #t~ret0 := fibonacci(~n - 1);< 694#fibonacciENTRY ~n := #in~n; 758#L15 assume !(~n < 1); 716#L17 assume 1 == ~n;#res := 1; 717#fibonacciFINAL assume true; 770#fibonacciEXIT >#28#return; 692#L20-1 [2018-12-09 10:47:04,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1397716613, now seen corresponding path program 1 times [2018-12-09 10:47:04,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:04,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:04,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 10:47:04,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:47:04,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:47:04,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:04,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 10:47:04,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:47:04,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 10:47:04,972 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:47:04,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1241393440, now seen corresponding path program 2 times [2018-12-09 10:47:04,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:04,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:04,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:04,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:04,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:05,032 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:05,032 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:05,032 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:05,032 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:05,033 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:47:05,033 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:05,033 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:05,033 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:05,033 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-12-09 10:47:05,033 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:05,033 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:05,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:05,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:05,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:05,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:05,060 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:05,060 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/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 [2018-12-09 10:47:05,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:05,062 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:05,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:47:05,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:05,368 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:47:05,370 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:05,370 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:05,370 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:05,370 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:05,371 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:47:05,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:05,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:05,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:05,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-12-09 10:47:05,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:05,371 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:05,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:05,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:05,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:05,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:05,405 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:05,406 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:47:05,406 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 [2018-12-09 10:47:05,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:05,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:05,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:05,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:05,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:05,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:05,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:05,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:05,409 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 [2018-12-09 10:47:05,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:05,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:05,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:05,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:05,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:05,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:05,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:05,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:05,411 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 [2018-12-09 10:47:05,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:05,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:05,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:05,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:05,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:05,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:05,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:05,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:05,413 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 [2018-12-09 10:47:05,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:05,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:05,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:05,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:05,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:05,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:05,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:05,417 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:47:05,418 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:47:05,419 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:47:05,419 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:47:05,419 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:47:05,419 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:47:05,419 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-12-09 10:47:05,419 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:47:05,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:05,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:05,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:05,495 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 10:47:05,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-09 10:47:05,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2018-12-09 10:47:05,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:47:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-12-09 10:47:05,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-09 10:47:05,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:05,588 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:47:05,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:05,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:05,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:05,655 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 10:47:05,655 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-09 10:47:05,734 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2018-12-09 10:47:05,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:47:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-12-09 10:47:05,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-09 10:47:05,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:05,735 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:47:05,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:05,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:05,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:05,804 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 10:47:05,804 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-12-09 10:47:05,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2018-12-09 10:47:05,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:47:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-12-09 10:47:05,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-12-09 10:47:05,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:05,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-12-09 10:47:05,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:05,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-12-09 10:47:05,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:05,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-12-09 10:47:05,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-09 10:47:05,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-12-09 10:47:05,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-12-09 10:47:05,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-12-09 10:47:05,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-12-09 10:47:05,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:05,932 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-12-09 10:47:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-12-09 10:47:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-12-09 10:47:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-09 10:47:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-12-09 10:47:05,958 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-12-09 10:47:05,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 10:47:05,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:47:05,959 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-12-09 10:47:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:06,086 INFO L93 Difference]: Finished difference Result 497 states and 785 transitions. [2018-12-09 10:47:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 10:47:06,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 785 transitions. [2018-12-09 10:47:06,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-09 10:47:06,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 782 transitions. [2018-12-09 10:47:06,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-12-09 10:47:06,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-12-09 10:47:06,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 782 transitions. [2018-12-09 10:47:06,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:06,096 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 782 transitions. [2018-12-09 10:47:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 782 transitions. [2018-12-09 10:47:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 369. [2018-12-09 10:47:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-09 10:47:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 522 transitions. [2018-12-09 10:47:06,108 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-12-09 10:47:06,108 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 522 transitions. [2018-12-09 10:47:06,108 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 10:47:06,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 522 transitions. [2018-12-09 10:47:06,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-09 10:47:06,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:06,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:06,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:06,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:47:06,110 INFO L794 eck$LassoCheckResult]: Stem: 3550#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 3551#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 3552#fibonacciENTRY ~n := #in~n; 3592#L15 assume !(~n < 1); 3591#L17 assume !(1 == ~n); 3587#L20 call #t~ret0 := fibonacci(~n - 1);< 3589#fibonacciENTRY ~n := #in~n; 3590#L15 assume !(~n < 1); 3586#L17 assume !(1 == ~n); 3554#L20 call #t~ret0 := fibonacci(~n - 1);< 3583#fibonacciENTRY ~n := #in~n; 3584#L15 assume !(~n < 1); 3588#L17 assume !(1 == ~n); 3555#L20 call #t~ret0 := fibonacci(~n - 1);< 3583#fibonacciENTRY ~n := #in~n; 3585#L15 assume !(~n < 1); 3553#L17 assume 1 == ~n;#res := 1; 3556#fibonacciFINAL assume true; 3627#fibonacciEXIT >#28#return; 3609#L20-1 call #t~ret1 := fibonacci(~n - 2);< 3617#fibonacciENTRY ~n := #in~n; 3726#L15 assume !(~n < 1); 3657#L17 assume !(1 == ~n); 3659#L20 call #t~ret0 := fibonacci(~n - 1);< 3880#fibonacciENTRY ~n := #in~n; 3884#L15 assume !(~n < 1); 3882#L17 assume !(1 == ~n); 3579#L20 call #t~ret0 := fibonacci(~n - 1);< 3582#fibonacciENTRY [2018-12-09 10:47:06,110 INFO L796 eck$LassoCheckResult]: Loop: 3582#fibonacciENTRY ~n := #in~n; 3577#L15 assume !(~n < 1); 3581#L17 assume !(1 == ~n); 3578#L20 call #t~ret0 := fibonacci(~n - 1);< 3582#fibonacciENTRY [2018-12-09 10:47:06,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1149422575, now seen corresponding path program 1 times [2018-12-09 10:47:06,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:06,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:06,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:06,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:06,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 10:47:06,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:47:06,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:47:06,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:06,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 10:47:06,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:47:06,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-12-09 10:47:06,228 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:47:06,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:06,228 INFO L82 PathProgramCache]: Analyzing trace with hash 927640, now seen corresponding path program 2 times [2018-12-09 10:47:06,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:06,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:06,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:06,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:06,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:06,245 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:06,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:06,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:06,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:06,245 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:47:06,245 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:06,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:06,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:06,246 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-12-09 10:47:06,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:06,246 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:06,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:06,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:06,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:06,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:06,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:06,271 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:06,271 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:06,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:06,273 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:06,275 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:47:06,275 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:06,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:06,290 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:06,292 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:47:06,292 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:06,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:06,307 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:06,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:47:06,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:06,339 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:47:06,341 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:06,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:06,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:06,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:06,341 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:47:06,341 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:06,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:06,341 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:06,341 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-12-09 10:47:06,341 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:06,341 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:06,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:06,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:06,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:06,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:06,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:06,367 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:06,367 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:47:06,368 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 [2018-12-09 10:47:06,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:06,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:06,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:06,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:06,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:06,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:06,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:06,370 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:47:06,371 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:47:06,371 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:47:06,371 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:47:06,371 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:47:06,371 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:47:06,371 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2018-12-09 10:47:06,371 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:47:06,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:06,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:06,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:06,428 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-09 10:47:06,428 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-09 10:47:06,467 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-12-09 10:47:06,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:47:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-09 10:47:06,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-09 10:47:06,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:06,468 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:47:06,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:06,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:06,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:06,533 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-09 10:47:06,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-09 10:47:06,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 379 states and 532 transitions. Complement of second has 13 states. [2018-12-09 10:47:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:47:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-09 10:47:06,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-09 10:47:06,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:06,566 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:47:06,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:06,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:06,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:06,631 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-09 10:47:06,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160 Second operand 5 states. [2018-12-09 10:47:06,673 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 522 transitions. cyclomatic complexity: 160. Second operand 5 states. Result 494 states and 656 transitions. Complement of second has 14 states. [2018-12-09 10:47:06,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:47:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-09 10:47:06,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-09 10:47:06,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:06,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-09 10:47:06,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:06,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-12-09 10:47:06,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:06,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 656 transitions. [2018-12-09 10:47:06,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-12-09 10:47:06,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 407 states and 567 transitions. [2018-12-09 10:47:06,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-12-09 10:47:06,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-12-09 10:47:06,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 567 transitions. [2018-12-09 10:47:06,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:06,681 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 567 transitions. [2018-12-09 10:47:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 567 transitions. [2018-12-09 10:47:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2018-12-09 10:47:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-09 10:47:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 546 transitions. [2018-12-09 10:47:06,689 INFO L728 BuchiCegarLoop]: Abstraction has 393 states and 546 transitions. [2018-12-09 10:47:06,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 10:47:06,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:47:06,690 INFO L87 Difference]: Start difference. First operand 393 states and 546 transitions. Second operand 14 states. [2018-12-09 10:47:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:06,824 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2018-12-09 10:47:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 10:47:06,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 348 transitions. [2018-12-09 10:47:06,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 10:47:06,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 244 states and 313 transitions. [2018-12-09 10:47:06,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-12-09 10:47:06,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-12-09 10:47:06,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 313 transitions. [2018-12-09 10:47:06,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:06,829 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-12-09 10:47:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 313 transitions. [2018-12-09 10:47:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 203. [2018-12-09 10:47:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-09 10:47:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-12-09 10:47:06,835 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-09 10:47:06,835 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-09 10:47:06,836 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 10:47:06,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 260 transitions. [2018-12-09 10:47:06,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 10:47:06,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:06,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:06,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:47:06,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:47:06,838 INFO L794 eck$LassoCheckResult]: Stem: 6312#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 6313#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 6314#fibonacciENTRY ~n := #in~n; 6403#L15 assume !(~n < 1); 6402#L17 assume !(1 == ~n); 6398#L20 call #t~ret0 := fibonacci(~n - 1);< 6401#fibonacciENTRY ~n := #in~n; 6400#L15 assume !(~n < 1); 6399#L17 assume !(1 == ~n); 6393#L20 call #t~ret0 := fibonacci(~n - 1);< 6397#fibonacciENTRY ~n := #in~n; 6395#L15 assume !(~n < 1); 6396#L17 assume !(1 == ~n); 6334#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6392#L15 assume !(~n < 1); 6394#L17 assume !(1 == ~n); 6333#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6392#L15 assume !(~n < 1); 6394#L17 assume !(1 == ~n); 6333#L20 call #t~ret0 := fibonacci(~n - 1);< 6391#fibonacciENTRY ~n := #in~n; 6387#L15 assume !(~n < 1); 6388#L17 assume 1 == ~n;#res := 1; 6493#fibonacciFINAL assume true; 6492#fibonacciEXIT >#28#return; 6308#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6315#fibonacciENTRY ~n := #in~n; 6307#L15 assume ~n < 1;#res := 0; 6309#fibonacciFINAL assume true; 6495#fibonacciEXIT >#30#return; 6297#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6482#fibonacciFINAL assume true; 6468#fibonacciEXIT >#28#return; 6296#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6466#fibonacciENTRY ~n := #in~n; 6485#L15 assume !(~n < 1); 6336#L17 assume !(1 == ~n); 6320#L20 call #t~ret0 := fibonacci(~n - 1);< 6303#fibonacciENTRY ~n := #in~n; 6382#L15 assume !(~n < 1); 6373#L17 assume !(1 == ~n); 6352#L20 call #t~ret0 := fibonacci(~n - 1);< 6355#fibonacciENTRY ~n := #in~n; 6371#L15 assume !(~n < 1); 6369#L17 assume !(1 == ~n); 6354#L20 [2018-12-09 10:47:06,838 INFO L796 eck$LassoCheckResult]: Loop: 6354#L20 call #t~ret0 := fibonacci(~n - 1);< 6355#fibonacciENTRY ~n := #in~n; 6371#L15 assume !(~n < 1); 6369#L17 assume !(1 == ~n); 6354#L20 [2018-12-09 10:47:06,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:06,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1438652912, now seen corresponding path program 2 times [2018-12-09 10:47:06,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:06,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:06,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:06,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:06,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 90 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-09 10:47:06,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:47:06,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:47:06,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:47:06,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:47:06,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:47:06,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 73 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 10:47:07,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:47:07,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-12-09 10:47:07,008 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:47:07,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 3 times [2018-12-09 10:47:07,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:07,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:07,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:07,031 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:07,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:07,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:07,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:07,031 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:47:07,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:07,031 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:07,031 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:07,031 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2018-12-09 10:47:07,031 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:07,031 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:07,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:07,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:07,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:07,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:07,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:07,056 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:07,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:07,058 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:07,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:47:07,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:07,874 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:47:07,876 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:07,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:07,877 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:07,877 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:07,877 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:47:07,877 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:07,877 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:07,877 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:07,877 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2018-12-09 10:47:07,877 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:07,877 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:07,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:07,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:07,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:07,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:07,911 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:07,911 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:47:07,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:47:07,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:07,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:07,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:07,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:07,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:07,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:07,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:07,914 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:47:07,915 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:47:07,915 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:47:07,915 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:47:07,915 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:47:07,915 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:47:07,915 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-12-09 10:47:07,915 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:47:07,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:07,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:07,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:07,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 10:47:07,993 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-09 10:47:08,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 215 states and 273 transitions. Complement of second has 18 states. [2018-12-09 10:47:08,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:47:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-09 10:47:08,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-09 10:47:08,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:08,027 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:47:08,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:08,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:08,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:08,106 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 10:47:08,106 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-09 10:47:08,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 221 states and 279 transitions. Complement of second has 17 states. [2018-12-09 10:47:08,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:47:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-09 10:47:08,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-09 10:47:08,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:08,154 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:47:08,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:08,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:08,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:08,229 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 10:47:08,229 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-12-09 10:47:08,261 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 260 transitions. cyclomatic complexity: 61. Second operand 6 states. Result 271 states and 343 transitions. Complement of second has 27 states. [2018-12-09 10:47:08,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:47:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-09 10:47:08,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 4 letters. [2018-12-09 10:47:08,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:08,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 51 letters. Loop has 4 letters. [2018-12-09 10:47:08,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:08,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 47 letters. Loop has 8 letters. [2018-12-09 10:47:08,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:08,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 343 transitions. [2018-12-09 10:47:08,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 10:47:08,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 207 states and 265 transitions. [2018-12-09 10:47:08,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-12-09 10:47:08,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-12-09 10:47:08,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 265 transitions. [2018-12-09 10:47:08,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:08,265 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 265 transitions. [2018-12-09 10:47:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 265 transitions. [2018-12-09 10:47:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-12-09 10:47:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-09 10:47:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2018-12-09 10:47:08,268 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 260 transitions. [2018-12-09 10:47:08,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 10:47:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-12-09 10:47:08,269 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand 20 states. [2018-12-09 10:47:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:08,459 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2018-12-09 10:47:08,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 10:47:08,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 458 transitions. [2018-12-09 10:47:08,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 10:47:08,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 315 states and 426 transitions. [2018-12-09 10:47:08,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-12-09 10:47:08,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-12-09 10:47:08,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 426 transitions. [2018-12-09 10:47:08,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:08,466 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 426 transitions. [2018-12-09 10:47:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 426 transitions. [2018-12-09 10:47:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 282. [2018-12-09 10:47:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-09 10:47:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-12-09 10:47:08,473 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-09 10:47:08,473 INFO L608 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-09 10:47:08,473 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 10:47:08,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2018-12-09 10:47:08,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 10:47:08,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:08,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:08,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 10, 9, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-12-09 10:47:08,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:47:08,476 INFO L794 eck$LassoCheckResult]: Stem: 8511#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 9; 8512#L27 call main_#t~ret2 := fibonacci(main_~x~0);< 8513#fibonacciENTRY ~n := #in~n; 8603#L15 assume !(~n < 1); 8601#L17 assume !(1 == ~n); 8598#L20 call #t~ret0 := fibonacci(~n - 1);< 8599#fibonacciENTRY ~n := #in~n; 8615#L15 assume !(~n < 1); 8613#L17 assume !(1 == ~n); 8609#L20 call #t~ret0 := fibonacci(~n - 1);< 8612#fibonacciENTRY ~n := #in~n; 8669#L15 assume !(~n < 1); 8666#L17 assume !(1 == ~n); 8605#L20 call #t~ret0 := fibonacci(~n - 1);< 8610#fibonacciENTRY ~n := #in~n; 8630#L15 assume !(~n < 1); 8627#L17 assume !(1 == ~n); 8503#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8720#L15 assume !(~n < 1); 8702#L17 assume !(1 == ~n); 8502#L20 call #t~ret0 := fibonacci(~n - 1);< 8504#fibonacciENTRY ~n := #in~n; 8722#L15 assume !(~n < 1); 8772#L17 assume 1 == ~n;#res := 1; 8771#fibonacciFINAL assume true; 8769#fibonacciEXIT >#28#return; 8531#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8532#fibonacciENTRY ~n := #in~n; 8764#L15 assume ~n < 1;#res := 0; 8762#fibonacciFINAL assume true; 8760#fibonacciEXIT >#30#return; 8759#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8756#fibonacciFINAL assume true; 8752#fibonacciEXIT >#28#return; 8747#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8749#fibonacciENTRY ~n := #in~n; 8758#L15 assume !(~n < 1); 8754#L17 assume 1 == ~n;#res := 1; 8750#fibonacciFINAL assume true; 8746#fibonacciEXIT >#30#return; 8742#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 8740#fibonacciFINAL assume true; 8735#fibonacciEXIT >#28#return; 8618#L20-1 call #t~ret1 := fibonacci(~n - 2);< 8621#fibonacciENTRY ~n := #in~n; 8757#L15 assume !(~n < 1); 8753#L17 assume !(1 == ~n); 8507#L20 call #t~ret0 := fibonacci(~n - 1);< 8501#fibonacciENTRY ~n := #in~n; 8509#L15 assume !(~n < 1); 8510#L17 assume !(1 == ~n); 8551#L20 call #t~ret0 := fibonacci(~n - 1);< 8554#fibonacciENTRY ~n := #in~n; 8570#L15 assume !(~n < 1); 8569#L17 assume !(1 == ~n); 8552#L20 [2018-12-09 10:47:08,476 INFO L796 eck$LassoCheckResult]: Loop: 8552#L20 call #t~ret0 := fibonacci(~n - 1);< 8554#fibonacciENTRY ~n := #in~n; 8570#L15 assume !(~n < 1); 8569#L17 assume !(1 == ~n); 8552#L20 [2018-12-09 10:47:08,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:08,477 INFO L82 PathProgramCache]: Analyzing trace with hash -570292781, now seen corresponding path program 3 times [2018-12-09 10:47:08,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:08,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:08,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:08,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:08,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 153 proven. 80 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 10:47:08,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:47:08,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:47:08,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 10:47:08,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-09 10:47:08,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:47:08,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 144 proven. 21 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-09 10:47:08,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:47:08,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 24 [2018-12-09 10:47:08,678 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:47:08,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1728010, now seen corresponding path program 4 times [2018-12-09 10:47:08,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:08,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:08,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:08,704 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:08,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:08,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:08,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:08,704 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:47:08,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:08,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:08,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:08,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2018-12-09 10:47:08,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:08,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:08,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:08,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:08,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:08,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:08,732 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:08,732 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:08,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:08,734 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:08,735 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:47:08,735 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:08,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:47:08,750 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ed67f6-6e06-4cee-8e4c-6a8e1fbddfe6/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:08,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:47:08,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:47:09,981 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:47:09,983 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:47:09,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:47:09,983 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:47:09,983 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:47:09,983 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:47:09,983 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:47:09,983 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:47:09,983 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:47:09,983 INFO L131 ssoRankerPreferences]: Filename of dumped script: Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2018-12-09 10:47:09,983 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:47:09,983 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:47:09,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:09,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:09,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:09,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:47:10,014 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:47:10,014 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:47:10,014 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 [2018-12-09 10:47:10,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:10,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:10,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:10,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:10,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:10,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:10,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:10,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:47:10,016 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 [2018-12-09 10:47:10,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:47:10,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:47:10,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:47:10,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:47:10,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:47:10,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:47:10,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:47:10,017 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:47:10,018 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:47:10,018 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:47:10,018 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:47:10,018 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:47:10,018 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:47:10,018 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2018-12-09 10:47:10,019 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:47:10,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:10,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:10,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:10,107 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 10:47:10,107 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-09 10:47:10,139 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 297 states and 399 transitions. Complement of second has 18 states. [2018-12-09 10:47:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:47:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2018-12-09 10:47:10,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-09 10:47:10,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:10,139 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:47:10,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:10,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:10,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:10,220 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 10:47:10,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-09 10:47:10,263 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 303 states and 405 transitions. Complement of second has 17 states. [2018-12-09 10:47:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:47:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-09 10:47:10,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-09 10:47:10,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:10,264 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:47:10,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:10,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:10,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:47:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:10,333 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 10:47:10,333 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105 Second operand 6 states. [2018-12-09 10:47:10,373 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 383 transitions. cyclomatic complexity: 105. Second operand 6 states. Result 361 states and 481 transitions. Complement of second has 27 states. [2018-12-09 10:47:10,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 10:47:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:47:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-09 10:47:10,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 4 letters. [2018-12-09 10:47:10,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:10,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 68 letters. Loop has 4 letters. [2018-12-09 10:47:10,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:10,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 64 letters. Loop has 8 letters. [2018-12-09 10:47:10,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:47:10,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 481 transitions. [2018-12-09 10:47:10,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 10:47:10,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 286 states and 388 transitions. [2018-12-09 10:47:10,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-12-09 10:47:10,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-12-09 10:47:10,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 388 transitions. [2018-12-09 10:47:10,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:47:10,378 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 388 transitions. [2018-12-09 10:47:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 388 transitions. [2018-12-09 10:47:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-12-09 10:47:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-09 10:47:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2018-12-09 10:47:10,382 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2018-12-09 10:47:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 10:47:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-12-09 10:47:10,383 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand 24 states. [2018-12-09 10:47:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:10,672 INFO L93 Difference]: Finished difference Result 433 states and 595 transitions. [2018-12-09 10:47:10,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 10:47:10,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 595 transitions. [2018-12-09 10:47:10,675 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:47:10,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 0 states and 0 transitions. [2018-12-09 10:47:10,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 10:47:10,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 10:47:10,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 10:47:10,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:47:10,676 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:47:10,676 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:47:10,676 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:47:10,676 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 10:47:10,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 10:47:10,676 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:47:10,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 10:47:10,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 10:47:10 BoogieIcfgContainer [2018-12-09 10:47:10,682 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 10:47:10,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:47:10,682 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:47:10,682 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:47:10,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:47:02" (3/4) ... [2018-12-09 10:47:10,685 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 10:47:10,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:47:10,685 INFO L168 Benchmark]: Toolchain (without parser) took 7978.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -48.8 MB). Peak memory consumption was 116.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:47:10,686 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:47:10,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.19 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:47:10,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:47:10,688 INFO L168 Benchmark]: Boogie Preprocessor took 9.49 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:47:10,688 INFO L168 Benchmark]: RCFGBuilder took 135.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-09 10:47:10,688 INFO L168 Benchmark]: BuchiAutomizer took 7692.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.0 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:47:10,689 INFO L168 Benchmark]: Witness Printer took 3.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:47:10,691 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.19 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.49 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 135.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7692.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.0 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 12 terminating modules (6 trivial, 2 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 8 iterations. TraceHistogramMax:13. Analysis of lassos took 4.7s. Construction of modules took 0.6s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 330 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 369 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 238 SDtfs, 740 SDslu, 328 SDs, 0 SdLazy, 1266 SolverSat, 569 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf98 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf92 smp81 dnf100 smp100 tf109 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...