./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 cd6d4490a7412402195d3193de0347508566f7c8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 04:06:02,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:06:02,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:06:02,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:06:02,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:06:02,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:06:02,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:06:02,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:06:02,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:06:02,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:06:02,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:06:02,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:06:02,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:06:02,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:06:02,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:06:02,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:06:02,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:06:02,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:06:02,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:06:02,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:06:02,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:06:02,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:06:02,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:06:02,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:06:02,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:06:02,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:06:02,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:06:02,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:06:02,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:06:02,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:06:02,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:06:02,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:06:02,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:06:02,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:06:02,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:06:02,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:06:02,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:06:02,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:06:02,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:06:02,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:06:02,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:06:02,995 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 04:06:03,012 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:06:03,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:06:03,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:06:03,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:06:03,014 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:06:03,015 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 04:06:03,015 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 04:06:03,015 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 04:06:03,015 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 04:06:03,016 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 04:06:03,016 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 04:06:03,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:06:03,017 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:06:03,017 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 04:06:03,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:06:03,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:06:03,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:06:03,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 04:06:03,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 04:06:03,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 04:06:03,019 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:06:03,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:06:03,019 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 04:06:03,020 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:06:03,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 04:06:03,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:06:03,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:06:03,021 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 04:06:03,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:06:03,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:06:03,022 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 04:06:03,023 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 04:06:03,023 INFO L138 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/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 -> cd6d4490a7412402195d3193de0347508566f7c8 [2019-11-20 04:06:03,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:06:03,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:06:03,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:06:03,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:06:03,242 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:06:03,242 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-11-20 04:06:03,310 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/data/635ab6c45/ea376889868940918c2fa58a884445fb/FLAGca068d1f9 [2019-11-20 04:06:03,781 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:06:03,782 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-11-20 04:06:03,789 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/data/635ab6c45/ea376889868940918c2fa58a884445fb/FLAGca068d1f9 [2019-11-20 04:06:04,171 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/data/635ab6c45/ea376889868940918c2fa58a884445fb [2019-11-20 04:06:04,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:06:04,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:06:04,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:06:04,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:06:04,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:06:04,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15dfff6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04, skipping insertion in model container [2019-11-20 04:06:04,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,192 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:06:04,209 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:06:04,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:06:04,393 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:06:04,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:06:04,502 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:06:04,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04 WrapperNode [2019-11-20 04:06:04,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:06:04,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:06:04,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:06:04,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:06:04,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:06:04,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:06:04,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:06:04,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:06:04,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (1/1) ... [2019-11-20 04:06:04,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:06:04,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:06:04,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:06:04,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:06:04,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 [2019-11-20 04:06:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:06:04,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:06:04,637 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-20 04:06:04,637 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-20 04:06:04,637 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-20 04:06:04,637 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-20 04:06:04,841 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:06:04,843 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 04:06:04,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:04 BoogieIcfgContainer [2019-11-20 04:06:04,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:06:04,845 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 04:06:04,846 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 04:06:04,853 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 04:06:04,854 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 04:06:04,854 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 04:06:04" (1/3) ... [2019-11-20 04:06:04,855 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1177e686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 04:06:04, skipping insertion in model container [2019-11-20 04:06:04,856 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 04:06:04,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:04" (2/3) ... [2019-11-20 04:06:04,856 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1177e686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 04:06:04, skipping insertion in model container [2019-11-20 04:06:04,857 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 04:06:04,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:04" (3/3) ... [2019-11-20 04:06:04,859 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_8-1.c [2019-11-20 04:06:04,915 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 04:06:04,915 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 04:06:04,915 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 04:06:04,916 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:06:04,916 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:06:04,916 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 04:06:04,916 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:06:04,916 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 04:06:04,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-20 04:06:04,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-20 04:06:04,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:04,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:04,985 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 04:06:04,985 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:04,985 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 04:06:04,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-20 04:06:04,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-20 04:06:04,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:04,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:04,989 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 04:06:04,990 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:04,996 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2019-11-20 04:06:04,997 INFO L796 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2019-11-20 04:06:05,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:05,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2019-11-20 04:06:05,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:05,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432491792] [2019-11-20 04:06:05,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:05,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:06:05,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:05,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2019-11-20 04:06:05,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:05,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624693381] [2019-11-20 04:06:05,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:05,143 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:06:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2019-11-20 04:06:05,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:05,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628675685] [2019-11-20 04:06:05,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:05,175 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:06:05,420 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:05,421 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:05,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:05,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:05,422 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 04:06:05,422 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:05,422 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:05,422 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:05,422 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration1_Loop [2019-11-20 04:06:05,423 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:05,423 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:05,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,615 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:05,616 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:05,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:05,626 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:05,638 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:05,638 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:05,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:05,658 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:05,663 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:05,663 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:05,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:05,686 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:05,691 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:05,692 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:05,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:05,711 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:05,718 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:05,718 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:05,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:05,734 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:05,740 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:05,741 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 [2019-11-20 04:06:05,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:05,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:05,751 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:05,751 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:05,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:05,757 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:05,761 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:05,761 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 [2019-11-20 04:06:05,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:05,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:05,791 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:05,791 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 [2019-11-20 04:06:05,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:05,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:05,806 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:05,806 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:05,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:05,833 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:05,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 04:06:05,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:05,924 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 04:06:05,926 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:05,927 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:05,927 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:05,927 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:05,927 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 04:06:05,927 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:05,927 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:05,927 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:05,928 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration1_Loop [2019-11-20 04:06:05,928 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:05,928 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:05,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:05,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:06,061 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:06,066 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:06,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:06,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:06,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:06,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:06,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:06,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:06,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:06,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:06,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:06,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:06,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:06,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:06,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:06,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:06,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:06,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:06,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:06,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:06,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:06,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:06,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:06,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:06,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:06,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:06,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:06,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:06,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 [2019-11-20 04:06:06,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:06,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:06,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:06,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:06,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:06,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:06,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:06,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:06,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 [2019-11-20 04:06:06,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:06,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:06,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:06,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:06,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:06,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:06,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:06,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:06,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 [2019-11-20 04:06:06,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:06,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:06,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:06,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:06,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:06,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:06,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:06,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:06,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 [2019-11-20 04:06:06,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:06,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:06,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:06,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:06,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:06,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:06,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:06,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:06,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:06,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:06,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:06,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:06,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:06,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:06,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:06,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:06,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:06,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:06,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:06,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:06,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:06,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:06,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:06,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:06,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:06,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:06,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 04:06:06,259 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-20 04:06:06,259 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:06,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 04:06:06,275 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 04:06:06,275 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 04:06:06,276 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2019-11-20 04:06:06,283 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:06,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 04:06:06,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:06,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 04:06:06,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:06,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-20 04:06:06,512 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2019-11-20 04:06:06,861 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 83 states and 115 transitions. Complement of second has 24 states. [2019-11-20 04:06:06,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-20 04:06:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2019-11-20 04:06:06,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-20 04:06:06,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:06,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-20 04:06:06,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:06,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-20 04:06:06,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:06,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. [2019-11-20 04:06:06,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-20 04:06:06,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2019-11-20 04:06:06,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-20 04:06:06,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-20 04:06:06,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-11-20 04:06:06,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:06,936 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-11-20 04:06:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-11-20 04:06:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-11-20 04:06:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 04:06:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-11-20 04:06:06,995 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-20 04:06:06,995 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-20 04:06:06,995 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 04:06:06,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-11-20 04:06:07,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-20 04:06:07,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:07,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:07,005 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:07,005 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:07,006 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 205#L37 call main_#t~ret4 := fibo1(main_~x~0);< 211#fibo1ENTRY ~n := #in~n; 223#L8 assume !(~n < 1); 204#L10 assume !(1 == ~n); 199#L13 call #t~ret0 := fibo2(~n - 1);< 216#fibo2ENTRY ~n := #in~n; 228#L18 assume !(~n < 1); 243#L20 assume !(1 == ~n); 195#L23 call #t~ret2 := fibo1(~n - 1);< 198#fibo1ENTRY ~n := #in~n; 225#L8 assume ~n < 1;#res := 0; 202#fibo1FINAL assume true; 214#fibo1EXIT >#45#return; 210#L23-1 [2019-11-20 04:06:07,006 INFO L796 eck$LassoCheckResult]: Loop: 210#L23-1 call #t~ret3 := fibo1(~n - 2);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume !(~n < 1); 237#L10 assume !(1 == ~n); 193#L13 call #t~ret0 := fibo2(~n - 1);< 236#fibo2ENTRY ~n := #in~n; 238#L18 assume !(~n < 1); 233#L20 assume !(1 == ~n); 191#L23 call #t~ret2 := fibo1(~n - 1);< 194#fibo1ENTRY ~n := #in~n; 239#L8 assume ~n < 1;#res := 0; 220#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 210#L23-1 [2019-11-20 04:06:07,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:07,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2019-11-20 04:06:07,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:07,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146096528] [2019-11-20 04:06:07,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:07,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146096528] [2019-11-20 04:06:07,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801146854] [2019-11-20 04:06:07,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:07,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:06:07,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:07,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:07,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-20 04:06:07,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583166367] [2019-11-20 04:06:07,280 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:07,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2019-11-20 04:06:07,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:07,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298537697] [2019-11-20 04:06:07,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 04:06:07,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298537697] [2019-11-20 04:06:07,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:06:07,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:06:07,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940600194] [2019-11-20 04:06:07,399 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 04:06:07,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:07,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:06:07,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:06:07,404 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-11-20 04:06:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:07,510 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-11-20 04:06:07,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:06:07,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2019-11-20 04:06:07,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-20 04:06:07,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2019-11-20 04:06:07,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-20 04:06:07,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-20 04:06:07,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2019-11-20 04:06:07,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:07,520 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-11-20 04:06:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2019-11-20 04:06:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-11-20 04:06:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-20 04:06:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-11-20 04:06:07,533 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-20 04:06:07,534 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-20 04:06:07,534 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 04:06:07,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-11-20 04:06:07,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-20 04:06:07,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:07,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:07,542 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:07,542 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:07,543 INFO L794 eck$LassoCheckResult]: Stem: 409#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 387#L37 call main_#t~ret4 := fibo1(main_~x~0);< 388#fibo1ENTRY ~n := #in~n; 410#L8 assume !(~n < 1); 428#L10 assume !(1 == ~n); 383#L13 call #t~ret0 := fibo2(~n - 1);< 402#fibo2ENTRY ~n := #in~n; 430#L18 assume !(~n < 1); 431#L20 assume !(1 == ~n); 381#L23 call #t~ret2 := fibo1(~n - 1);< 386#fibo1ENTRY ~n := #in~n; 412#L8 assume !(~n < 1); 389#L10 assume 1 == ~n;#res := 1; 390#fibo1FINAL assume true; 406#fibo1EXIT >#45#return; 397#L23-1 [2019-11-20 04:06:07,543 INFO L796 eck$LassoCheckResult]: Loop: 397#L23-1 call #t~ret3 := fibo1(~n - 2);< 380#fibo1ENTRY ~n := #in~n; 426#L8 assume !(~n < 1); 425#L10 assume !(1 == ~n); 379#L13 call #t~ret0 := fibo2(~n - 1);< 424#fibo2ENTRY ~n := #in~n; 429#L18 assume !(~n < 1); 420#L20 assume !(1 == ~n); 377#L23 call #t~ret2 := fibo1(~n - 1);< 380#fibo1ENTRY ~n := #in~n; 426#L8 assume !(~n < 1); 425#L10 assume 1 == ~n;#res := 1; 408#fibo1FINAL assume true; 421#fibo1EXIT >#45#return; 397#L23-1 [2019-11-20 04:06:07,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:07,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2019-11-20 04:06:07,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:07,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864184446] [2019-11-20 04:06:07,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:07,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864184446] [2019-11-20 04:06:07,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554229424] [2019-11-20 04:06:07,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:07,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:06:07,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:07,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:07,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-20 04:06:07,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741843822] [2019-11-20 04:06:07,733 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:07,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:07,733 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2019-11-20 04:06:07,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:07,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430451595] [2019-11-20 04:06:07,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:07,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:06:07,993 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:07,993 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:07,994 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:07,994 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:07,994 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 04:06:07,994 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:07,994 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:07,994 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:07,994 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration3_Loop [2019-11-20 04:06:07,995 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:07,995 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:07,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:08,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:08,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:08,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:08,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:08,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:08,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:08,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:08,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:08,097 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:08,097 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:08,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:08,103 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:08,108 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:08,108 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/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 [2019-11-20 04:06:08,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:08,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:08,117 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:08,117 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:08,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:08,123 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:08,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 04:06:08,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:09,306 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 04:06:09,308 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:09,309 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:09,309 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:09,309 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:09,309 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 04:06:09,309 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:09,309 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:09,309 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:09,309 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration3_Loop [2019-11-20 04:06:09,309 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:09,309 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:09,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:09,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:09,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:09,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:09,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:09,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:09,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:09,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:09,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:09,427 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:09,427 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:09,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:09,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:09,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:09,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:09,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:09,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:09,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:09,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:09,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:09,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:09,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:09,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:09,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:09,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:09,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:09,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:09,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:09,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:09,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:09,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:09,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:09,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:09,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:09,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:09,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:09,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:09,467 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 04:06:09,469 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-20 04:06:09,469 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:09,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 04:06:09,473 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 04:06:09,473 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 04:06:09,474 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-20 04:06:09,475 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 04:06:09,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:09,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:06:09,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:09,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 04:06:09,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:09,701 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-11-20 04:06:09,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-11-20 04:06:10,135 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 190 states and 262 transitions. Complement of second has 26 states. [2019-11-20 04:06:10,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 04:06:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2019-11-20 04:06:10,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 14 letters. [2019-11-20 04:06:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 29 letters. Loop has 14 letters. [2019-11-20 04:06:10,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:10,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 15 letters. Loop has 28 letters. [2019-11-20 04:06:10,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:10,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. [2019-11-20 04:06:10,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-20 04:06:10,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2019-11-20 04:06:10,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-11-20 04:06:10,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-20 04:06:10,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2019-11-20 04:06:10,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:10,159 INFO L688 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2019-11-20 04:06:10,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2019-11-20 04:06:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-11-20 04:06:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 04:06:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2019-11-20 04:06:10,183 INFO L711 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2019-11-20 04:06:10,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:10,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:06:10,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:06:10,184 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 10 states. [2019-11-20 04:06:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:10,371 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2019-11-20 04:06:10,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 04:06:10,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2019-11-20 04:06:10,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-20 04:06:10,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2019-11-20 04:06:10,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-11-20 04:06:10,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-11-20 04:06:10,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2019-11-20 04:06:10,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:10,388 INFO L688 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2019-11-20 04:06:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2019-11-20 04:06:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2019-11-20 04:06:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-20 04:06:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2019-11-20 04:06:10,406 INFO L711 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-20 04:06:10,406 INFO L591 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2019-11-20 04:06:10,406 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 04:06:10,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2019-11-20 04:06:10,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-20 04:06:10,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:10,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:10,415 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-20 04:06:10,415 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-20 04:06:10,416 INFO L794 eck$LassoCheckResult]: Stem: 1211#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 1188#L37 call main_#t~ret4 := fibo1(main_~x~0);< 1189#fibo1ENTRY ~n := #in~n; 1259#L8 assume !(~n < 1); 1257#L10 assume !(1 == ~n); 1180#L13 call #t~ret0 := fibo2(~n - 1);< 1200#fibo2ENTRY ~n := #in~n; 1218#L18 assume !(~n < 1); 1224#L20 assume !(1 == ~n); 1204#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1251#L8 assume !(~n < 1); 1249#L10 assume !(1 == ~n); 1168#L13 call #t~ret0 := fibo2(~n - 1);< 1248#fibo2ENTRY ~n := #in~n; 1255#L18 assume !(~n < 1); 1256#L20 assume !(1 == ~n); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1251#L8 assume !(~n < 1); 1249#L10 assume !(1 == ~n); 1168#L13 call #t~ret0 := fibo2(~n - 1);< 1248#fibo2ENTRY ~n := #in~n; 1255#L18 assume ~n < 1;#res := 0; 1182#fibo2FINAL assume true; 1183#fibo2EXIT >#49#return; 1169#L13-1 call #t~ret1 := fibo2(~n - 2);< 1205#fibo2ENTRY ~n := #in~n; 1226#L18 assume !(~n < 1); 1227#L20 assume !(1 == ~n); 1167#L23 call #t~ret2 := fibo1(~n - 1);< 1170#fibo1ENTRY ~n := #in~n; 1253#L8 assume !(~n < 1); 1262#L10 assume 1 == ~n;#res := 1; 1263#fibo1FINAL assume true; 1258#fibo1EXIT >#45#return; 1242#L23-1 call #t~ret3 := fibo1(~n - 2);< 1187#fibo1ENTRY ~n := #in~n; 1252#L8 assume !(~n < 1); 1250#L10 assume !(1 == ~n); 1186#L13 call #t~ret0 := fibo2(~n - 1);< 1241#fibo2ENTRY ~n := #in~n; 1238#L18 assume ~n < 1;#res := 0; 1239#fibo2FINAL assume true; 1244#fibo2EXIT >#49#return; 1185#L13-1 call #t~ret1 := fibo2(~n - 2);< 1241#fibo2ENTRY ~n := #in~n; 1238#L18 assume !(~n < 1); 1233#L20 assume 1 == ~n;#res := 1; 1234#fibo2FINAL assume true; 1219#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#45#return; 1172#L23-1 call #t~ret3 := fibo1(~n - 2);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-11-20 04:06:10,416 INFO L796 eck$LassoCheckResult]: Loop: 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume !(~n < 1); 1222#L20 assume !(1 == ~n); 1162#L23 call #t~ret2 := fibo1(~n - 1);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume !(~n < 1); 1222#L20 assume !(1 == ~n); 1162#L23 call #t~ret2 := fibo1(~n - 1);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#45#return; 1172#L23-1 call #t~ret3 := fibo1(~n - 2);< 1166#fibo1ENTRY ~n := #in~n; 1208#L8 assume !(~n < 1); 1171#L10 assume !(1 == ~n); 1164#L13 call #t~ret0 := fibo2(~n - 1);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#49#return; 1165#L13-1 call #t~ret1 := fibo2(~n - 2);< 1199#fibo2ENTRY ~n := #in~n; 1280#L18 assume ~n < 1;#res := 0; 1223#fibo2FINAL assume true; 1315#fibo2EXIT >#51#return; 1220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 1323#fibo1FINAL assume true; 1321#fibo1EXIT >#47#return; 1197#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 1320#fibo2FINAL assume true; 1314#fibo2EXIT >#49#return; 1165#L13-1 [2019-11-20 04:06:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2019-11-20 04:06:10,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:10,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104932231] [2019-11-20 04:06:10,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 22 proven. 89 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-20 04:06:10,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104932231] [2019-11-20 04:06:10,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609126467] [2019-11-20 04:06:10,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:10,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 04:06:10,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-20 04:06:11,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:11,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2019-11-20 04:06:11,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836703590] [2019-11-20 04:06:11,032 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1387383120, now seen corresponding path program 1 times [2019-11-20 04:06:11,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:11,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908223326] [2019-11-20 04:06:11,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-20 04:06:11,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908223326] [2019-11-20 04:06:11,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455913111] [2019-11-20 04:06:11,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 04:06:11,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 04:06:11,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 04:06:11,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2019-11-20 04:06:11,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090897037] [2019-11-20 04:06:11,346 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 04:06:11,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:06:11,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:06:11,347 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2019-11-20 04:06:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:11,424 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-11-20 04:06:11,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:06:11,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2019-11-20 04:06:11,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-20 04:06:11,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2019-11-20 04:06:11,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-11-20 04:06:11,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-11-20 04:06:11,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2019-11-20 04:06:11,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:11,440 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2019-11-20 04:06:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2019-11-20 04:06:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-11-20 04:06:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-20 04:06:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2019-11-20 04:06:11,469 INFO L711 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-20 04:06:11,469 INFO L591 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2019-11-20 04:06:11,469 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 04:06:11,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2019-11-20 04:06:11,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-20 04:06:11,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:11,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:11,483 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-20 04:06:11,483 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-20 04:06:11,484 INFO L794 eck$LassoCheckResult]: Stem: 2260#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 2232#L37 call main_#t~ret4 := fibo1(main_~x~0);< 2233#fibo1ENTRY ~n := #in~n; 2266#L8 assume !(~n < 1); 2231#L10 assume !(1 == ~n); 2217#L13 call #t~ret0 := fibo2(~n - 1);< 2245#fibo2ENTRY ~n := #in~n; 2351#L18 assume !(~n < 1); 2350#L20 assume !(1 == ~n); 2216#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2258#L8 assume !(~n < 1); 2298#L10 assume !(1 == ~n); 2222#L13 call #t~ret0 := fibo2(~n - 1);< 2295#fibo2ENTRY ~n := #in~n; 2299#L18 assume !(~n < 1); 2297#L20 assume !(1 == ~n); 2249#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2258#L8 assume !(~n < 1); 2298#L10 assume !(1 == ~n); 2222#L13 call #t~ret0 := fibo2(~n - 1);< 2295#fibo2ENTRY ~n := #in~n; 2299#L18 assume !(~n < 1); 2297#L20 assume 1 == ~n;#res := 1; 2221#fibo2FINAL assume true; 2223#fibo2EXIT >#49#return; 2248#L13-1 call #t~ret1 := fibo2(~n - 2);< 2250#fibo2ENTRY ~n := #in~n; 2264#L18 assume !(~n < 1); 2268#L20 assume !(1 == ~n); 2249#L23 call #t~ret2 := fibo1(~n - 1);< 2218#fibo1ENTRY ~n := #in~n; 2259#L8 assume !(~n < 1); 2303#L10 assume 1 == ~n;#res := 1; 2301#fibo1FINAL assume true; 2300#fibo1EXIT >#45#return; 2229#L23-1 call #t~ret3 := fibo1(~n - 2);< 2227#fibo1ENTRY ~n := #in~n; 2293#L8 assume !(~n < 1); 2292#L10 assume !(1 == ~n); 2226#L13 call #t~ret0 := fibo2(~n - 1);< 2288#fibo2ENTRY ~n := #in~n; 2281#L18 assume !(~n < 1); 2277#L20 assume 1 == ~n;#res := 1; 2278#fibo2FINAL assume true; 2329#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#45#return; 2327#L23-1 call #t~ret3 := fibo1(~n - 2);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-11-20 04:06:11,484 INFO L796 eck$LassoCheckResult]: Loop: 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume !(1 == ~n); 2326#L23 call #t~ret2 := fibo1(~n - 1);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume !(1 == ~n); 2326#L23 call #t~ret2 := fibo1(~n - 1);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#45#return; 2327#L23-1 call #t~ret3 := fibo1(~n - 2);< 2337#fibo1ENTRY ~n := #in~n; 2338#L8 assume !(~n < 1); 2332#L10 assume !(1 == ~n); 2262#L13 call #t~ret0 := fibo2(~n - 1);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume !(~n < 1); 2342#L20 assume 1 == ~n;#res := 1; 2343#fibo2FINAL assume true; 2330#fibo2EXIT >#49#return; 2261#L13-1 call #t~ret1 := fibo2(~n - 2);< 2247#fibo2ENTRY ~n := #in~n; 2263#L18 assume ~n < 1;#res := 0; 2347#fibo2FINAL assume true; 2362#fibo2EXIT >#51#return; 2321#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 2355#fibo1FINAL assume true; 2335#fibo1EXIT >#47#return; 2331#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 2328#fibo2FINAL assume true; 2324#fibo2EXIT >#49#return; 2261#L13-1 [2019-11-20 04:06:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:11,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2019-11-20 04:06:11,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:11,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105830229] [2019-11-20 04:06:11,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-20 04:06:11,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105830229] [2019-11-20 04:06:11,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325498481] [2019-11-20 04:06:11,876 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:11,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:11,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:11,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 04:06:11,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 04:06:12,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:12,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 23 [2019-11-20 04:06:12,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879229037] [2019-11-20 04:06:12,077 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash 532984890, now seen corresponding path program 1 times [2019-11-20 04:06:12,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:12,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476311863] [2019-11-20 04:06:12,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 04:06:12,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476311863] [2019-11-20 04:06:12,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877743764] [2019-11-20 04:06:12,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:12,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 04:06:12,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 04:06:12,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:12,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-11-20 04:06:12,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115798242] [2019-11-20 04:06:12,410 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 04:06:12,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 04:06:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-20 04:06:12,411 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 15 states. [2019-11-20 04:06:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:12,774 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2019-11-20 04:06:12,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 04:06:12,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 231 transitions. [2019-11-20 04:06:12,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-20 04:06:12,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 120 states and 153 transitions. [2019-11-20 04:06:12,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-20 04:06:12,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-11-20 04:06:12,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 153 transitions. [2019-11-20 04:06:12,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:12,784 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 153 transitions. [2019-11-20 04:06:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 153 transitions. [2019-11-20 04:06:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-11-20 04:06:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-20 04:06:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-11-20 04:06:12,807 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-20 04:06:12,807 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-20 04:06:12,808 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 04:06:12,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 144 transitions. [2019-11-20 04:06:12,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-20 04:06:12,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:12,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:12,811 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:12,812 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:12,813 INFO L794 eck$LassoCheckResult]: Stem: 3324#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 3300#L37 call main_#t~ret4 := fibo1(main_~x~0);< 3301#fibo1ENTRY ~n := #in~n; 3338#L8 assume !(~n < 1); 3356#L10 assume !(1 == ~n); 3298#L13 call #t~ret0 := fibo2(~n - 1);< 3320#fibo2ENTRY ~n := #in~n; 3330#L18 assume !(~n < 1); 3334#L20 assume !(1 == ~n); 3297#L23 call #t~ret2 := fibo1(~n - 1);< 3299#fibo1ENTRY ~n := #in~n; 3327#L8 assume !(~n < 1); 3399#L10 assume !(1 == ~n); 3336#L13 call #t~ret0 := fibo2(~n - 1);< 3349#fibo2ENTRY ~n := #in~n; 3335#L18 assume !(~n < 1); 3337#L20 assume 1 == ~n;#res := 1; 3401#fibo2FINAL assume true; 3341#fibo2EXIT >#49#return; 3309#L13-1 call #t~ret1 := fibo2(~n - 2);< 3328#fibo2ENTRY ~n := #in~n; 3329#L18 assume ~n < 1;#res := 0; 3308#fibo2FINAL assume true; 3310#fibo2EXIT >#51#return; 3322#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 3323#fibo1FINAL assume true; 3402#fibo1EXIT >#45#return; 3311#L23-1 call #t~ret3 := fibo1(~n - 2);< 3312#fibo1ENTRY ~n := #in~n; 3397#L8 assume !(~n < 1); 3395#L10 assume !(1 == ~n); 3293#L13 call #t~ret0 := fibo2(~n - 1);< 3381#fibo2ENTRY ~n := #in~n; 3398#L18 assume !(~n < 1); 3396#L20 assume !(1 == ~n); 3292#L23 [2019-11-20 04:06:12,814 INFO L796 eck$LassoCheckResult]: Loop: 3292#L23 call #t~ret2 := fibo1(~n - 1);< 3294#fibo1ENTRY ~n := #in~n; 3325#L8 assume !(~n < 1); 3332#L10 assume !(1 == ~n); 3296#L13 call #t~ret0 := fibo2(~n - 1);< 3319#fibo2ENTRY ~n := #in~n; 3384#L18 assume !(~n < 1); 3383#L20 assume !(1 == ~n); 3292#L23 [2019-11-20 04:06:12,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:12,814 INFO L82 PathProgramCache]: Analyzing trace with hash 134952287, now seen corresponding path program 1 times [2019-11-20 04:06:12,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:12,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752515992] [2019-11-20 04:06:12,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 04:06:13,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752515992] [2019-11-20 04:06:13,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34144900] [2019-11-20 04:06:13,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:13,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 04:06:13,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 04:06:13,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:13,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 20 [2019-11-20 04:06:13,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664207873] [2019-11-20 04:06:13,275 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:13,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1485029830, now seen corresponding path program 2 times [2019-11-20 04:06:13,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:13,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621140095] [2019-11-20 04:06:13,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:13,284 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:06:13,424 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:13,425 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:13,425 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:13,425 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:13,425 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 04:06:13,425 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:13,425 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:13,425 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:13,425 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration6_Loop [2019-11-20 04:06:13,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:13,426 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:13,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:13,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:13,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:13,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:13,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:13,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:13,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:13,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:13,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:13,525 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:13,525 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:13,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:13,541 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:13,545 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:13,545 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:13,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:13,554 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:13,560 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:13,560 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:13,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:13,579 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:13,584 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:13,584 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:13,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:13,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:13,596 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:13,596 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:13,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:13,607 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:13,611 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:13,612 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:13,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:13,620 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:13,625 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:13,625 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:13,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:13,633 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:13,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 04:06:13,653 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:14,933 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 04:06:14,935 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:14,935 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:14,935 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:14,935 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:14,935 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 04:06:14,935 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:14,935 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:14,935 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:14,935 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration6_Loop [2019-11-20 04:06:14,935 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:14,936 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:14,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:14,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:14,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:14,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:14,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:14,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:14,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:14,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:14,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:15,049 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:15,050 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:15,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:15,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:15,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:15,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:15,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:15,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:15,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:15,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:15,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:15,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:15,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:15,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:15,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:15,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:15,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:15,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:15,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:15,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:15,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:15,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:15,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:15,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:15,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:15,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:15,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:15,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:15,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:15,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:15,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:15,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:15,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:15,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:15,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:15,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:15,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:15,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:15,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:15,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:15,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:15,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:15,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:15,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:15,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:15,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:15,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:15,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:15,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:15,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:15,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:15,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:15,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:15,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:15,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:15,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:15,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:15,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:15,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:15,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:15,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:15,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:15,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:15,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:15,146 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 04:06:15,149 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-20 04:06:15,149 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:15,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 04:06:15,158 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 04:06:15,158 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 04:06:15,158 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-20 04:06:15,160 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 04:06:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:15,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 04:06:15,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:15,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 04:06:15,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:15,321 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-20 04:06:15,321 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-20 04:06:15,498 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 194 states and 238 transitions. Complement of second has 20 states. [2019-11-20 04:06:15,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 04:06:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-11-20 04:06:15,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-20 04:06:15,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:15,503 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 04:06:15,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:15,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 04:06:15,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:15,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:15,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 04:06:15,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:15,718 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-20 04:06:15,718 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-20 04:06:15,948 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 251 states and 297 transitions. Complement of second has 33 states. [2019-11-20 04:06:15,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 04:06:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2019-11-20 04:06:15,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-20 04:06:15,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:15,952 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 04:06:15,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:16,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 04:06:16,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:16,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:16,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:16,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 04:06:16,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:16,162 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 6 loop predicates [2019-11-20 04:06:16,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36 Second operand 8 states. [2019-11-20 04:06:16,352 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 144 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 315 states and 394 transitions. Complement of second has 32 states. [2019-11-20 04:06:16,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 04:06:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2019-11-20 04:06:16,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 8 letters. [2019-11-20 04:06:16,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:16,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 43 letters. Loop has 8 letters. [2019-11-20 04:06:16,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:16,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 35 letters. Loop has 16 letters. [2019-11-20 04:06:16,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:16,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 394 transitions. [2019-11-20 04:06:16,365 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2019-11-20 04:06:16,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 205 states and 265 transitions. [2019-11-20 04:06:16,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2019-11-20 04:06:16,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-11-20 04:06:16,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 265 transitions. [2019-11-20 04:06:16,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:16,371 INFO L688 BuchiCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-11-20 04:06:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 265 transitions. [2019-11-20 04:06:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-20 04:06:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-20 04:06:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2019-11-20 04:06:16,383 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 236 transitions. [2019-11-20 04:06:16,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 04:06:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-20 04:06:16,384 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand 20 states. [2019-11-20 04:06:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:16,844 INFO L93 Difference]: Finished difference Result 192 states and 236 transitions. [2019-11-20 04:06:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 04:06:16,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 236 transitions. [2019-11-20 04:06:16,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-20 04:06:16,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 126 states and 154 transitions. [2019-11-20 04:06:16,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-20 04:06:16,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2019-11-20 04:06:16,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 154 transitions. [2019-11-20 04:06:16,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:16,853 INFO L688 BuchiCegarLoop]: Abstraction has 126 states and 154 transitions. [2019-11-20 04:06:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 154 transitions. [2019-11-20 04:06:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-11-20 04:06:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-20 04:06:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2019-11-20 04:06:16,860 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-20 04:06:16,861 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-20 04:06:16,861 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 04:06:16,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 144 transitions. [2019-11-20 04:06:16,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-20 04:06:16,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:16,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:16,864 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:16,864 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:16,864 INFO L794 eck$LassoCheckResult]: Stem: 5261#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 5240#L37 call main_#t~ret4 := fibo1(main_~x~0);< 5246#fibo1ENTRY ~n := #in~n; 5299#L8 assume !(~n < 1); 5239#L10 assume !(1 == ~n); 5241#L13 call #t~ret0 := fibo2(~n - 1);< 5252#fibo2ENTRY ~n := #in~n; 5265#L18 assume !(~n < 1); 5273#L20 assume !(1 == ~n); 5294#L23 call #t~ret2 := fibo1(~n - 1);< 5296#fibo1ENTRY ~n := #in~n; 5290#L8 assume !(~n < 1); 5295#L10 assume !(1 == ~n); 5231#L13 call #t~ret0 := fibo2(~n - 1);< 5293#fibo2ENTRY ~n := #in~n; 5292#L18 assume !(~n < 1); 5291#L20 assume !(1 == ~n); 5250#L23 call #t~ret2 := fibo1(~n - 1);< 5289#fibo1ENTRY ~n := #in~n; 5284#L8 assume !(~n < 1); 5285#L10 assume !(1 == ~n); 5244#L13 call #t~ret0 := fibo2(~n - 1);< 5251#fibo2ENTRY ~n := #in~n; 5286#L18 assume !(~n < 1); 5267#L20 assume 1 == ~n;#res := 1; 5243#fibo2FINAL assume true; 5245#fibo2EXIT >#49#return; 5254#L13-1 call #t~ret1 := fibo2(~n - 2);< 5255#fibo2ENTRY ~n := #in~n; 5271#L18 assume ~n < 1;#res := 0; 5272#fibo2FINAL assume true; 5342#fibo2EXIT >#51#return; 5256#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 5257#fibo1FINAL assume true; 5249#fibo1EXIT >#45#return; 5237#L23-1 call #t~ret3 := fibo1(~n - 2);< 5242#fibo1ENTRY ~n := #in~n; 5258#L8 assume ~n < 1;#res := 0; 5238#fibo1FINAL assume true; 5253#fibo1EXIT >#47#return; 5247#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 5248#fibo2FINAL assume true; 5312#fibo2EXIT >#49#return; 5281#L13-1 [2019-11-20 04:06:16,864 INFO L796 eck$LassoCheckResult]: Loop: 5281#L13-1 call #t~ret1 := fibo2(~n - 2);< 5302#fibo2ENTRY ~n := #in~n; 5279#L18 assume !(~n < 1); 5283#L20 assume !(1 == ~n); 5260#L23 call #t~ret2 := fibo1(~n - 1);< 5235#fibo1ENTRY ~n := #in~n; 5259#L8 assume !(~n < 1); 5266#L10 assume !(1 == ~n); 5234#L13 call #t~ret0 := fibo2(~n - 1);< 5298#fibo2ENTRY ~n := #in~n; 5297#L18 assume !(~n < 1); 5268#L20 assume !(1 == ~n); 5270#L23 call #t~ret2 := fibo1(~n - 1);< 5335#fibo1ENTRY ~n := #in~n; 5339#L8 assume !(~n < 1); 5337#L10 assume 1 == ~n;#res := 1; 5336#fibo1FINAL assume true; 5333#fibo1EXIT >#45#return; 5320#L23-1 call #t~ret3 := fibo1(~n - 2);< 5322#fibo1ENTRY ~n := #in~n; 5326#L8 assume ~n < 1;#res := 0; 5324#fibo1FINAL assume true; 5319#fibo1EXIT >#47#return; 5316#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 5315#fibo2FINAL assume true; 5310#fibo2EXIT >#49#return; 5281#L13-1 [2019-11-20 04:06:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash -304074822, now seen corresponding path program 1 times [2019-11-20 04:06:16,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:16,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135652999] [2019-11-20 04:06:16,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 04:06:17,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135652999] [2019-11-20 04:06:17,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560581222] [2019-11-20 04:06:17,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:17,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 04:06:17,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:06:17,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:17,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 17 [2019-11-20 04:06:17,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898322069] [2019-11-20 04:06:17,245 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:17,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1737996717, now seen corresponding path program 1 times [2019-11-20 04:06:17,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:17,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239756146] [2019-11-20 04:06:17,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:17,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:06:17,537 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:17,537 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:17,538 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:17,538 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:17,538 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 04:06:17,538 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:17,538 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:17,538 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:17,538 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration7_Loop [2019-11-20 04:06:17,538 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:17,538 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:17,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:17,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:17,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:17,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:17,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:17,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:17,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:17,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:17,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:17,619 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:17,620 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:17,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:17,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:17,628 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:17,628 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:17,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:17,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:17,638 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:17,638 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:17,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:17,643 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:17,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 04:06:17,654 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:18,619 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 04:06:18,621 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:18,621 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:18,621 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:18,621 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:18,621 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 04:06:18,622 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:18,622 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:18,622 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:18,622 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration7_Loop [2019-11-20 04:06:18,622 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:18,622 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:18,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:18,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:18,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:18,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:18,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:18,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:18,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:18,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:18,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:18,707 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:18,707 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:18,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:18,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:18,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:18,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:18,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:18,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:18,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:18,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:18,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:18,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:18,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:18,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:18,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:18,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:18,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:18,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:18,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:18,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:18,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:18,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:18,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:18,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:18,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:18,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:18,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:18,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:18,745 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 04:06:18,748 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-20 04:06:18,748 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:18,752 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 04:06:18,752 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 04:06:18,752 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 04:06:18,753 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-20 04:06:18,754 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 04:06:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:18,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 04:06:18,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:18,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:18,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:18,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:18,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:18,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 04:06:18,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 04:06:19,045 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2019-11-20 04:06:19,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-20 04:06:19,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29. Second operand 10 states. Result 364 states and 473 transitions. Complement of second has 40 states. [2019-11-20 04:06:19,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-20 04:06:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2019-11-20 04:06:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-20 04:06:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:19,490 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 04:06:19,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:19,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 04:06:19,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:19,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:19,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:19,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:19,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:19,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 04:06:19,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 04:06:19,777 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2019-11-20 04:06:19,777 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-20 04:06:20,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29. Second operand 10 states. Result 242 states and 301 transitions. Complement of second has 26 states. [2019-11-20 04:06:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-20 04:06:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2019-11-20 04:06:20,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-20 04:06:20,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:20,099 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 04:06:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:20,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 04:06:20,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:20,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:20,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:20,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:20,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:20,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 04:06:20,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 04:06:20,347 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 8 loop predicates [2019-11-20 04:06:20,347 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29 Second operand 10 states. [2019-11-20 04:06:20,721 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 144 transitions. cyclomatic complexity: 29. Second operand 10 states. Result 579 states and 748 transitions. Complement of second has 119 states. [2019-11-20 04:06:20,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-20 04:06:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2019-11-20 04:06:20,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 26 letters. [2019-11-20 04:06:20,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:20,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 69 letters. Loop has 26 letters. [2019-11-20 04:06:20,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:20,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 43 letters. Loop has 52 letters. [2019-11-20 04:06:20,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:20,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 579 states and 748 transitions. [2019-11-20 04:06:20,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-11-20 04:06:20,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 579 states to 444 states and 596 transitions. [2019-11-20 04:06:20,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-11-20 04:06:20,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2019-11-20 04:06:20,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 596 transitions. [2019-11-20 04:06:20,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:20,752 INFO L688 BuchiCegarLoop]: Abstraction has 444 states and 596 transitions. [2019-11-20 04:06:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states and 596 transitions. [2019-11-20 04:06:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 417. [2019-11-20 04:06:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-20 04:06:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 548 transitions. [2019-11-20 04:06:20,773 INFO L711 BuchiCegarLoop]: Abstraction has 417 states and 548 transitions. [2019-11-20 04:06:20,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:20,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 04:06:20,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-20 04:06:20,774 INFO L87 Difference]: Start difference. First operand 417 states and 548 transitions. Second operand 18 states. [2019-11-20 04:06:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:21,284 INFO L93 Difference]: Finished difference Result 483 states and 649 transitions. [2019-11-20 04:06:21,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 04:06:21,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 649 transitions. [2019-11-20 04:06:21,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-20 04:06:21,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 483 states and 648 transitions. [2019-11-20 04:06:21,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2019-11-20 04:06:21,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2019-11-20 04:06:21,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 648 transitions. [2019-11-20 04:06:21,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:21,304 INFO L688 BuchiCegarLoop]: Abstraction has 483 states and 648 transitions. [2019-11-20 04:06:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 648 transitions. [2019-11-20 04:06:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 429. [2019-11-20 04:06:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-20 04:06:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 565 transitions. [2019-11-20 04:06:21,328 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-20 04:06:21,328 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 565 transitions. [2019-11-20 04:06:21,329 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 04:06:21,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 565 transitions. [2019-11-20 04:06:21,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-20 04:06:21,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:21,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:21,346 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:21,346 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [48, 47, 34, 33, 28, 24, 24, 24, 24, 24, 23, 23, 20, 17, 17, 17, 17, 16, 16, 11, 10] [2019-11-20 04:06:21,347 INFO L794 eck$LassoCheckResult]: Stem: 8596#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 8562#L37 call main_#t~ret4 := fibo1(main_~x~0);< 8563#fibo1ENTRY ~n := #in~n; 8643#L8 assume !(~n < 1); 8642#L10 assume !(1 == ~n); 8638#L13 call #t~ret0 := fibo2(~n - 1);< 8641#fibo2ENTRY ~n := #in~n; 8640#L18 assume !(~n < 1); 8639#L20 assume !(1 == ~n); 8634#L23 call #t~ret2 := fibo1(~n - 1);< 8636#fibo1ENTRY ~n := #in~n; 8637#L8 assume !(~n < 1); 8633#L10 assume !(1 == ~n); 8620#L13 call #t~ret0 := fibo2(~n - 1);< 8625#fibo2ENTRY ~n := #in~n; 8624#L18 assume !(~n < 1); 8622#L20 assume !(1 == ~n); 8571#L23 call #t~ret2 := fibo1(~n - 1);< 8613#fibo1ENTRY ~n := #in~n; 8614#L8 assume !(~n < 1); 8635#L10 assume !(1 == ~n); 8621#L13 call #t~ret0 := fibo2(~n - 1);< 8625#fibo2ENTRY ~n := #in~n; 8624#L18 assume !(~n < 1); 8622#L20 assume !(1 == ~n); 8571#L23 call #t~ret2 := fibo1(~n - 1);< 8613#fibo1ENTRY ~n := #in~n; 8612#L8 assume !(~n < 1); 8611#L10 assume !(1 == ~n); 8570#L13 call #t~ret0 := fibo2(~n - 1);< 8572#fibo2ENTRY ~n := #in~n; 8810#L18 assume !(~n < 1); 8808#L20 assume 1 == ~n;#res := 1; 8806#fibo2FINAL assume true; 8805#fibo2EXIT >#49#return; 8803#L13-1 call #t~ret1 := fibo2(~n - 2);< 8804#fibo2ENTRY ~n := #in~n; 8809#L18 assume ~n < 1;#res := 0; 8807#fibo2FINAL assume true; 8802#fibo2EXIT >#51#return; 8801#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8799#fibo1FINAL assume true; 8795#fibo1EXIT >#45#return; 8792#L23-1 call #t~ret3 := fibo1(~n - 2);< 8793#fibo1ENTRY ~n := #in~n; 8831#L8 assume ~n < 1;#res := 0; 8830#fibo1FINAL assume true; 8791#fibo1EXIT >#47#return; 8780#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8775#fibo2FINAL assume true; 8720#fibo2EXIT >#49#return; 8627#L13-1 [2019-11-20 04:06:21,349 INFO L796 eck$LassoCheckResult]: Loop: 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume !(1 == ~n); 8630#L13 call #t~ret0 := fibo2(~n - 1);< 8682#fibo2ENTRY ~n := #in~n; 8680#L18 assume !(~n < 1); 8676#L20 assume !(1 == ~n); 8658#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8695#L23 call #t~ret2 := fibo1(~n - 1);< 8819#fibo1ENTRY ~n := #in~n; 8840#L8 assume !(~n < 1); 8839#L10 assume 1 == ~n;#res := 1; 8838#fibo1FINAL assume true; 8816#fibo1EXIT >#45#return; 8814#L23-1 call #t~ret3 := fibo1(~n - 2);< 8815#fibo1ENTRY ~n := #in~n; 8835#L8 assume ~n < 1;#res := 0; 8834#fibo1FINAL assume true; 8813#fibo1EXIT >#47#return; 8712#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8774#fibo2FINAL assume true; 8722#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8674#L13 call #t~ret0 := fibo2(~n - 1);< 8675#fibo2ENTRY ~n := #in~n; 8892#L18 assume !(~n < 1); 8890#L20 assume !(1 == ~n); 8891#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8942#L8 assume !(~n < 1); 8941#L10 assume 1 == ~n;#res := 1; 8939#fibo1FINAL assume true; 8937#fibo1EXIT >#45#return; 8593#L23-1 call #t~ret3 := fibo1(~n - 2);< 8591#fibo1ENTRY ~n := #in~n; 8595#L8 assume ~n < 1;#res := 0; 8967#fibo1FINAL assume true; 8872#fibo1EXIT >#47#return; 8862#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8847#fibo2FINAL assume true; 8673#fibo2EXIT >#49#return; 8582#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume !(1 == ~n); 8630#L13 call #t~ret0 := fibo2(~n - 1);< 8682#fibo2ENTRY ~n := #in~n; 8680#L18 assume !(~n < 1); 8676#L20 assume !(1 == ~n); 8658#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8695#L23 call #t~ret2 := fibo1(~n - 1);< 8819#fibo1ENTRY ~n := #in~n; 8840#L8 assume !(~n < 1); 8839#L10 assume 1 == ~n;#res := 1; 8838#fibo1FINAL assume true; 8816#fibo1EXIT >#45#return; 8814#L23-1 call #t~ret3 := fibo1(~n - 2);< 8815#fibo1ENTRY ~n := #in~n; 8835#L8 assume ~n < 1;#res := 0; 8834#fibo1FINAL assume true; 8813#fibo1EXIT >#47#return; 8712#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8774#fibo2FINAL assume true; 8722#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8674#L13 call #t~ret0 := fibo2(~n - 1);< 8675#fibo2ENTRY ~n := #in~n; 8892#L18 assume !(~n < 1); 8890#L20 assume !(1 == ~n); 8891#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8942#L8 assume !(~n < 1); 8941#L10 assume 1 == ~n;#res := 1; 8939#fibo1FINAL assume true; 8937#fibo1EXIT >#45#return; 8593#L23-1 call #t~ret3 := fibo1(~n - 2);< 8591#fibo1ENTRY ~n := #in~n; 8595#L8 assume ~n < 1;#res := 0; 8967#fibo1FINAL assume true; 8872#fibo1EXIT >#47#return; 8862#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8847#fibo2FINAL assume true; 8673#fibo2EXIT >#49#return; 8582#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#47#return; 8660#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8701#fibo2FINAL assume true; 8689#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume !(1 == ~n); 8630#L13 call #t~ret0 := fibo2(~n - 1);< 8682#fibo2ENTRY ~n := #in~n; 8680#L18 assume !(~n < 1); 8676#L20 assume !(1 == ~n); 8658#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8656#L23 call #t~ret2 := fibo1(~n - 1);< 8669#fibo1ENTRY ~n := #in~n; 8708#L8 assume !(~n < 1); 8707#L10 assume !(1 == ~n); 8628#L13 call #t~ret0 := fibo2(~n - 1);< 8702#fibo2ENTRY ~n := #in~n; 8719#L18 assume !(~n < 1); 8693#L20 assume !(1 == ~n); 8695#L23 call #t~ret2 := fibo1(~n - 1);< 8819#fibo1ENTRY ~n := #in~n; 8840#L8 assume !(~n < 1); 8839#L10 assume 1 == ~n;#res := 1; 8838#fibo1FINAL assume true; 8816#fibo1EXIT >#45#return; 8814#L23-1 call #t~ret3 := fibo1(~n - 2);< 8815#fibo1ENTRY ~n := #in~n; 8835#L8 assume ~n < 1;#res := 0; 8834#fibo1FINAL assume true; 8813#fibo1EXIT >#47#return; 8712#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8774#fibo2FINAL assume true; 8722#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8674#L13 call #t~ret0 := fibo2(~n - 1);< 8675#fibo2ENTRY ~n := #in~n; 8892#L18 assume !(~n < 1); 8890#L20 assume !(1 == ~n); 8891#L23 call #t~ret2 := fibo1(~n - 1);< 8546#fibo1ENTRY ~n := #in~n; 8942#L8 assume !(~n < 1); 8941#L10 assume 1 == ~n;#res := 1; 8939#fibo1FINAL assume true; 8937#fibo1EXIT >#45#return; 8593#L23-1 call #t~ret3 := fibo1(~n - 2);< 8591#fibo1ENTRY ~n := #in~n; 8595#L8 assume ~n < 1;#res := 0; 8967#fibo1FINAL assume true; 8872#fibo1EXIT >#47#return; 8862#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8847#fibo2FINAL assume true; 8673#fibo2EXIT >#49#return; 8582#L13-1 call #t~ret1 := fibo2(~n - 2);< 8584#fibo2ENTRY ~n := #in~n; 8697#L18 assume !(~n < 1); 8696#L20 assume !(1 == ~n); 8583#L23 call #t~ret2 := fibo1(~n - 1);< 8672#fibo1ENTRY ~n := #in~n; 8681#L8 assume !(~n < 1); 8678#L10 assume !(1 == ~n); 8679#L13 call #t~ret0 := fibo2(~n - 1);< 8755#fibo2ENTRY ~n := #in~n; 8761#L18 assume !(~n < 1); 8759#L20 assume !(1 == ~n); 8760#L23 call #t~ret2 := fibo1(~n - 1);< 8542#fibo1ENTRY ~n := #in~n; 8861#L8 assume !(~n < 1); 8860#L10 assume 1 == ~n;#res := 1; 8859#fibo1FINAL assume true; 8858#fibo1EXIT >#45#return; 8589#L23-1 call #t~ret3 := fibo1(~n - 2);< 8552#fibo1ENTRY ~n := #in~n; 8590#L8 assume ~n < 1;#res := 0; 8868#fibo1FINAL assume true; 8850#fibo1EXIT >#47#return; 8652#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8848#fibo2FINAL assume true; 8757#fibo2EXIT >#49#return; 8746#L13-1 call #t~ret1 := fibo2(~n - 2);< 8753#fibo2ENTRY ~n := #in~n; 8789#L18 assume ~n < 1;#res := 0; 8752#fibo2FINAL assume true; 8745#fibo2EXIT >#51#return; 8748#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8762#fibo1FINAL assume true; 8763#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#51#return; 8690#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8811#fibo1FINAL assume true; 8812#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume !(~n < 1); 8699#L10 assume 1 == ~n;#res := 1; 8700#fibo1FINAL assume true; 8710#fibo1EXIT >#47#return; 8660#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8701#fibo2FINAL assume true; 8689#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#45#return; 8626#L23-1 call #t~ret3 := fibo1(~n - 2);< 8632#fibo1ENTRY ~n := #in~n; 8704#L8 assume ~n < 1;#res := 0; 8705#fibo1FINAL assume true; 8729#fibo1EXIT >#47#return; 8728#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8724#fibo2FINAL assume true; 8721#fibo2EXIT >#49#return; 8627#L13-1 call #t~ret1 := fibo2(~n - 2);< 8703#fibo2ENTRY ~n := #in~n; 8843#L18 assume ~n < 1;#res := 0; 8741#fibo2FINAL assume true; 8737#fibo2EXIT >#51#return; 8739#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 8833#fibo1FINAL assume true; 8655#fibo1EXIT >#47#return; 8660#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8701#fibo2FINAL assume true; 8689#fibo2EXIT >#49#return; 8627#L13-1 [2019-11-20 04:06:21,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:21,354 INFO L82 PathProgramCache]: Analyzing trace with hash -182196813, now seen corresponding path program 2 times [2019-11-20 04:06:21,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:21,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017962600] [2019-11-20 04:06:21,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 04:06:21,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017962600] [2019-11-20 04:06:21,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656369458] [2019-11-20 04:06:21,662 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:21,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:21,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:21,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 04:06:21,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 55 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 04:06:21,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:21,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 22 [2019-11-20 04:06:21,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855263779] [2019-11-20 04:06:21,778 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:21,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1098821556, now seen corresponding path program 1 times [2019-11-20 04:06:21,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:21,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818802353] [2019-11-20 04:06:21,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8447 backedges. 115 proven. 622 refuted. 0 times theorem prover too weak. 7710 trivial. 0 not checked. [2019-11-20 04:06:23,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818802353] [2019-11-20 04:06:23,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793949444] [2019-11-20 04:06:23,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:23,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 04:06:23,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8447 backedges. 996 proven. 3 refuted. 0 times theorem prover too weak. 7448 trivial. 0 not checked. [2019-11-20 04:06:23,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:23,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-11-20 04:06:23,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98973975] [2019-11-20 04:06:23,761 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 04:06:23,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 04:06:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-11-20 04:06:23,762 INFO L87 Difference]: Start difference. First operand 429 states and 565 transitions. cyclomatic complexity: 140 Second operand 22 states. [2019-11-20 04:06:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:24,360 INFO L93 Difference]: Finished difference Result 513 states and 677 transitions. [2019-11-20 04:06:24,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 04:06:24,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 677 transitions. [2019-11-20 04:06:24,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-20 04:06:24,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 497 states and 657 transitions. [2019-11-20 04:06:24,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2019-11-20 04:06:24,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2019-11-20 04:06:24,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 657 transitions. [2019-11-20 04:06:24,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:24,379 INFO L688 BuchiCegarLoop]: Abstraction has 497 states and 657 transitions. [2019-11-20 04:06:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 657 transitions. [2019-11-20 04:06:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 485. [2019-11-20 04:06:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-20 04:06:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 639 transitions. [2019-11-20 04:06:24,402 INFO L711 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-20 04:06:24,403 INFO L591 BuchiCegarLoop]: Abstraction has 485 states and 639 transitions. [2019-11-20 04:06:24,403 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 04:06:24,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 639 transitions. [2019-11-20 04:06:24,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-20 04:06:24,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:24,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:24,409 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:24,409 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:24,409 INFO L794 eck$LassoCheckResult]: Stem: 15215#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 15171#L37 call main_#t~ret4 := fibo1(main_~x~0);< 15172#fibo1ENTRY ~n := #in~n; 15413#L8 assume !(~n < 1); 15405#L10 assume !(1 == ~n); 15406#L13 call #t~ret0 := fibo2(~n - 1);< 15416#fibo2ENTRY ~n := #in~n; 15415#L18 assume !(~n < 1); 15414#L20 assume !(1 == ~n); 15402#L23 call #t~ret2 := fibo1(~n - 1);< 15412#fibo1ENTRY ~n := #in~n; 15408#L8 assume !(~n < 1); 15409#L10 assume !(1 == ~n); 15401#L13 call #t~ret0 := fibo2(~n - 1);< 15403#fibo2ENTRY ~n := #in~n; 15438#L18 assume !(~n < 1); 15429#L20 assume !(1 == ~n); 15399#L23 call #t~ret2 := fibo1(~n - 1);< 15410#fibo1ENTRY ~n := #in~n; 15411#L8 assume !(~n < 1); 15497#L10 assume !(1 == ~n); 15165#L13 call #t~ret0 := fibo2(~n - 1);< 15400#fibo2ENTRY ~n := #in~n; 15431#L18 assume !(~n < 1); 15432#L20 assume !(1 == ~n); 15163#L23 call #t~ret2 := fibo1(~n - 1);< 15166#fibo1ENTRY ~n := #in~n; 15638#L8 assume !(~n < 1); 15637#L10 assume 1 == ~n;#res := 1; 15636#fibo1FINAL assume true; 15634#fibo1EXIT >#45#return; 15174#L23-1 call #t~ret3 := fibo1(~n - 2);< 15187#fibo1ENTRY ~n := #in~n; 15231#L8 assume !(~n < 1); 15173#L10 assume 1 == ~n;#res := 1; 15176#fibo1FINAL assume true; 15201#fibo1EXIT >#47#return; 15643#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 15642#fibo2FINAL assume true; 15641#fibo2EXIT >#49#return; 15317#L13-1 call #t~ret1 := fibo2(~n - 2);< 15210#fibo2ENTRY ~n := #in~n; 15321#L18 assume !(~n < 1); 15316#L20 assume !(1 == ~n); 15270#L23 [2019-11-20 04:06:24,409 INFO L796 eck$LassoCheckResult]: Loop: 15270#L23 call #t~ret2 := fibo1(~n - 1);< 15287#fibo1ENTRY ~n := #in~n; 15283#L8 assume !(~n < 1); 15284#L10 assume !(1 == ~n); 15185#L13 call #t~ret0 := fibo2(~n - 1);< 15271#fibo2ENTRY ~n := #in~n; 15378#L18 assume !(~n < 1); 15360#L20 assume !(1 == ~n); 15336#L23 call #t~ret2 := fibo1(~n - 1);< 15344#fibo1ENTRY ~n := #in~n; 15353#L8 assume !(~n < 1); 15352#L10 assume 1 == ~n;#res := 1; 15346#fibo1FINAL assume true; 15335#fibo1EXIT >#45#return; 15188#L23-1 call #t~ret3 := fibo1(~n - 2);< 15189#fibo1ENTRY ~n := #in~n; 15383#L8 assume ~n < 1;#res := 0; 15202#fibo1FINAL assume true; 15205#fibo1EXIT >#47#return; 15191#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 15183#fibo2FINAL assume true; 15186#fibo2EXIT >#49#return; 15230#L13-1 call #t~ret1 := fibo2(~n - 2);< 15210#fibo2ENTRY ~n := #in~n; 15321#L18 assume !(~n < 1); 15316#L20 assume !(1 == ~n); 15270#L23 [2019-11-20 04:06:24,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:24,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1086760885, now seen corresponding path program 1 times [2019-11-20 04:06:24,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:24,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501774237] [2019-11-20 04:06:24,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:06:24,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501774237] [2019-11-20 04:06:24,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289361603] [2019-11-20 04:06:24,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:24,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 04:06:24,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 04:06:24,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:24,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 27 [2019-11-20 04:06:24,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040475920] [2019-11-20 04:06:24,970 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:24,970 INFO L82 PathProgramCache]: Analyzing trace with hash 980576813, now seen corresponding path program 2 times [2019-11-20 04:06:24,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:24,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058001131] [2019-11-20 04:06:24,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 04:06:25,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058001131] [2019-11-20 04:06:25,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670892201] [2019-11-20 04:06:25,113 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:25,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:25,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:25,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 04:06:25,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 04:06:25,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:25,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-11-20 04:06:25,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587061807] [2019-11-20 04:06:25,201 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 04:06:25,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:25,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 04:06:25,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-20 04:06:25,202 INFO L87 Difference]: Start difference. First operand 485 states and 639 transitions. cyclomatic complexity: 158 Second operand 13 states. [2019-11-20 04:06:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:25,424 INFO L93 Difference]: Finished difference Result 549 states and 744 transitions. [2019-11-20 04:06:25,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 04:06:25,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 744 transitions. [2019-11-20 04:06:25,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-20 04:06:25,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 524 states and 708 transitions. [2019-11-20 04:06:25,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2019-11-20 04:06:25,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2019-11-20 04:06:25,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 708 transitions. [2019-11-20 04:06:25,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:25,443 INFO L688 BuchiCegarLoop]: Abstraction has 524 states and 708 transitions. [2019-11-20 04:06:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 708 transitions. [2019-11-20 04:06:25,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 495. [2019-11-20 04:06:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-20 04:06:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 661 transitions. [2019-11-20 04:06:25,463 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-11-20 04:06:25,463 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 661 transitions. [2019-11-20 04:06:25,464 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 04:06:25,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 661 transitions. [2019-11-20 04:06:25,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-20 04:06:25,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:25,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:25,471 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:25,471 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:25,472 INFO L794 eck$LassoCheckResult]: Stem: 16577#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 16519#L37 call main_#t~ret4 := fibo1(main_~x~0);< 16533#fibo1ENTRY ~n := #in~n; 16973#L8 assume !(~n < 1); 16518#L10 assume !(1 == ~n); 16520#L13 call #t~ret0 := fibo2(~n - 1);< 16749#fibo2ENTRY ~n := #in~n; 16931#L18 assume !(~n < 1); 16804#L20 assume !(1 == ~n); 16753#L23 call #t~ret2 := fibo1(~n - 1);< 16796#fibo1ENTRY ~n := #in~n; 16827#L8 assume !(~n < 1); 16826#L10 assume !(1 == ~n); 16773#L13 call #t~ret0 := fibo2(~n - 1);< 16824#fibo2ENTRY ~n := #in~n; 16965#L18 assume !(~n < 1); 16913#L20 assume !(1 == ~n); 16750#L23 call #t~ret2 := fibo1(~n - 1);< 16762#fibo1ENTRY ~n := #in~n; 16756#L8 assume !(~n < 1); 16754#L10 assume !(1 == ~n); 16507#L13 call #t~ret0 := fibo2(~n - 1);< 16581#fibo2ENTRY ~n := #in~n; 16582#L18 assume !(~n < 1); 16595#L20 assume !(1 == ~n); 16506#L23 call #t~ret2 := fibo1(~n - 1);< 16509#fibo1ENTRY ~n := #in~n; 16986#L8 assume !(~n < 1); 16984#L10 assume 1 == ~n;#res := 1; 16983#fibo1FINAL assume true; 16977#fibo1EXIT >#45#return; 16527#L23-1 call #t~ret3 := fibo1(~n - 2);< 16528#fibo1ENTRY ~n := #in~n; 16574#L8 assume !(~n < 1); 16945#L10 assume 1 == ~n;#res := 1; 16943#fibo1FINAL assume true; 16940#fibo1EXIT >#47#return; 16939#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 16937#fibo2FINAL assume true; 16935#fibo2EXIT >#49#return; 16799#L13-1 call #t~ret1 := fibo2(~n - 2);< 16807#fibo2ENTRY ~n := #in~n; 16996#L18 assume ~n < 1;#res := 0; 16808#fibo2FINAL assume true; 16797#fibo2EXIT >#51#return; 16801#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 16990#fibo1FINAL assume true; 16777#fibo1EXIT >#45#return; 16606#L23-1 call #t~ret3 := fibo1(~n - 2);< 16774#fibo1ENTRY ~n := #in~n; 16605#L8 assume !(~n < 1); 16607#L10 assume !(1 == ~n); 16740#L13 [2019-11-20 04:06:25,472 INFO L796 eck$LassoCheckResult]: Loop: 16740#L13 call #t~ret0 := fibo2(~n - 1);< 16748#fibo2ENTRY ~n := #in~n; 16784#L18 assume !(~n < 1); 16775#L20 assume !(1 == ~n); 16745#L23 call #t~ret2 := fibo1(~n - 1);< 16767#fibo1ENTRY ~n := #in~n; 16958#L8 assume !(~n < 1); 16956#L10 assume !(1 == ~n); 16741#L13 call #t~ret0 := fibo2(~n - 1);< 16747#fibo2ENTRY ~n := #in~n; 16788#L18 assume !(~n < 1); 16785#L20 assume !(1 == ~n); 16787#L23 call #t~ret2 := fibo1(~n - 1);< 16849#fibo1ENTRY ~n := #in~n; 16864#L8 assume !(~n < 1); 16861#L10 assume 1 == ~n;#res := 1; 16859#fibo1FINAL assume true; 16846#fibo1EXIT >#45#return; 16589#L23-1 call #t~ret3 := fibo1(~n - 2);< 16845#fibo1ENTRY ~n := #in~n; 16588#L8 assume ~n < 1;#res := 0; 16590#fibo1FINAL assume true; 16844#fibo1EXIT >#47#return; 16841#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 16842#fibo2FINAL assume true; 16811#fibo2EXIT >#49#return; 16798#L13-1 call #t~ret1 := fibo2(~n - 2);< 16807#fibo2ENTRY ~n := #in~n; 16996#L18 assume ~n < 1;#res := 0; 16808#fibo2FINAL assume true; 16797#fibo2EXIT >#51#return; 16802#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 16805#fibo1FINAL assume true; 16763#fibo1EXIT >#45#return; 16759#L23-1 call #t~ret3 := fibo1(~n - 2);< 16772#fibo1ENTRY ~n := #in~n; 16966#L8 assume !(~n < 1); 16915#L10 assume !(1 == ~n); 16740#L13 [2019-11-20 04:06:25,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:25,472 INFO L82 PathProgramCache]: Analyzing trace with hash 783666534, now seen corresponding path program 1 times [2019-11-20 04:06:25,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:25,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539380674] [2019-11-20 04:06:25,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 04:06:25,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539380674] [2019-11-20 04:06:25,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127305484] [2019-11-20 04:06:25,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 04:06:25,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:06:25,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:25,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2019-11-20 04:06:25,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917276648] [2019-11-20 04:06:25,836 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:25,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1056491202, now seen corresponding path program 2 times [2019-11-20 04:06:25,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:25,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704751116] [2019-11-20 04:06:25,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 04:06:25,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704751116] [2019-11-20 04:06:25,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407893464] [2019-11-20 04:06:25,921 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:25,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:25,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:25,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 04:06:25,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 04:06:26,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:26,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-20 04:06:26,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476363314] [2019-11-20 04:06:26,076 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 04:06:26,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:26,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 04:06:26,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-20 04:06:26,077 INFO L87 Difference]: Start difference. First operand 495 states and 661 transitions. cyclomatic complexity: 170 Second operand 15 states. [2019-11-20 04:06:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:26,415 INFO L93 Difference]: Finished difference Result 518 states and 690 transitions. [2019-11-20 04:06:26,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 04:06:26,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 518 states and 690 transitions. [2019-11-20 04:06:26,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-20 04:06:26,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 518 states to 518 states and 690 transitions. [2019-11-20 04:06:26,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2019-11-20 04:06:26,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2019-11-20 04:06:26,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 518 states and 690 transitions. [2019-11-20 04:06:26,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:26,443 INFO L688 BuchiCegarLoop]: Abstraction has 518 states and 690 transitions. [2019-11-20 04:06:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states and 690 transitions. [2019-11-20 04:06:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 495. [2019-11-20 04:06:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-20 04:06:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 650 transitions. [2019-11-20 04:06:26,465 INFO L711 BuchiCegarLoop]: Abstraction has 495 states and 650 transitions. [2019-11-20 04:06:26,465 INFO L591 BuchiCegarLoop]: Abstraction has 495 states and 650 transitions. [2019-11-20 04:06:26,465 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 04:06:26,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 495 states and 650 transitions. [2019-11-20 04:06:26,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2019-11-20 04:06:26,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:26,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:26,472 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:26,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:26,472 INFO L794 eck$LassoCheckResult]: Stem: 18014#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 17965#L37 call main_#t~ret4 := fibo1(main_~x~0);< 17966#fibo1ENTRY ~n := #in~n; 18204#L8 assume !(~n < 1); 18191#L10 assume !(1 == ~n); 18182#L13 call #t~ret0 := fibo2(~n - 1);< 18208#fibo2ENTRY ~n := #in~n; 18207#L18 assume !(~n < 1); 18206#L20 assume !(1 == ~n); 18188#L23 call #t~ret2 := fibo1(~n - 1);< 18205#fibo1ENTRY ~n := #in~n; 18197#L8 assume !(~n < 1); 18198#L10 assume !(1 == ~n); 17963#L13 call #t~ret0 := fibo2(~n - 1);< 18189#fibo2ENTRY ~n := #in~n; 18268#L18 assume !(~n < 1); 18261#L20 assume !(1 == ~n); 17962#L23 call #t~ret2 := fibo1(~n - 1);< 17964#fibo1ENTRY ~n := #in~n; 18017#L8 assume !(~n < 1); 18406#L10 assume !(1 == ~n); 17960#L13 call #t~ret0 := fibo2(~n - 1);< 18187#fibo2ENTRY ~n := #in~n; 18203#L18 assume !(~n < 1); 18202#L20 assume !(1 == ~n); 17958#L23 call #t~ret2 := fibo1(~n - 1);< 17961#fibo1ENTRY ~n := #in~n; 18432#L8 assume !(~n < 1); 18431#L10 assume 1 == ~n;#res := 1; 18428#fibo1FINAL assume true; 18424#fibo1EXIT >#45#return; 18419#L23-1 call #t~ret3 := fibo1(~n - 2);< 17973#fibo1ENTRY ~n := #in~n; 18429#L8 assume !(~n < 1); 18427#L10 assume 1 == ~n;#res := 1; 18423#fibo1FINAL assume true; 18418#fibo1EXIT >#47#return; 18415#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 18410#fibo2FINAL assume true; 18404#fibo2EXIT >#49#return; 18007#L13-1 call #t~ret1 := fibo2(~n - 2);< 18009#fibo2ENTRY ~n := #in~n; 18021#L18 assume !(~n < 1); 18032#L20 assume 1 == ~n;#res := 1; 18033#fibo2FINAL assume true; 18396#fibo2EXIT >#51#return; 18397#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 18452#fibo1FINAL assume true; 18447#fibo1EXIT >#45#return; 17989#L23-1 call #t~ret3 := fibo1(~n - 2);< 18352#fibo1ENTRY ~n := #in~n; 18391#L8 assume !(~n < 1); 18040#L10 assume !(1 == ~n); 18041#L13 [2019-11-20 04:06:26,472 INFO L796 eck$LassoCheckResult]: Loop: 18041#L13 call #t~ret0 := fibo2(~n - 1);< 18183#fibo2ENTRY ~n := #in~n; 18269#L18 assume !(~n < 1); 18262#L20 assume !(1 == ~n); 18185#L23 call #t~ret2 := fibo1(~n - 1);< 18255#fibo1ENTRY ~n := #in~n; 18254#L8 assume !(~n < 1); 18252#L10 assume !(1 == ~n); 18177#L13 call #t~ret0 := fibo2(~n - 1);< 18186#fibo2ENTRY ~n := #in~n; 18270#L18 assume !(~n < 1); 18264#L20 assume !(1 == ~n); 18266#L23 call #t~ret2 := fibo1(~n - 1);< 18414#fibo1ENTRY ~n := #in~n; 18435#L8 assume !(~n < 1); 18434#L10 assume 1 == ~n;#res := 1; 18433#fibo1FINAL assume true; 18411#fibo1EXIT >#45#return; 17968#L23-1 call #t~ret3 := fibo1(~n - 2);< 18015#fibo1ENTRY ~n := #in~n; 18016#L8 assume ~n < 1;#res := 0; 18030#fibo1FINAL assume true; 18409#fibo1EXIT >#47#return; 18408#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 18407#fibo2FINAL assume true; 18355#fibo2EXIT >#49#return; 18019#L13-1 call #t~ret1 := fibo2(~n - 2);< 18009#fibo2ENTRY ~n := #in~n; 18021#L18 assume !(~n < 1); 18032#L20 assume 1 == ~n;#res := 1; 18033#fibo2FINAL assume true; 18396#fibo2EXIT >#51#return; 18394#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 18350#fibo1FINAL assume true; 18343#fibo1EXIT >#45#return; 18340#L23-1 call #t~ret3 := fibo1(~n - 2);< 18351#fibo1ENTRY ~n := #in~n; 18372#L8 assume !(~n < 1); 18361#L10 assume !(1 == ~n); 18041#L13 [2019-11-20 04:06:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1614825140, now seen corresponding path program 1 times [2019-11-20 04:06:26,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:26,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16506983] [2019-11-20 04:06:26,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 04:06:26,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16506983] [2019-11-20 04:06:26,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696241934] [2019-11-20 04:06:26,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:26,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 04:06:26,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:06:26,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:26,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 22 [2019-11-20 04:06:26,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483463184] [2019-11-20 04:06:26,813 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:26,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1482455256, now seen corresponding path program 1 times [2019-11-20 04:06:26,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:26,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967192019] [2019-11-20 04:06:26,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:26,824 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:06:27,192 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:27,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:27,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:27,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:27,193 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 04:06:27,193 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:27,193 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:27,193 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:27,193 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration11_Loop [2019-11-20 04:06:27,193 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:27,193 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:27,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,253 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:27,253 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:27,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:27,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:27,261 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:27,261 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:27,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:27,266 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:27,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 04:06:27,274 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:27,372 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 04:06:27,373 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:27,373 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:27,374 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:27,374 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:27,374 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 04:06:27,374 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:27,374 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:27,374 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:27,374 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration11_Loop [2019-11-20 04:06:27,374 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:27,374 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:27,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:27,453 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:27,453 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:27,458 INFO L120 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 Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:27,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:27,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:27,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:27,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:27,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:27,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:27,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:27,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 04:06:27,467 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-20 04:06:27,467 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:27,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 04:06:27,477 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:27,477 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 04:06:27,477 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-20 04:06:27,479 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 04:06:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:27,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 04:06:27,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:27,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:27,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:27,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:27,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:27,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 04:06:27,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 04:06:27,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-20 04:06:27,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 13 states. [2019-11-20 04:06:28,389 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 13 states. Result 1572 states and 2057 transitions. Complement of second has 49 states. [2019-11-20 04:06:28,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 04:06:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2019-11-20 04:06:28,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 58 transitions. Stem has 53 letters. Loop has 39 letters. [2019-11-20 04:06:28,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:28,395 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 04:06:28,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:28,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 04:06:28,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:28,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:28,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:28,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:28,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:28,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 04:06:28,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 04:06:28,786 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-20 04:06:28,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 13 states. [2019-11-20 04:06:29,646 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 13 states. Result 1677 states and 2221 transitions. Complement of second has 51 states. [2019-11-20 04:06:29,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 04:06:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2019-11-20 04:06:29,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 63 transitions. Stem has 53 letters. Loop has 39 letters. [2019-11-20 04:06:29,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:29,652 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 04:06:29,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:29,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 04:06:29,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:29,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:29,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:29,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:29,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:29,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 04:06:29,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 04:06:30,203 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 11 loop predicates [2019-11-20 04:06:30,203 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159 Second operand 13 states. [2019-11-20 04:06:30,912 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 495 states and 650 transitions. cyclomatic complexity: 159. Second operand 13 states. Result 2658 states and 3274 transitions. Complement of second has 128 states. [2019-11-20 04:06:30,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 04:06:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2019-11-20 04:06:30,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 53 letters. Loop has 39 letters. [2019-11-20 04:06:30,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:30,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 92 letters. Loop has 39 letters. [2019-11-20 04:06:30,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:30,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 53 letters. Loop has 78 letters. [2019-11-20 04:06:30,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:30,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2658 states and 3274 transitions. [2019-11-20 04:06:30,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2019-11-20 04:06:30,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2658 states to 1693 states and 2197 transitions. [2019-11-20 04:06:30,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 324 [2019-11-20 04:06:30,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2019-11-20 04:06:30,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1693 states and 2197 transitions. [2019-11-20 04:06:30,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:30,974 INFO L688 BuchiCegarLoop]: Abstraction has 1693 states and 2197 transitions. [2019-11-20 04:06:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states and 2197 transitions. [2019-11-20 04:06:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1488. [2019-11-20 04:06:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-11-20 04:06:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1848 transitions. [2019-11-20 04:06:31,029 INFO L711 BuchiCegarLoop]: Abstraction has 1488 states and 1848 transitions. [2019-11-20 04:06:31,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 04:06:31,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-11-20 04:06:31,030 INFO L87 Difference]: Start difference. First operand 1488 states and 1848 transitions. Second operand 22 states. [2019-11-20 04:06:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:31,680 INFO L93 Difference]: Finished difference Result 1553 states and 1910 transitions. [2019-11-20 04:06:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 04:06:31,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1553 states and 1910 transitions. [2019-11-20 04:06:31,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2019-11-20 04:06:31,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1553 states to 1494 states and 1849 transitions. [2019-11-20 04:06:31,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2019-11-20 04:06:31,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2019-11-20 04:06:31,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1494 states and 1849 transitions. [2019-11-20 04:06:31,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:31,714 INFO L688 BuchiCegarLoop]: Abstraction has 1494 states and 1849 transitions. [2019-11-20 04:06:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states and 1849 transitions. [2019-11-20 04:06:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1449. [2019-11-20 04:06:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2019-11-20 04:06:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1778 transitions. [2019-11-20 04:06:31,762 INFO L711 BuchiCegarLoop]: Abstraction has 1449 states and 1778 transitions. [2019-11-20 04:06:31,762 INFO L591 BuchiCegarLoop]: Abstraction has 1449 states and 1778 transitions. [2019-11-20 04:06:31,762 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 04:06:31,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1449 states and 1778 transitions. [2019-11-20 04:06:31,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2019-11-20 04:06:31,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:31,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:31,774 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [15, 13, 13, 12, 12, 11, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 1, 1, 1] [2019-11-20 04:06:31,774 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:31,774 INFO L794 eck$LassoCheckResult]: Stem: 28881#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 28850#L37 call main_#t~ret4 := fibo1(main_~x~0);< 28851#fibo1ENTRY ~n := #in~n; 29195#L8 assume !(~n < 1); 29194#L10 assume !(1 == ~n); 29192#L13 call #t~ret0 := fibo2(~n - 1);< 29193#fibo2ENTRY ~n := #in~n; 29208#L18 assume !(~n < 1); 29206#L20 assume !(1 == ~n); 29203#L23 call #t~ret2 := fibo1(~n - 1);< 29204#fibo1ENTRY ~n := #in~n; 29231#L8 assume !(~n < 1); 29230#L10 assume !(1 == ~n); 29228#L13 call #t~ret0 := fibo2(~n - 1);< 29229#fibo2ENTRY ~n := #in~n; 29366#L18 assume !(~n < 1); 29364#L20 assume !(1 == ~n); 29355#L23 call #t~ret2 := fibo1(~n - 1);< 29356#fibo1ENTRY ~n := #in~n; 29370#L8 assume !(~n < 1); 29369#L10 assume !(1 == ~n); 28826#L13 call #t~ret0 := fibo2(~n - 1);< 29347#fibo2ENTRY ~n := #in~n; 29345#L18 assume !(~n < 1); 29343#L20 assume !(1 == ~n); 29341#L23 call #t~ret2 := fibo1(~n - 1);< 29342#fibo1ENTRY ~n := #in~n; 29382#L8 assume !(~n < 1); 29404#L10 assume !(1 == ~n); 29400#L13 call #t~ret0 := fibo2(~n - 1);< 29401#fibo2ENTRY ~n := #in~n; 29406#L18 assume !(~n < 1); 29405#L20 assume 1 == ~n;#res := 1; 29403#fibo2FINAL assume true; 29399#fibo2EXIT >#49#return; 29396#L13-1 call #t~ret1 := fibo2(~n - 2);< 29397#fibo2ENTRY ~n := #in~n; 29402#L18 assume ~n < 1;#res := 0; 29398#fibo2FINAL assume true; 29395#fibo2EXIT >#51#return; 29394#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29392#fibo1FINAL assume true; 29389#fibo1EXIT >#45#return; 29384#L23-1 call #t~ret3 := fibo1(~n - 2);< 29385#fibo1ENTRY ~n := #in~n; 29393#L8 assume !(~n < 1); 29391#L10 assume 1 == ~n;#res := 1; 29388#fibo1FINAL assume true; 29383#fibo1EXIT >#47#return; 29379#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29375#fibo2FINAL assume true; 29368#fibo2EXIT >#49#return; 29215#L13-1 call #t~ret1 := fibo2(~n - 2);< 29244#fibo2ENTRY ~n := #in~n; 29365#L18 assume !(~n < 1); 29363#L20 assume 1 == ~n;#res := 1; 29359#fibo2FINAL assume true; 29348#fibo2EXIT >#51#return; 29220#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29362#fibo1FINAL assume true; 29354#fibo1EXIT >#45#return; 29284#L23-1 call #t~ret3 := fibo1(~n - 2);< 29336#fibo1ENTRY ~n := #in~n; 29551#L8 assume !(~n < 1); 29549#L10 assume !(1 == ~n); 29547#L13 call #t~ret0 := fibo2(~n - 1);< 29548#fibo2ENTRY ~n := #in~n; 29560#L18 assume !(~n < 1); 29556#L20 assume 1 == ~n;#res := 1; 29555#fibo2FINAL assume true; 29546#fibo2EXIT >#49#return; 29352#L13-1 call #t~ret1 := fibo2(~n - 2);< 29353#fibo2ENTRY ~n := #in~n; 29622#L18 assume ~n < 1;#res := 0; 29619#fibo2FINAL assume true; 29620#fibo2EXIT >#51#return; 29349#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29339#fibo1FINAL assume true; 29334#fibo1EXIT >#47#return; 29288#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29328#fibo2FINAL assume true; 29227#fibo2EXIT >#49#return; 29213#L13-1 call #t~ret1 := fibo2(~n - 2);< 29221#fibo2ENTRY ~n := #in~n; 29320#L18 assume !(~n < 1); 29319#L20 assume !(1 == ~n); 29286#L23 call #t~ret2 := fibo1(~n - 1);< 29291#fibo1ENTRY ~n := #in~n; 29413#L8 assume !(~n < 1); 29411#L10 assume !(1 == ~n); 29103#L13 call #t~ret0 := fibo2(~n - 1);< 29496#fibo2ENTRY ~n := #in~n; 29502#L18 assume !(~n < 1); 29499#L20 assume !(1 == ~n); 29500#L23 call #t~ret2 := fibo1(~n - 1);< 29520#fibo1ENTRY ~n := #in~n; 29524#L8 assume !(~n < 1); 29523#L10 assume 1 == ~n;#res := 1; 29522#fibo1FINAL assume true; 29518#fibo1EXIT >#45#return; 29511#L23-1 call #t~ret3 := fibo1(~n - 2);< 29516#fibo1ENTRY ~n := #in~n; 29521#L8 assume ~n < 1;#res := 0; 29517#fibo1FINAL assume true; 29510#fibo1EXIT >#47#return; 29509#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29508#fibo2FINAL assume true; 29507#fibo2EXIT >#49#return; 29489#L13-1 call #t~ret1 := fibo2(~n - 2);< 29504#fibo2ENTRY ~n := #in~n; 29505#L18 assume !(~n < 1); 29749#L20 assume 1 == ~n;#res := 1; 29746#fibo2FINAL assume true; 29743#fibo2EXIT >#51#return; 29740#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29738#fibo1FINAL assume true; 29289#fibo1EXIT >#45#return; 29255#L23-1 call #t~ret3 := fibo1(~n - 2);< 29256#fibo1ENTRY ~n := #in~n; 29429#L8 assume !(~n < 1); 29426#L10 assume 1 == ~n;#res := 1; 29427#fibo1FINAL assume true; 29477#fibo1EXIT >#47#return; 29249#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29243#fibo2FINAL assume true; 29210#fibo2EXIT >#51#return; 29209#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29207#fibo1FINAL assume true; 29202#fibo1EXIT >#45#return; 29027#L23-1 call #t~ret3 := fibo1(~n - 2);< 29200#fibo1ENTRY ~n := #in~n; 29615#L8 assume !(~n < 1); 29612#L10 assume !(1 == ~n); 28988#L13 call #t~ret0 := fibo2(~n - 1);< 29023#fibo2ENTRY ~n := #in~n; 28994#L18 assume !(~n < 1); 28993#L20 assume !(1 == ~n); 28991#L23 call #t~ret2 := fibo1(~n - 1);< 28992#fibo1ENTRY ~n := #in~n; 29316#L8 assume !(~n < 1); 29314#L10 assume !(1 == ~n); 29277#L13 call #t~ret0 := fibo2(~n - 1);< 29279#fibo2ENTRY ~n := #in~n; 29324#L18 assume !(~n < 1); 29299#L20 assume 1 == ~n;#res := 1; 29280#fibo2FINAL assume true; 29276#fibo2EXIT >#49#return; 29267#L13-1 call #t~ret1 := fibo2(~n - 2);< 29275#fibo2ENTRY ~n := #in~n; 29317#L18 assume ~n < 1;#res := 0; 29298#fibo2FINAL assume true; 29266#fibo2EXIT >#51#return; 29265#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 29253#fibo1FINAL assume true; 29248#fibo1EXIT >#45#return; 29237#L23-1 call #t~ret3 := fibo1(~n - 2);< 29242#fibo1ENTRY ~n := #in~n; 29433#L8 assume !(~n < 1); 29432#L10 assume 1 == ~n;#res := 1; 28902#fibo1FINAL assume true; 29236#fibo1EXIT >#47#return; 29226#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 29225#fibo2FINAL assume true; 29224#fibo2EXIT >#49#return; 28924#L13-1 call #t~ret1 := fibo2(~n - 2);< 28928#fibo2ENTRY ~n := #in~n; 28927#L18 assume !(~n < 1); 28922#L20 assume !(1 == ~n); 28865#L23 [2019-11-20 04:06:31,775 INFO L796 eck$LassoCheckResult]: Loop: 28865#L23 call #t~ret2 := fibo1(~n - 1);< 28953#fibo1ENTRY ~n := #in~n; 28949#L8 assume !(~n < 1); 28950#L10 assume !(1 == ~n); 28931#L13 call #t~ret0 := fibo2(~n - 1);< 28933#fibo2ENTRY ~n := #in~n; 28948#L18 assume !(~n < 1); 28947#L20 assume !(1 == ~n); 28944#L23 call #t~ret2 := fibo1(~n - 1);< 28946#fibo1ENTRY ~n := #in~n; 29781#L8 assume !(~n < 1); 29780#L10 assume !(1 == ~n); 29777#L13 call #t~ret0 := fibo2(~n - 1);< 29779#fibo2ENTRY ~n := #in~n; 29809#L18 assume !(~n < 1); 29804#L20 assume 1 == ~n;#res := 1; 29805#fibo2FINAL assume true; 29776#fibo2EXIT >#49#return; 29761#L13-1 call #t~ret1 := fibo2(~n - 2);< 29871#fibo2ENTRY ~n := #in~n; 29875#L18 assume ~n < 1;#res := 0; 29869#fibo2FINAL assume true; 29758#fibo2EXIT >#51#return; 29767#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 30174#fibo1FINAL assume true; 30169#fibo1EXIT >#45#return; 28939#L23-1 call #t~ret3 := fibo1(~n - 2);< 28940#fibo1ENTRY ~n := #in~n; 30178#L8 assume !(~n < 1); 30177#L10 assume 1 == ~n;#res := 1; 30175#fibo1FINAL assume true; 30172#fibo1EXIT >#47#return; 28935#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 28934#fibo2FINAL assume true; 28930#fibo2EXIT >#49#return; 28923#L13-1 call #t~ret1 := fibo2(~n - 2);< 28928#fibo2ENTRY ~n := #in~n; 28927#L18 assume !(~n < 1); 28922#L20 assume !(1 == ~n); 28865#L23 [2019-11-20 04:06:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:31,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2142147031, now seen corresponding path program 1 times [2019-11-20 04:06:31,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:31,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261366924] [2019-11-20 04:06:31,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 221 proven. 312 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2019-11-20 04:06:32,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261366924] [2019-11-20 04:06:32,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548896986] [2019-11-20 04:06:32,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 04:06:32,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 390 proven. 162 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-11-20 04:06:32,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:32,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13] total 30 [2019-11-20 04:06:32,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803979496] [2019-11-20 04:06:32,658 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:32,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1831895155, now seen corresponding path program 1 times [2019-11-20 04:06:32,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:32,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830197747] [2019-11-20 04:06:32,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:32,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:06:33,045 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:33,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:33,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:33,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:33,046 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 04:06:33,046 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:33,046 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:33,046 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:33,046 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration12_Loop [2019-11-20 04:06:33,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:33,047 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:33,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:33,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:33,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:33,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:33,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:33,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:33,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:33,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:33,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:33,137 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:33,137 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:33,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:33,145 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:33,150 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:33,150 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:33,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:33,158 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:33,163 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:33,163 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:33,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:33,170 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:33,175 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:33,175 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:33,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:33,190 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:33,195 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:33,195 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:33,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:33,203 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:33,208 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:33,208 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:33,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:33,219 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:33,224 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:33,224 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:33,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:33,232 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:33,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 04:06:33,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:35,888 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 04:06:35,890 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:35,891 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:35,891 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:35,891 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:35,891 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 04:06:35,891 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:35,891 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:35,891 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:35,891 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration12_Loop [2019-11-20 04:06:35,891 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:35,891 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:35,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:35,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:35,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:35,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:35,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:35,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:35,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:35,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:35,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:35,953 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:35,954 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:35,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:35,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:35,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:35,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:35,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:35,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:35,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:35,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:35,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:35,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:35,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:35,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:35,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:35,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:35,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:35,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:35,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:35,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:35,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:35,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:35,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:35,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:35,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:35,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:35,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:35,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:35,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:35,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:35,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:35,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:35,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:35,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:35,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:35,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:35,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:35,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:36,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:36,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:36,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:36,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:36,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:36,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:36,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:36,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:36,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:36,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:36,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:36,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:36,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:36,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:36,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:36,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:36,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:36,018 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 04:06:36,021 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-20 04:06:36,022 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:36,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 04:06:36,025 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 04:06:36,026 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 04:06:36,026 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2019-11-20 04:06:36,031 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 04:06:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:36,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-20 04:06:36,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:36,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:36,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 04:06:36,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 04:06:36,545 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-20 04:06:36,545 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338 Second operand 13 states. [2019-11-20 04:06:37,195 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338. Second operand 13 states. Result 2883 states and 3513 transitions. Complement of second has 50 states. [2019-11-20 04:06:37,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 04:06:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2019-11-20 04:06:37,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 168 letters. Loop has 39 letters. [2019-11-20 04:06:37,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:37,199 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 04:06:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:37,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-20 04:06:37,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:37,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:37,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 04:06:37,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 04:06:37,710 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2019-11-20 04:06:37,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338 Second operand 13 states. [2019-11-20 04:06:38,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338. Second operand 13 states. Result 2999 states and 3662 transitions. Complement of second has 52 states. [2019-11-20 04:06:38,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 04:06:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2019-11-20 04:06:38,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 168 letters. Loop has 39 letters. [2019-11-20 04:06:38,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:38,413 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 04:06:38,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:38,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-20 04:06:38,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:38,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:38,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 04:06:38,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 04:06:38,936 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 11 loop predicates [2019-11-20 04:06:38,937 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338 Second operand 13 states. [2019-11-20 04:06:39,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1449 states and 1778 transitions. cyclomatic complexity: 338. Second operand 13 states. Result 4589 states and 5376 transitions. Complement of second has 127 states. [2019-11-20 04:06:39,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 04:06:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2019-11-20 04:06:39,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 168 letters. Loop has 39 letters. [2019-11-20 04:06:39,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:39,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 207 letters. Loop has 39 letters. [2019-11-20 04:06:39,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:39,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 80 transitions. Stem has 168 letters. Loop has 78 letters. [2019-11-20 04:06:39,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:39,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4589 states and 5376 transitions. [2019-11-20 04:06:39,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-20 04:06:39,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4589 states to 3185 states and 3878 transitions. [2019-11-20 04:06:39,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-11-20 04:06:39,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2019-11-20 04:06:39,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3185 states and 3878 transitions. [2019-11-20 04:06:39,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:39,830 INFO L688 BuchiCegarLoop]: Abstraction has 3185 states and 3878 transitions. [2019-11-20 04:06:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states and 3878 transitions. [2019-11-20 04:06:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 2761. [2019-11-20 04:06:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2019-11-20 04:06:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3277 transitions. [2019-11-20 04:06:39,922 INFO L711 BuchiCegarLoop]: Abstraction has 2761 states and 3277 transitions. [2019-11-20 04:06:39,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:39,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-20 04:06:39,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2019-11-20 04:06:39,923 INFO L87 Difference]: Start difference. First operand 2761 states and 3277 transitions. Second operand 30 states. [2019-11-20 04:06:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:41,546 INFO L93 Difference]: Finished difference Result 4283 states and 5397 transitions. [2019-11-20 04:06:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-20 04:06:41,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4283 states and 5397 transitions. [2019-11-20 04:06:41,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-11-20 04:06:41,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4283 states to 2695 states and 3264 transitions. [2019-11-20 04:06:41,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2019-11-20 04:06:41,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2019-11-20 04:06:41,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2695 states and 3264 transitions. [2019-11-20 04:06:41,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:41,694 INFO L688 BuchiCegarLoop]: Abstraction has 2695 states and 3264 transitions. [2019-11-20 04:06:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states and 3264 transitions. [2019-11-20 04:06:41,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2337. [2019-11-20 04:06:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-11-20 04:06:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 2749 transitions. [2019-11-20 04:06:41,774 INFO L711 BuchiCegarLoop]: Abstraction has 2337 states and 2749 transitions. [2019-11-20 04:06:41,774 INFO L591 BuchiCegarLoop]: Abstraction has 2337 states and 2749 transitions. [2019-11-20 04:06:41,774 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-20 04:06:41,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2337 states and 2749 transitions. [2019-11-20 04:06:41,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-11-20 04:06:41,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:41,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:41,794 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [24, 24, 23, 23, 20, 19, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 7, 5, 4, 1, 1] [2019-11-20 04:06:41,795 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [22, 21, 20, 19, 17, 17, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 7, 6, 5, 3] [2019-11-20 04:06:41,795 INFO L794 eck$LassoCheckResult]: Stem: 51110#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 51078#L37 call main_#t~ret4 := fibo1(main_~x~0);< 51079#fibo1ENTRY ~n := #in~n; 51149#L8 assume !(~n < 1); 51148#L10 assume !(1 == ~n); 51144#L13 call #t~ret0 := fibo2(~n - 1);< 51147#fibo2ENTRY ~n := #in~n; 51146#L18 assume !(~n < 1); 51145#L20 assume !(1 == ~n); 51140#L23 call #t~ret2 := fibo1(~n - 1);< 51143#fibo1ENTRY ~n := #in~n; 51142#L8 assume !(~n < 1); 51141#L10 assume !(1 == ~n); 51137#L13 call #t~ret0 := fibo2(~n - 1);< 51139#fibo2ENTRY ~n := #in~n; 51138#L18 assume !(~n < 1); 51136#L20 assume !(1 == ~n); 51132#L23 call #t~ret2 := fibo1(~n - 1);< 51134#fibo1ENTRY ~n := #in~n; 51133#L8 assume !(~n < 1); 51131#L10 assume !(1 == ~n); 51050#L13 call #t~ret0 := fibo2(~n - 1);< 51130#fibo2ENTRY ~n := #in~n; 51129#L18 assume !(~n < 1); 51127#L20 assume !(1 == ~n); 51120#L23 call #t~ret2 := fibo1(~n - 1);< 51135#fibo1ENTRY ~n := #in~n; 51119#L8 assume !(~n < 1); 51121#L10 assume !(1 == ~n); 52895#L13 call #t~ret0 := fibo2(~n - 1);< 52896#fibo2ENTRY ~n := #in~n; 52900#L18 assume !(~n < 1); 52899#L20 assume 1 == ~n;#res := 1; 52898#fibo2FINAL assume true; 52894#fibo2EXIT >#49#return; 52891#L13-1 call #t~ret1 := fibo2(~n - 2);< 52892#fibo2ENTRY ~n := #in~n; 52897#L18 assume ~n < 1;#res := 0; 52893#fibo2FINAL assume true; 52890#fibo2EXIT >#51#return; 52889#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52888#fibo1FINAL assume true; 52887#fibo1EXIT >#45#return; 52642#L23-1 call #t~ret3 := fibo1(~n - 2);< 52643#fibo1ENTRY ~n := #in~n; 53033#L8 assume !(~n < 1); 53031#L10 assume 1 == ~n;#res := 1; 53029#fibo1FINAL assume true; 52641#fibo1EXIT >#47#return; 52638#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52639#fibo2FINAL assume true; 52907#fibo2EXIT >#49#return; 52606#L13-1 call #t~ret1 := fibo2(~n - 2);< 52607#fibo2ENTRY ~n := #in~n; 53050#L18 assume !(~n < 1); 53044#L20 assume !(1 == ~n); 53041#L23 call #t~ret2 := fibo1(~n - 1);< 53042#fibo1ENTRY ~n := #in~n; 53100#L8 assume !(~n < 1); 53086#L10 assume 1 == ~n;#res := 1; 53058#fibo1FINAL assume true; 53040#fibo1EXIT >#45#return; 53037#L23-1 call #t~ret3 := fibo1(~n - 2);< 53038#fibo1ENTRY ~n := #in~n; 53139#L8 assume ~n < 1;#res := 0; 53133#fibo1FINAL assume true; 53134#fibo1EXIT >#47#return; 52925#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52921#fibo2FINAL assume true; 52910#fibo2EXIT >#51#return; 52587#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52585#fibo1FINAL assume true; 51588#fibo1EXIT >#45#return; 51583#L23-1 call #t~ret3 := fibo1(~n - 2);< 51587#fibo1ENTRY ~n := #in~n; 52653#L8 assume !(~n < 1); 52792#L10 assume !(1 == ~n); 52989#L13 call #t~ret0 := fibo2(~n - 1);< 52990#fibo2ENTRY ~n := #in~n; 53007#L18 assume !(~n < 1); 53005#L20 assume !(1 == ~n); 53001#L23 call #t~ret2 := fibo1(~n - 1);< 53002#fibo1ENTRY ~n := #in~n; 53008#L8 assume !(~n < 1); 53006#L10 assume 1 == ~n;#res := 1; 53004#fibo1FINAL assume true; 53000#fibo1EXIT >#45#return; 52997#L23-1 call #t~ret3 := fibo1(~n - 2);< 52998#fibo1ENTRY ~n := #in~n; 53003#L8 assume ~n < 1;#res := 0; 52999#fibo1FINAL assume true; 52996#fibo1EXIT >#47#return; 52995#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52992#fibo2FINAL assume true; 52988#fibo2EXIT >#49#return; 52985#L13-1 call #t~ret1 := fibo2(~n - 2);< 52986#fibo2ENTRY ~n := #in~n; 52993#L18 assume !(~n < 1); 52991#L20 assume 1 == ~n;#res := 1; 52987#fibo2FINAL assume true; 52984#fibo2EXIT >#51#return; 52983#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52979#fibo1FINAL assume true; 51581#fibo1EXIT >#47#return; 51580#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51574#fibo2FINAL assume true; 51567#fibo2EXIT >#49#return; 51553#L13-1 call #t~ret1 := fibo2(~n - 2);< 51559#fibo2ENTRY ~n := #in~n; 52062#L18 assume !(~n < 1); 52056#L20 assume !(1 == ~n); 52006#L23 call #t~ret2 := fibo1(~n - 1);< 52009#fibo1ENTRY ~n := #in~n; 52081#L8 assume !(~n < 1); 52078#L10 assume !(1 == ~n); 52079#L13 call #t~ret0 := fibo2(~n - 1);< 52610#fibo2ENTRY ~n := #in~n; 52707#L18 assume !(~n < 1); 52706#L20 assume !(1 == ~n); 52703#L23 call #t~ret2 := fibo1(~n - 1);< 52705#fibo1ENTRY ~n := #in~n; 52714#L8 assume !(~n < 1); 52713#L10 assume 1 == ~n;#res := 1; 52708#fibo1FINAL assume true; 52702#fibo1EXIT >#45#return; 52698#L23-1 call #t~ret3 := fibo1(~n - 2);< 52701#fibo1ENTRY ~n := #in~n; 52716#L8 assume ~n < 1;#res := 0; 52715#fibo1FINAL assume true; 52697#fibo1EXIT >#47#return; 52696#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52695#fibo2FINAL assume true; 52609#fibo2EXIT >#49#return; 52596#L13-1 call #t~ret1 := fibo2(~n - 2);< 52597#fibo2ENTRY ~n := #in~n; 52681#L18 assume !(~n < 1); 52676#L20 assume 1 == ~n;#res := 1; 52674#fibo2FINAL assume true; 52595#fibo2EXIT >#51#return; 52594#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52593#fibo1FINAL assume true; 52592#fibo1EXIT >#45#return; 52589#L23-1 call #t~ret3 := fibo1(~n - 2);< 52591#fibo1ENTRY ~n := #in~n; 52742#L8 assume !(~n < 1); 52741#L10 assume !(1 == ~n); 52683#L13 call #t~ret0 := fibo2(~n - 1);< 52684#fibo2ENTRY ~n := #in~n; 52693#L18 assume !(~n < 1); 52690#L20 assume 1 == ~n;#res := 1; 52687#fibo2FINAL assume true; 52682#fibo2EXIT >#49#return; 52678#L13-1 call #t~ret1 := fibo2(~n - 2);< 52680#fibo2ENTRY ~n := #in~n; 52736#L18 assume ~n < 1;#res := 0; 52728#fibo2FINAL assume true; 52677#fibo2EXIT >#51#return; 52675#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52673#fibo1FINAL assume true; 52588#fibo1EXIT >#47#return; 51722#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51719#fibo2FINAL assume true; 51549#fibo2EXIT >#51#return; 51547#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51545#fibo1FINAL assume true; 51538#fibo1EXIT >#45#return; 51524#L23-1 call #t~ret3 := fibo1(~n - 2);< 51533#fibo1ENTRY ~n := #in~n; 51611#L8 assume !(~n < 1); 51612#L10 assume !(1 == ~n); 51518#L13 call #t~ret0 := fibo2(~n - 1);< 51523#fibo2ENTRY ~n := #in~n; 51548#L18 assume !(~n < 1); 51546#L20 assume !(1 == ~n); 51542#L23 call #t~ret2 := fibo1(~n - 1);< 51543#fibo1ENTRY ~n := #in~n; 51775#L8 assume !(~n < 1); 51761#L10 assume !(1 == ~n); 51757#L13 call #t~ret0 := fibo2(~n - 1);< 51759#fibo2ENTRY ~n := #in~n; 51771#L18 assume !(~n < 1); 51769#L20 assume 1 == ~n;#res := 1; 51765#fibo2FINAL assume true; 51756#fibo2EXIT >#49#return; 51747#L13-1 call #t~ret1 := fibo2(~n - 2);< 51750#fibo2ENTRY ~n := #in~n; 51763#L18 assume ~n < 1;#res := 0; 51755#fibo2FINAL assume true; 51746#fibo2EXIT >#51#return; 51744#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51742#fibo1FINAL assume true; 51725#fibo1EXIT >#45#return; 51074#L23-1 call #t~ret3 := fibo1(~n - 2);< 51107#fibo1ENTRY ~n := #in~n; 51108#L8 assume !(~n < 1); 51073#L10 assume 1 == ~n;#res := 1; 51075#fibo1FINAL assume true; 51629#fibo1EXIT >#47#return; 51627#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51625#fibo2FINAL assume true; 51624#fibo2EXIT >#49#return; 51615#L13-1 call #t~ret1 := fibo2(~n - 2);< 51618#fibo2ENTRY ~n := #in~n; 51721#L18 assume !(~n < 1); 51729#L20 assume !(1 == ~n); 51724#L23 call #t~ret2 := fibo1(~n - 1);< 51726#fibo1ENTRY ~n := #in~n; 51822#L8 assume !(~n < 1); 51780#L10 assume !(1 == ~n); 51736#L13 call #t~ret0 := fibo2(~n - 1);< 51738#fibo2ENTRY ~n := #in~n; 51818#L18 assume !(~n < 1); 51741#L20 assume 1 == ~n;#res := 1; 51740#fibo2FINAL assume true; 51735#fibo2EXIT >#49#return; 51732#L13-1 call #t~ret1 := fibo2(~n - 2);< 51094#fibo2ENTRY ~n := #in~n; 51739#L18 assume ~n < 1;#res := 0; 51734#fibo2FINAL assume true; 51731#fibo2EXIT >#51#return; 51730#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51728#fibo1FINAL assume true; 51723#fibo1EXIT >#45#return; 51630#L23-1 call #t~ret3 := fibo1(~n - 2);< 51062#fibo1ENTRY ~n := #in~n; 52618#L8 assume !(~n < 1); 52617#L10 assume 1 == ~n;#res := 1; 52616#fibo1FINAL assume true; 52613#fibo1EXIT >#47#return; 51627#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51625#fibo2FINAL assume true; 51624#fibo2EXIT >#51#return; 51520#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51610#fibo1FINAL assume true; 51532#fibo1EXIT >#47#return; 51530#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51525#fibo2FINAL assume true; 51515#fibo2EXIT >#49#return; 51194#L13-1 call #t~ret1 := fibo2(~n - 2);< 51227#fibo2ENTRY ~n := #in~n; 51228#L18 assume !(~n < 1); 51561#L20 assume !(1 == ~n); 51159#L23 call #t~ret2 := fibo1(~n - 1);< 51185#fibo1ENTRY ~n := #in~n; 51186#L8 assume !(~n < 1); 51176#L10 assume !(1 == ~n); 51158#L13 call #t~ret0 := fibo2(~n - 1);< 51160#fibo2ENTRY ~n := #in~n; 51180#L18 assume !(~n < 1); 51175#L20 assume !(1 == ~n); 51172#L23 call #t~ret2 := fibo1(~n - 1);< 51174#fibo1ENTRY ~n := #in~n; 51200#L8 assume !(~n < 1); 51199#L10 assume !(1 == ~n); 51196#L13 call #t~ret0 := fibo2(~n - 1);< 51198#fibo2ENTRY ~n := #in~n; 51381#L18 assume !(~n < 1); 51379#L20 assume 1 == ~n;#res := 1; 51380#fibo2FINAL assume true; 51419#fibo2EXIT >#49#return; 51413#L13-1 call #t~ret1 := fibo2(~n - 2);< 51416#fibo2ENTRY ~n := #in~n; 51421#L18 assume ~n < 1;#res := 0; 51420#fibo2FINAL assume true; 51412#fibo2EXIT >#51#return; 51410#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51409#fibo1FINAL assume true; 51321#fibo1EXIT >#45#return; 51305#L23-1 call #t~ret3 := fibo1(~n - 2);< 51331#fibo1ENTRY ~n := #in~n; 51426#L8 assume !(~n < 1); 51425#L10 assume 1 == ~n;#res := 1; 51333#fibo1FINAL assume true; 51302#fibo1EXIT >#47#return; 51307#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51713#fibo2FINAL assume true; 51628#fibo2EXIT >#49#return; 51059#L13-1 call #t~ret1 := fibo2(~n - 2);< 51619#fibo2ENTRY ~n := #in~n; 51150#L18 assume !(~n < 1); 51128#L20 assume !(1 == ~n); 51086#L23 call #t~ret2 := fibo1(~n - 1);< 51774#fibo1ENTRY ~n := #in~n; 51778#L8 assume !(~n < 1); 51777#L10 assume 1 == ~n;#res := 1; 51776#fibo1FINAL assume true; 51772#fibo1EXIT >#45#return; 51753#L23-1 call #t~ret3 := fibo1(~n - 2);< 51754#fibo1ENTRY ~n := #in~n; 51766#L8 assume ~n < 1;#res := 0; 51760#fibo1FINAL assume true; 51751#fibo1EXIT >#47#return; 51080#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51081#fibo2FINAL assume true; 51616#fibo2EXIT >#51#return; 51520#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51610#fibo1FINAL assume true; 51532#fibo1EXIT >#45#return; 51099#L23-1 call #t~ret3 := fibo1(~n - 2);< 51536#fibo1ENTRY [2019-11-20 04:06:41,797 INFO L796 eck$LassoCheckResult]: Loop: 51536#fibo1ENTRY ~n := #in~n; 51609#L8 assume !(~n < 1); 51529#L10 assume !(1 == ~n); 51517#L13 call #t~ret0 := fibo2(~n - 1);< 51523#fibo2ENTRY ~n := #in~n; 51548#L18 assume !(~n < 1); 51546#L20 assume !(1 == ~n); 51542#L23 call #t~ret2 := fibo1(~n - 1);< 51544#fibo1ENTRY ~n := #in~n; 51658#L8 assume !(~n < 1); 51654#L10 assume !(1 == ~n); 51648#L13 call #t~ret0 := fibo2(~n - 1);< 51649#fibo2ENTRY ~n := #in~n; 51684#L18 assume !(~n < 1); 51676#L20 assume !(1 == ~n); 51677#L23 call #t~ret2 := fibo1(~n - 1);< 51695#fibo1ENTRY ~n := #in~n; 51693#L8 assume !(~n < 1); 51690#L10 assume !(1 == ~n); 51668#L13 call #t~ret0 := fibo2(~n - 1);< 51687#fibo2ENTRY ~n := #in~n; 51686#L18 assume !(~n < 1); 51681#L20 assume 1 == ~n;#res := 1; 51682#fibo2FINAL assume true; 52216#fibo2EXIT >#49#return; 52213#L13-1 call #t~ret1 := fibo2(~n - 2);< 52214#fibo2ENTRY ~n := #in~n; 52217#L18 assume ~n < 1;#res := 0; 52215#fibo2FINAL assume true; 52212#fibo2EXIT >#51#return; 52207#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52037#fibo1FINAL assume true; 52038#fibo1EXIT >#45#return; 52028#L23-1 call #t~ret3 := fibo1(~n - 2);< 52029#fibo1ENTRY ~n := #in~n; 52178#L8 assume !(~n < 1); 52111#L10 assume 1 == ~n;#res := 1; 52108#fibo1FINAL assume true; 52110#fibo1EXIT >#47#return; 52021#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52019#fibo2FINAL assume true; 52018#fibo2EXIT >#49#return; 52015#L13-1 call #t~ret1 := fibo2(~n - 2);< 52017#fibo2ENTRY ~n := #in~n; 52323#L18 assume !(~n < 1); 52063#L20 assume !(1 == ~n); 52319#L23 call #t~ret2 := fibo1(~n - 1);< 52320#fibo1ENTRY ~n := #in~n; 52494#L8 assume !(~n < 1); 52445#L10 assume 1 == ~n;#res := 1; 52443#fibo1FINAL assume true; 52318#fibo1EXIT >#45#return; 52292#L23-1 call #t~ret3 := fibo1(~n - 2);< 52425#fibo1ENTRY ~n := #in~n; 52422#L8 assume ~n < 1;#res := 0; 52423#fibo1FINAL assume true; 52290#fibo1EXIT >#47#return; 52293#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 52393#fibo2FINAL assume true; 52013#fibo2EXIT >#51#return; 51558#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52614#fibo1FINAL assume true; 51541#fibo1EXIT >#45#return; 51527#L23-1 call #t~ret3 := fibo1(~n - 2);< 51537#fibo1ENTRY ~n := #in~n; 51607#L8 assume !(~n < 1); 51605#L10 assume !(1 == ~n); 51590#L13 call #t~ret0 := fibo2(~n - 1);< 51599#fibo2ENTRY ~n := #in~n; 51604#L18 assume !(~n < 1); 51601#L20 assume !(1 == ~n); 51594#L23 call #t~ret2 := fibo1(~n - 1);< 51595#fibo1ENTRY ~n := #in~n; 51606#L8 assume !(~n < 1); 51603#L10 assume 1 == ~n;#res := 1; 51600#fibo1FINAL assume true; 51592#fibo1EXIT >#45#return; 51576#L23-1 call #t~ret3 := fibo1(~n - 2);< 51579#fibo1ENTRY ~n := #in~n; 51591#L8 assume ~n < 1;#res := 0; 51589#fibo1FINAL assume true; 51575#fibo1EXIT >#47#return; 51578#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51602#fibo2FINAL assume true; 51598#fibo2EXIT >#49#return; 51563#L13-1 call #t~ret1 := fibo2(~n - 2);< 51565#fibo2ENTRY ~n := #in~n; 51570#L18 assume !(~n < 1); 51568#L20 assume 1 == ~n;#res := 1; 51566#fibo2FINAL assume true; 51562#fibo2EXIT >#51#return; 51560#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51539#fibo1FINAL assume true; 51534#fibo1EXIT >#47#return; 51531#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51526#fibo2FINAL assume true; 51516#fibo2EXIT >#49#return; 51225#L13-1 call #t~ret1 := fibo2(~n - 2);< 51528#fibo2ENTRY ~n := #in~n; 51223#L18 assume !(~n < 1); 51226#L20 assume !(1 == ~n); 51155#L23 call #t~ret2 := fibo1(~n - 1);< 51540#fibo1ENTRY ~n := #in~n; 51181#L8 assume !(~n < 1); 51182#L10 assume !(1 == ~n); 51157#L13 call #t~ret0 := fibo2(~n - 1);< 51160#fibo2ENTRY ~n := #in~n; 51180#L18 assume !(~n < 1); 51175#L20 assume !(1 == ~n); 51172#L23 call #t~ret2 := fibo1(~n - 1);< 51174#fibo1ENTRY ~n := #in~n; 51200#L8 assume !(~n < 1); 51199#L10 assume !(1 == ~n); 51196#L13 call #t~ret0 := fibo2(~n - 1);< 51198#fibo2ENTRY ~n := #in~n; 51381#L18 assume !(~n < 1); 51379#L20 assume !(1 == ~n); 51206#L23 call #t~ret2 := fibo1(~n - 1);< 51217#fibo1ENTRY ~n := #in~n; 51216#L8 assume !(~n < 1); 51215#L10 assume !(1 == ~n); 51197#L13 call #t~ret0 := fibo2(~n - 1);< 51198#fibo2ENTRY ~n := #in~n; 51381#L18 assume !(~n < 1); 51379#L20 assume 1 == ~n;#res := 1; 51380#fibo2FINAL assume true; 51419#fibo2EXIT >#49#return; 51414#L13-1 call #t~ret1 := fibo2(~n - 2);< 51416#fibo2ENTRY ~n := #in~n; 51421#L18 assume ~n < 1;#res := 0; 51420#fibo2FINAL assume true; 51412#fibo2EXIT >#51#return; 51415#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52883#fibo1FINAL assume true; 52880#fibo1EXIT >#45#return; 52860#L23-1 call #t~ret3 := fibo1(~n - 2);< 52873#fibo1ENTRY ~n := #in~n; 52869#L8 assume !(~n < 1); 52866#L10 assume 1 == ~n;#res := 1; 52858#fibo1FINAL assume true; 52862#fibo1EXIT >#47#return; 51222#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51213#fibo2FINAL assume true; 51214#fibo2EXIT >#49#return; 51113#L13-1 call #t~ret1 := fibo2(~n - 2);< 51112#fibo2ENTRY ~n := #in~n; 51115#L18 assume !(~n < 1); 51126#L20 assume !(1 == ~n); 51448#L23 call #t~ret2 := fibo1(~n - 1);< 51450#fibo1ENTRY ~n := #in~n; 51500#L8 assume !(~n < 1); 51458#L10 assume 1 == ~n;#res := 1; 51459#fibo1FINAL assume true; 51447#fibo1EXIT >#45#return; 51318#L23-1 call #t~ret3 := fibo1(~n - 2);< 53171#fibo1ENTRY ~n := #in~n; 53168#L8 assume ~n < 1;#res := 0; 53169#fibo1FINAL assume true; 51317#fibo1EXIT >#47#return; 51221#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51205#fibo2FINAL assume true; 51187#fibo2EXIT >#51#return; 51183#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51177#fibo1FINAL assume true; 51170#fibo1EXIT >#45#return; 51165#L23-1 call #t~ret3 := fibo1(~n - 2);< 51169#fibo1ENTRY ~n := #in~n; 51270#L8 assume !(~n < 1); 51269#L10 assume !(1 == ~n); 51265#L13 call #t~ret0 := fibo2(~n - 1);< 51266#fibo2ENTRY ~n := #in~n; 51287#L18 assume !(~n < 1); 51286#L20 assume !(1 == ~n); 51283#L23 call #t~ret2 := fibo1(~n - 1);< 51285#fibo1ENTRY ~n := #in~n; 51292#L8 assume !(~n < 1); 51291#L10 assume 1 == ~n;#res := 1; 51288#fibo1FINAL assume true; 51282#fibo1EXIT >#45#return; 51279#L23-1 call #t~ret3 := fibo1(~n - 2);< 51281#fibo1ENTRY ~n := #in~n; 51294#L8 assume ~n < 1;#res := 0; 51293#fibo1FINAL assume true; 51278#fibo1EXIT >#47#return; 51275#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51272#fibo2FINAL assume true; 51264#fibo2EXIT >#49#return; 51255#L13-1 call #t~ret1 := fibo2(~n - 2);< 51258#fibo2ENTRY ~n := #in~n; 51267#L18 assume !(~n < 1); 51263#L20 assume 1 == ~n;#res := 1; 51260#fibo2FINAL assume true; 51254#fibo2EXIT >#51#return; 51257#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51259#fibo1FINAL assume true; 51163#fibo1EXIT >#47#return; 51162#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51161#fibo2FINAL assume true; 51156#fibo2EXIT >#49#return; 51061#L13-1 call #t~ret1 := fibo2(~n - 2);< 51153#fibo2ENTRY ~n := #in~n; 51151#L18 assume !(~n < 1); 51152#L20 assume !(1 == ~n); 51154#L23 call #t~ret2 := fibo1(~n - 1);< 51540#fibo1ENTRY ~n := #in~n; 51181#L8 assume !(~n < 1); 51182#L10 assume !(1 == ~n); 51626#L13 call #t~ret0 := fibo2(~n - 1);< 51692#fibo2ENTRY ~n := #in~n; 51711#L18 assume !(~n < 1); 51708#L20 assume !(1 == ~n); 51703#L23 call #t~ret2 := fibo1(~n - 1);< 51704#fibo1ENTRY ~n := #in~n; 51712#L8 assume !(~n < 1); 51710#L10 assume 1 == ~n;#res := 1; 51707#fibo1FINAL assume true; 51702#fibo1EXIT >#45#return; 51698#L23-1 call #t~ret3 := fibo1(~n - 2);< 51699#fibo1ENTRY ~n := #in~n; 51706#L8 assume ~n < 1;#res := 0; 51701#fibo1FINAL assume true; 51697#fibo1EXIT >#47#return; 51696#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51694#fibo2FINAL assume true; 51691#fibo2EXIT >#49#return; 51638#L13-1 call #t~ret1 := fibo2(~n - 2);< 51639#fibo2ENTRY ~n := #in~n; 51655#L18 assume !(~n < 1); 51650#L20 assume 1 == ~n;#res := 1; 51645#fibo2FINAL assume true; 51637#fibo2EXIT >#51#return; 51635#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51633#fibo1FINAL assume true; 51631#fibo1EXIT >#45#return; 51090#L23-1 call #t~ret3 := fibo1(~n - 2);< 51623#fibo1ENTRY ~n := #in~n; 51884#L8 assume !(~n < 1); 51882#L10 assume !(1 == ~n); 51067#L13 call #t~ret0 := fibo2(~n - 1);< 51091#fibo2ENTRY ~n := #in~n; 51111#L18 assume !(~n < 1); 51124#L20 assume 1 == ~n;#res := 1; 51066#fibo2FINAL assume true; 51068#fibo2EXIT >#49#return; 51117#L13-1 call #t~ret1 := fibo2(~n - 2);< 51717#fibo2ENTRY ~n := #in~n; 51718#L18 assume ~n < 1;#res := 0; 51571#fibo2FINAL assume true; 51716#fibo2EXIT >#51#return; 51715#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 51714#fibo1FINAL assume true; 51622#fibo1EXIT >#47#return; 51621#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 51620#fibo2FINAL assume true; 51617#fibo2EXIT >#51#return; 51521#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 52615#fibo1FINAL assume true; 51535#fibo1EXIT >#45#return; 51100#L23-1 call #t~ret3 := fibo1(~n - 2);< 51536#fibo1ENTRY [2019-11-20 04:06:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:41,799 INFO L82 PathProgramCache]: Analyzing trace with hash 535019962, now seen corresponding path program 2 times [2019-11-20 04:06:41,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:41,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892212353] [2019-11-20 04:06:41,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2851 backedges. 724 proven. 685 refuted. 0 times theorem prover too weak. 1442 trivial. 0 not checked. [2019-11-20 04:06:42,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892212353] [2019-11-20 04:06:42,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108087427] [2019-11-20 04:06:42,876 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:43,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:43,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:43,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 04:06:43,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2851 backedges. 1271 proven. 160 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2019-11-20 04:06:43,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:43,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12] total 31 [2019-11-20 04:06:43,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320031576] [2019-11-20 04:06:43,151 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:43,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1921463404, now seen corresponding path program 1 times [2019-11-20 04:06:43,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:43,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593617263] [2019-11-20 04:06:43,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 249 proven. 621 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2019-11-20 04:06:44,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593617263] [2019-11-20 04:06:44,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691590510] [2019-11-20 04:06:44,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:44,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 04:06:44,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 189 proven. 573 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2019-11-20 04:06:44,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:44,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 32 [2019-11-20 04:06:44,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660047552] [2019-11-20 04:06:44,339 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 04:06:44,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:44,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 04:06:44,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2019-11-20 04:06:44,340 INFO L87 Difference]: Start difference. First operand 2337 states and 2749 transitions. cyclomatic complexity: 422 Second operand 32 states. [2019-11-20 04:06:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:45,619 INFO L93 Difference]: Finished difference Result 3804 states and 4737 transitions. [2019-11-20 04:06:45,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-20 04:06:45,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3804 states and 4737 transitions. [2019-11-20 04:06:45,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2019-11-20 04:06:45,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3804 states to 3153 states and 3819 transitions. [2019-11-20 04:06:45,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2019-11-20 04:06:45,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2019-11-20 04:06:45,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3153 states and 3819 transitions. [2019-11-20 04:06:45,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:45,685 INFO L688 BuchiCegarLoop]: Abstraction has 3153 states and 3819 transitions. [2019-11-20 04:06:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states and 3819 transitions. [2019-11-20 04:06:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 2767. [2019-11-20 04:06:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2767 states. [2019-11-20 04:06:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2767 states and 3257 transitions. [2019-11-20 04:06:45,771 INFO L711 BuchiCegarLoop]: Abstraction has 2767 states and 3257 transitions. [2019-11-20 04:06:45,771 INFO L591 BuchiCegarLoop]: Abstraction has 2767 states and 3257 transitions. [2019-11-20 04:06:45,771 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-20 04:06:45,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2767 states and 3257 transitions. [2019-11-20 04:06:45,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-20 04:06:45,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:45,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:45,786 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [32, 31, 30, 29, 25, 25, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 10, 9, 7, 5, 1, 1] [2019-11-20 04:06:45,787 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [24, 23, 22, 21, 19, 18, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 7, 7, 6, 3] [2019-11-20 04:06:45,787 INFO L794 eck$LassoCheckResult]: Stem: 61065#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 61026#L37 call main_#t~ret4 := fibo1(main_~x~0);< 61027#fibo1ENTRY ~n := #in~n; 61215#L8 assume !(~n < 1); 61212#L10 assume !(1 == ~n); 61209#L13 call #t~ret0 := fibo2(~n - 1);< 61210#fibo2ENTRY ~n := #in~n; 61342#L18 assume !(~n < 1); 61341#L20 assume !(1 == ~n); 61298#L23 call #t~ret2 := fibo1(~n - 1);< 61299#fibo1ENTRY ~n := #in~n; 62031#L8 assume !(~n < 1); 62030#L10 assume !(1 == ~n); 62028#L13 call #t~ret0 := fibo2(~n - 1);< 62029#fibo2ENTRY ~n := #in~n; 62097#L18 assume !(~n < 1); 62096#L20 assume !(1 == ~n); 62078#L23 call #t~ret2 := fibo1(~n - 1);< 62090#fibo1ENTRY ~n := #in~n; 62091#L8 assume !(~n < 1); 62077#L10 assume !(1 == ~n); 61002#L13 call #t~ret0 := fibo2(~n - 1);< 61936#fibo2ENTRY ~n := #in~n; 61929#L18 assume !(~n < 1); 61927#L20 assume !(1 == ~n); 61074#L23 call #t~ret2 := fibo1(~n - 1);< 62093#fibo1ENTRY ~n := #in~n; 61073#L8 assume !(~n < 1); 61075#L10 assume !(1 == ~n); 62468#L13 call #t~ret0 := fibo2(~n - 1);< 62469#fibo2ENTRY ~n := #in~n; 62473#L18 assume !(~n < 1); 62472#L20 assume 1 == ~n;#res := 1; 62471#fibo2FINAL assume true; 62467#fibo2EXIT >#49#return; 62464#L13-1 call #t~ret1 := fibo2(~n - 2);< 62465#fibo2ENTRY ~n := #in~n; 62479#L18 assume ~n < 1;#res := 0; 62476#fibo2FINAL assume true; 62463#fibo2EXIT >#51#return; 62462#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62461#fibo1FINAL assume true; 62460#fibo1EXIT >#45#return; 62458#L23-1 call #t~ret3 := fibo1(~n - 2);< 62459#fibo1ENTRY ~n := #in~n; 62480#L8 assume !(~n < 1); 62478#L10 assume 1 == ~n;#res := 1; 62475#fibo1FINAL assume true; 62457#fibo1EXIT >#47#return; 62456#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62455#fibo2FINAL assume true; 62432#fibo2EXIT >#49#return; 62412#L13-1 call #t~ret1 := fibo2(~n - 2);< 62421#fibo2ENTRY ~n := #in~n; 62484#L18 assume !(~n < 1); 62483#L20 assume !(1 == ~n); 62449#L23 call #t~ret2 := fibo1(~n - 1);< 62451#fibo1ENTRY ~n := #in~n; 62486#L8 assume !(~n < 1); 62454#L10 assume 1 == ~n;#res := 1; 62453#fibo1FINAL assume true; 62448#fibo1EXIT >#45#return; 62445#L23-1 call #t~ret3 := fibo1(~n - 2);< 62446#fibo1ENTRY ~n := #in~n; 62477#L8 assume ~n < 1;#res := 0; 62474#fibo1FINAL assume true; 62444#fibo1EXIT >#47#return; 62443#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62427#fibo2FINAL assume true; 62409#fibo2EXIT >#51#return; 62405#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62403#fibo1FINAL assume true; 62399#fibo1EXIT >#45#return; 62083#L23-1 call #t~ret3 := fibo1(~n - 2);< 62084#fibo1ENTRY ~n := #in~n; 63029#L8 assume !(~n < 1); 63025#L10 assume !(1 == ~n); 62425#L13 call #t~ret0 := fibo2(~n - 1);< 62426#fibo2ENTRY ~n := #in~n; 63001#L18 assume !(~n < 1); 62481#L20 assume !(1 == ~n); 62441#L23 call #t~ret2 := fibo1(~n - 1);< 62442#fibo1ENTRY ~n := #in~n; 62482#L8 assume !(~n < 1); 62452#L10 assume 1 == ~n;#res := 1; 62447#fibo1FINAL assume true; 62440#fibo1EXIT >#45#return; 62438#L23-1 call #t~ret3 := fibo1(~n - 2);< 62439#fibo1ENTRY ~n := #in~n; 62470#L8 assume ~n < 1;#res := 0; 62466#fibo1FINAL assume true; 62437#fibo1EXIT >#47#return; 62436#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62435#fibo2FINAL assume true; 62424#fibo2EXIT >#49#return; 62407#L13-1 call #t~ret1 := fibo2(~n - 2);< 62408#fibo2ENTRY ~n := #in~n; 62433#L18 assume !(~n < 1); 62423#L20 assume 1 == ~n;#res := 1; 62422#fibo2FINAL assume true; 62406#fibo2EXIT >#51#return; 62404#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62400#fibo1FINAL assume true; 62393#fibo1EXIT >#47#return; 62376#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62032#fibo2FINAL assume true; 62033#fibo2EXIT >#49#return; 62025#L13-1 call #t~ret1 := fibo2(~n - 2);< 62026#fibo2ENTRY ~n := #in~n; 63372#L18 assume !(~n < 1); 63371#L20 assume !(1 == ~n); 62846#L23 call #t~ret2 := fibo1(~n - 1);< 62847#fibo1ENTRY ~n := #in~n; 63378#L8 assume !(~n < 1); 63377#L10 assume !(1 == ~n); 62358#L13 call #t~ret0 := fibo2(~n - 1);< 62855#fibo2ENTRY ~n := #in~n; 63383#L18 assume !(~n < 1); 63379#L20 assume !(1 == ~n); 62918#L23 call #t~ret2 := fibo1(~n - 1);< 62919#fibo1ENTRY ~n := #in~n; 63362#L8 assume !(~n < 1); 62929#L10 assume 1 == ~n;#res := 1; 62930#fibo1FINAL assume true; 62916#fibo1EXIT >#45#return; 62903#L23-1 call #t~ret3 := fibo1(~n - 2);< 62915#fibo1ENTRY ~n := #in~n; 62920#L8 assume ~n < 1;#res := 0; 62921#fibo1FINAL assume true; 62902#fibo1EXIT >#47#return; 62905#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62862#fibo2FINAL assume true; 62863#fibo2EXIT >#49#return; 62851#L13-1 call #t~ret1 := fibo2(~n - 2);< 62852#fibo2ENTRY ~n := #in~n; 62857#L18 assume !(~n < 1); 62856#L20 assume 1 == ~n;#res := 1; 62853#fibo2FINAL assume true; 62850#fibo2EXIT >#51#return; 62849#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62848#fibo1FINAL assume true; 62844#fibo1EXIT >#45#return; 62827#L23-1 call #t~ret3 := fibo1(~n - 2);< 62828#fibo1ENTRY ~n := #in~n; 62909#L8 assume !(~n < 1); 62861#L10 assume !(1 == ~n); 62837#L13 call #t~ret0 := fibo2(~n - 1);< 62838#fibo2ENTRY ~n := #in~n; 62843#L18 assume !(~n < 1); 62841#L20 assume 1 == ~n;#res := 1; 62840#fibo2FINAL assume true; 62836#fibo2EXIT >#49#return; 62833#L13-1 call #t~ret1 := fibo2(~n - 2);< 62834#fibo2ENTRY ~n := #in~n; 62839#L18 assume ~n < 1;#res := 0; 62835#fibo2FINAL assume true; 62831#fibo2EXIT >#51#return; 62830#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62829#fibo1FINAL assume true; 62826#fibo1EXIT >#47#return; 62825#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62824#fibo2FINAL assume true; 62821#fibo2EXIT >#51#return; 62023#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62021#fibo1FINAL assume true; 61297#fibo1EXIT >#45#return; 61146#L23-1 call #t~ret3 := fibo1(~n - 2);< 61222#fibo1ENTRY ~n := #in~n; 61302#L8 assume !(~n < 1); 61300#L10 assume !(1 == ~n); 61119#L13 call #t~ret0 := fibo2(~n - 1);< 61123#fibo2ENTRY ~n := #in~n; 61159#L18 assume !(~n < 1); 61157#L20 assume !(1 == ~n); 61140#L23 call #t~ret2 := fibo1(~n - 1);< 61141#fibo1ENTRY ~n := #in~n; 61543#L8 assume !(~n < 1); 61540#L10 assume !(1 == ~n); 61536#L13 call #t~ret0 := fibo2(~n - 1);< 61538#fibo2ENTRY ~n := #in~n; 61544#L18 assume !(~n < 1); 61541#L20 assume 1 == ~n;#res := 1; 61539#fibo2FINAL assume true; 61535#fibo2EXIT >#49#return; 61531#L13-1 call #t~ret1 := fibo2(~n - 2);< 61533#fibo2ENTRY ~n := #in~n; 61547#L18 assume ~n < 1;#res := 0; 61546#fibo2FINAL assume true; 61529#fibo2EXIT >#51#return; 61527#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61522#fibo1FINAL assume true; 61506#fibo1EXIT >#45#return; 61391#L23-1 call #t~ret3 := fibo1(~n - 2);< 61392#fibo1ENTRY ~n := #in~n; 61870#L8 assume !(~n < 1); 61505#L10 assume 1 == ~n;#res := 1; 61502#fibo1FINAL assume true; 61390#fibo1EXIT >#47#return; 61330#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61329#fibo2FINAL assume true; 61296#fibo2EXIT >#49#return; 61292#L13-1 call #t~ret1 := fibo2(~n - 2);< 61279#fibo2ENTRY ~n := #in~n; 61452#L18 assume !(~n < 1); 61448#L20 assume !(1 == ~n); 61346#L23 call #t~ret2 := fibo1(~n - 1);< 61348#fibo1ENTRY ~n := #in~n; 61678#L8 assume !(~n < 1); 61396#L10 assume 1 == ~n;#res := 1; 61395#fibo1FINAL assume true; 61345#fibo1EXIT >#45#return; 61334#L23-1 call #t~ret3 := fibo1(~n - 2);< 61336#fibo1ENTRY ~n := #in~n; 61394#L8 assume ~n < 1;#res := 0; 61393#fibo1FINAL assume true; 61333#fibo1EXIT >#47#return; 61332#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61308#fibo2FINAL assume true; 61291#fibo2EXIT >#51#return; 61290#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61289#fibo1FINAL assume true; 61221#fibo1EXIT >#47#return; 61147#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61216#fibo2FINAL assume true; 61208#fibo2EXIT >#49#return; 61143#L13-1 call #t~ret1 := fibo2(~n - 2);< 61206#fibo2ENTRY ~n := #in~n; 61203#L18 assume !(~n < 1); 61202#L20 assume !(1 == ~n); 61096#L23 call #t~ret2 := fibo1(~n - 1);< 61148#fibo1ENTRY ~n := #in~n; 61825#L8 assume !(~n < 1); 61810#L10 assume !(1 == ~n); 61009#L13 call #t~ret0 := fibo2(~n - 1);< 61097#fibo2ENTRY ~n := #in~n; 61114#L18 assume !(~n < 1); 61113#L20 assume !(1 == ~n); 61111#L23 call #t~ret2 := fibo1(~n - 1);< 61112#fibo1ENTRY ~n := #in~n; 61389#L8 assume !(~n < 1); 61385#L10 assume !(1 == ~n); 61379#L13 call #t~ret0 := fibo2(~n - 1);< 61381#fibo2ENTRY ~n := #in~n; 61811#L18 assume !(~n < 1); 61446#L20 assume !(1 == ~n); 61415#L23 call #t~ret2 := fibo1(~n - 1);< 61421#fibo1ENTRY ~n := #in~n; 61419#L8 assume !(~n < 1); 61418#L10 assume !(1 == ~n); 61380#L13 call #t~ret0 := fibo2(~n - 1);< 61381#fibo2ENTRY ~n := #in~n; 61811#L18 assume !(~n < 1); 61446#L20 assume 1 == ~n;#res := 1; 61447#fibo2FINAL assume true; 61378#fibo2EXIT >#49#return; 61373#L13-1 call #t~ret1 := fibo2(~n - 2);< 61376#fibo2ENTRY ~n := #in~n; 61806#L18 assume ~n < 1;#res := 0; 61803#fibo2FINAL assume true; 61372#fibo2EXIT >#51#return; 61375#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61613#fibo1FINAL assume true; 61611#fibo1EXIT >#45#return; 61604#L23-1 call #t~ret3 := fibo1(~n - 2);< 61609#fibo1ENTRY ~n := #in~n; 61615#L8 assume !(~n < 1); 61612#L10 assume 1 == ~n;#res := 1; 61610#fibo1FINAL assume true; 61603#fibo1EXIT >#47#return; 61607#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61708#fibo2FINAL assume true; 61687#fibo2EXIT >#49#return; 61592#L13-1 call #t~ret1 := fibo2(~n - 2);< 61595#fibo2ENTRY ~n := #in~n; 61731#L18 assume !(~n < 1); 61732#L20 assume !(1 == ~n); 61725#L23 call #t~ret2 := fibo1(~n - 1);< 61727#fibo1ENTRY ~n := #in~n; 61737#L8 assume !(~n < 1); 61735#L10 assume 1 == ~n;#res := 1; 61734#fibo1FINAL assume true; 61724#fibo1EXIT >#45#return; 61721#L23-1 call #t~ret3 := fibo1(~n - 2);< 61722#fibo1ENTRY ~n := #in~n; 61738#L8 assume ~n < 1;#res := 0; 61736#fibo1FINAL assume true; 61720#fibo1EXIT >#47#return; 61719#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61685#fibo2FINAL assume true; 61591#fibo2EXIT >#51#return; 61594#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61919#fibo1FINAL assume true; 61917#fibo1EXIT >#45#return; 61104#L23-1 call #t~ret3 := fibo1(~n - 2);< 61909#fibo1ENTRY ~n := #in~n; 61874#L8 assume !(~n < 1); 61818#L10 assume !(1 == ~n); 61428#L13 call #t~ret0 := fibo2(~n - 1);< 61429#fibo2ENTRY ~n := #in~n; 61762#L18 assume !(~n < 1); 61761#L20 assume !(1 == ~n); 61755#L23 call #t~ret2 := fibo1(~n - 1);< 61757#fibo1ENTRY ~n := #in~n; 61764#L8 assume !(~n < 1); 61763#L10 assume 1 == ~n;#res := 1; 61760#fibo1FINAL assume true; 61754#fibo1EXIT >#45#return; 61750#L23-1 call #t~ret3 := fibo1(~n - 2);< 61753#fibo1ENTRY ~n := #in~n; 61766#L8 assume ~n < 1;#res := 0; 61765#fibo1FINAL assume true; 61749#fibo1EXIT >#47#return; 61752#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61774#fibo2FINAL assume true; 61427#fibo2EXIT >#49#return; 61352#L13-1 call #t~ret1 := fibo2(~n - 2);< 61424#fibo2ENTRY ~n := #in~n; 61425#L18 assume !(~n < 1); 61940#L20 assume 1 == ~n;#res := 1; 61938#fibo2FINAL assume true; 61934#fibo2EXIT >#51#return; 61935#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62176#fibo1FINAL assume true; 61100#fibo1EXIT >#47#return; 61028#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61007#fibo2FINAL assume true; 61010#fibo2EXIT >#49#return; 61070#L13-1 call #t~ret1 := fibo2(~n - 2);< 61313#fibo2ENTRY ~n := #in~n; 62018#L18 assume !(~n < 1); 62016#L20 assume !(1 == ~n); 61034#L23 call #t~ret2 := fibo1(~n - 1);< 61455#fibo1ENTRY ~n := #in~n; 61829#L8 assume !(~n < 1); 61084#L10 assume !(1 == ~n); 61016#L13 call #t~ret0 := fibo2(~n - 1);< 61035#fibo2ENTRY ~n := #in~n; 62017#L18 assume !(~n < 1); 62015#L20 assume !(1 == ~n); 61021#L23 call #t~ret2 := fibo1(~n - 1);< 61062#fibo1ENTRY ~n := #in~n; 61063#L8 assume !(~n < 1); 61020#L10 assume 1 == ~n;#res := 1; 61022#fibo1FINAL assume true; 61857#fibo1EXIT >#45#return; 61015#L23-1 call #t~ret3 := fibo1(~n - 2);< 61017#fibo1ENTRY ~n := #in~n; 61864#L8 assume ~n < 1;#res := 0; 61862#fibo1FINAL assume true; 61030#fibo1EXIT >#47#return; 61031#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61863#fibo2FINAL assume true; 61861#fibo2EXIT >#49#return; 61040#L13-1 call #t~ret1 := fibo2(~n - 2);< 61041#fibo2ENTRY ~n := #in~n; 61826#L18 assume !(~n < 1); 61824#L20 assume 1 == ~n;#res := 1; 61822#fibo2FINAL assume true; 61819#fibo2EXIT >#51#return; 61816#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61813#fibo1FINAL assume true; 61453#fibo1EXIT >#45#return; 61327#L23-1 call #t~ret3 := fibo1(~n - 2);< 61328#fibo1ENTRY ~n := #in~n; 61487#L8 assume !(~n < 1); 61486#L10 assume !(1 == ~n); 61387#L13 call #t~ret0 := fibo2(~n - 1);< 61388#fibo2ENTRY ~n := #in~n; 61485#L18 assume !(~n < 1); 61400#L20 assume 1 == ~n;#res := 1; 61398#fibo2FINAL assume true; 61386#fibo2EXIT >#49#return; 61383#L13-1 call #t~ret1 := fibo2(~n - 2);< 61384#fibo2ENTRY ~n := #in~n; 61404#L18 assume ~n < 1;#res := 0; 61214#fibo2FINAL assume true; 61382#fibo2EXIT >#51#return; 61377#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61371#fibo1FINAL assume true; 61326#fibo1EXIT >#47#return; 61324#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61312#fibo2FINAL assume true; 61311#fibo2EXIT >#51#return; 61122#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62163#fibo1FINAL assume true; 61145#fibo1EXIT >#45#return; 61045#L23-1 call #t~ret3 := fibo1(~n - 2);< 61135#fibo1ENTRY [2019-11-20 04:06:45,788 INFO L796 eck$LassoCheckResult]: Loop: 61135#fibo1ENTRY ~n := #in~n; 61128#L8 assume !(~n < 1); 61126#L10 assume !(1 == ~n); 61120#L13 call #t~ret0 := fibo2(~n - 1);< 61123#fibo2ENTRY ~n := #in~n; 61159#L18 assume !(~n < 1); 61157#L20 assume !(1 == ~n); 61140#L23 call #t~ret2 := fibo1(~n - 1);< 61142#fibo1ENTRY ~n := #in~n; 61179#L8 assume !(~n < 1); 61178#L10 assume !(1 == ~n); 61175#L13 call #t~ret0 := fibo2(~n - 1);< 61177#fibo2ENTRY ~n := #in~n; 61284#L18 assume !(~n < 1); 61281#L20 assume !(1 == ~n); 61199#L23 call #t~ret2 := fibo1(~n - 1);< 61201#fibo1ENTRY ~n := #in~n; 61230#L8 assume !(~n < 1); 61228#L10 assume !(1 == ~n); 61205#L13 call #t~ret0 := fibo2(~n - 1);< 61224#fibo2ENTRY ~n := #in~n; 61305#L18 assume !(~n < 1); 61303#L20 assume !(1 == ~n); 61304#L23 call #t~ret2 := fibo1(~n - 1);< 61479#fibo1ENTRY ~n := #in~n; 61483#L8 assume !(~n < 1); 61482#L10 assume 1 == ~n;#res := 1; 61481#fibo1FINAL assume true; 61478#fibo1EXIT >#45#return; 61471#L23-1 call #t~ret3 := fibo1(~n - 2);< 61475#fibo1ENTRY ~n := #in~n; 61480#L8 assume ~n < 1;#res := 0; 61476#fibo1FINAL assume true; 61469#fibo1EXIT >#47#return; 61473#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62269#fibo2FINAL assume true; 62267#fibo2EXIT >#49#return; 62264#L13-1 call #t~ret1 := fibo2(~n - 2);< 62265#fibo2ENTRY ~n := #in~n; 62270#L18 assume !(~n < 1); 62268#L20 assume 1 == ~n;#res := 1; 62266#fibo2FINAL assume true; 62263#fibo2EXIT >#51#return; 62262#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62261#fibo1FINAL assume true; 62260#fibo1EXIT >#45#return; 62214#L23-1 call #t~ret3 := fibo1(~n - 2);< 62217#fibo1ENTRY ~n := #in~n; 62253#L8 assume !(~n < 1); 62252#L10 assume !(1 == ~n); 62250#L13 call #t~ret0 := fibo2(~n - 1);< 62251#fibo2ENTRY ~n := #in~n; 62256#L18 assume !(~n < 1); 62255#L20 assume 1 == ~n;#res := 1; 62254#fibo2FINAL assume true; 62249#fibo2EXIT >#49#return; 62246#L13-1 call #t~ret1 := fibo2(~n - 2);< 62248#fibo2ENTRY ~n := #in~n; 62258#L18 assume ~n < 1;#res := 0; 62257#fibo2FINAL assume true; 62245#fibo2EXIT >#51#return; 62244#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62237#fibo1FINAL assume true; 62211#fibo1EXIT >#47#return; 62209#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 62202#fibo2FINAL assume true; 62189#fibo2EXIT >#49#return; 61163#L13-1 call #t~ret1 := fibo2(~n - 2);< 62185#fibo2ENTRY ~n := #in~n; 62210#L18 assume !(~n < 1); 62208#L20 assume !(1 == ~n); 61240#L23 call #t~ret2 := fibo1(~n - 1);< 61242#fibo1ENTRY ~n := #in~n; 62098#L8 assume !(~n < 1); 61250#L10 assume 1 == ~n;#res := 1; 61248#fibo1FINAL assume true; 61239#fibo1EXIT >#45#return; 61232#L23-1 call #t~ret3 := fibo1(~n - 2);< 61235#fibo1ENTRY ~n := #in~n; 61243#L8 assume ~n < 1;#res := 0; 61236#fibo1FINAL assume true; 61231#fibo1EXIT >#47#return; 61229#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61225#fibo2FINAL assume true; 61161#fibo2EXIT >#51#return; 61168#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62175#fibo1FINAL assume true; 61139#fibo1EXIT >#45#return; 61047#L23-1 call #t~ret3 := fibo1(~n - 2);< 61136#fibo1ENTRY ~n := #in~n; 61673#L8 assume !(~n < 1); 61671#L10 assume !(1 == ~n); 61067#L13 call #t~ret0 := fibo2(~n - 1);< 61066#fibo2ENTRY ~n := #in~n; 61068#L18 assume !(~n < 1); 61079#L20 assume !(1 == ~n); 61080#L23 call #t~ret2 := fibo1(~n - 1);< 61267#fibo1ENTRY ~n := #in~n; 61865#L8 assume !(~n < 1); 61271#L10 assume 1 == ~n;#res := 1; 61270#fibo1FINAL assume true; 61265#fibo1EXIT >#45#return; 61258#L23-1 call #t~ret3 := fibo1(~n - 2);< 61261#fibo1ENTRY ~n := #in~n; 61269#L8 assume ~n < 1;#res := 0; 61263#fibo1FINAL assume true; 61257#fibo1EXIT >#47#return; 61253#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61252#fibo2FINAL assume true; 61155#fibo2EXIT >#49#return; 61150#L13-1 call #t~ret1 := fibo2(~n - 2);< 61153#fibo2ENTRY ~n := #in~n; 61213#L18 assume !(~n < 1); 61211#L20 assume 1 == ~n;#res := 1; 61207#fibo2FINAL assume true; 61149#fibo2EXIT >#51#return; 61144#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61137#fibo1FINAL assume true; 61132#fibo1EXIT >#47#return; 61127#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61125#fibo2FINAL assume true; 61118#fibo2EXIT >#49#return; 61090#L13-1 call #t~ret1 := fibo2(~n - 2);< 61094#fibo2ENTRY ~n := #in~n; 61093#L18 assume !(~n < 1); 61092#L20 assume !(1 == ~n); 61036#L23 call #t~ret2 := fibo1(~n - 1);< 61087#fibo1ENTRY ~n := #in~n; 61086#L8 assume !(~n < 1); 61085#L10 assume !(1 == ~n); 61008#L13 call #t~ret0 := fibo2(~n - 1);< 61097#fibo2ENTRY ~n := #in~n; 61114#L18 assume !(~n < 1); 61113#L20 assume !(1 == ~n); 61111#L23 call #t~ret2 := fibo1(~n - 1);< 61112#fibo1ENTRY ~n := #in~n; 61389#L8 assume !(~n < 1); 61385#L10 assume !(1 == ~n); 61379#L13 call #t~ret0 := fibo2(~n - 1);< 61381#fibo2ENTRY ~n := #in~n; 61811#L18 assume !(~n < 1); 61446#L20 assume !(1 == ~n); 61415#L23 call #t~ret2 := fibo1(~n - 1);< 61421#fibo1ENTRY ~n := #in~n; 61419#L8 assume !(~n < 1); 61418#L10 assume !(1 == ~n); 61380#L13 call #t~ret0 := fibo2(~n - 1);< 61381#fibo2ENTRY ~n := #in~n; 61811#L18 assume !(~n < 1); 61446#L20 assume 1 == ~n;#res := 1; 61447#fibo2FINAL assume true; 61378#fibo2EXIT >#49#return; 61373#L13-1 call #t~ret1 := fibo2(~n - 2);< 61376#fibo2ENTRY ~n := #in~n; 61806#L18 assume ~n < 1;#res := 0; 61803#fibo2FINAL assume true; 61372#fibo2EXIT >#51#return; 61375#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61613#fibo1FINAL assume true; 61611#fibo1EXIT >#45#return; 61604#L23-1 call #t~ret3 := fibo1(~n - 2);< 61609#fibo1ENTRY ~n := #in~n; 61615#L8 assume !(~n < 1); 61612#L10 assume 1 == ~n;#res := 1; 61610#fibo1FINAL assume true; 61603#fibo1EXIT >#47#return; 61607#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61708#fibo2FINAL assume true; 61687#fibo2EXIT >#49#return; 61592#L13-1 call #t~ret1 := fibo2(~n - 2);< 61595#fibo2ENTRY ~n := #in~n; 61731#L18 assume !(~n < 1); 61732#L20 assume !(1 == ~n); 61725#L23 call #t~ret2 := fibo1(~n - 1);< 61727#fibo1ENTRY ~n := #in~n; 61737#L8 assume !(~n < 1); 61735#L10 assume 1 == ~n;#res := 1; 61734#fibo1FINAL assume true; 61724#fibo1EXIT >#45#return; 61721#L23-1 call #t~ret3 := fibo1(~n - 2);< 61722#fibo1ENTRY ~n := #in~n; 61738#L8 assume ~n < 1;#res := 0; 61736#fibo1FINAL assume true; 61720#fibo1EXIT >#47#return; 61719#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61685#fibo2FINAL assume true; 61591#fibo2EXIT >#51#return; 61594#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61919#fibo1FINAL assume true; 61917#fibo1EXIT >#45#return; 61104#L23-1 call #t~ret3 := fibo1(~n - 2);< 61909#fibo1ENTRY ~n := #in~n; 61874#L8 assume !(~n < 1); 61818#L10 assume !(1 == ~n); 61428#L13 call #t~ret0 := fibo2(~n - 1);< 61429#fibo2ENTRY ~n := #in~n; 61762#L18 assume !(~n < 1); 61761#L20 assume !(1 == ~n); 61755#L23 call #t~ret2 := fibo1(~n - 1);< 61757#fibo1ENTRY ~n := #in~n; 61764#L8 assume !(~n < 1); 61763#L10 assume 1 == ~n;#res := 1; 61760#fibo1FINAL assume true; 61754#fibo1EXIT >#45#return; 61750#L23-1 call #t~ret3 := fibo1(~n - 2);< 61753#fibo1ENTRY ~n := #in~n; 61766#L8 assume ~n < 1;#res := 0; 61765#fibo1FINAL assume true; 61749#fibo1EXIT >#47#return; 61752#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61774#fibo2FINAL assume true; 61427#fibo2EXIT >#49#return; 61352#L13-1 call #t~ret1 := fibo2(~n - 2);< 61424#fibo2ENTRY ~n := #in~n; 61425#L18 assume !(~n < 1); 61940#L20 assume 1 == ~n;#res := 1; 61938#fibo2FINAL assume true; 61934#fibo2EXIT >#51#return; 61935#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 62176#fibo1FINAL assume true; 61100#fibo1EXIT >#47#return; 61028#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61007#fibo2FINAL assume true; 61010#fibo2EXIT >#49#return; 61071#L13-1 call #t~ret1 := fibo2(~n - 2);< 61313#fibo2ENTRY ~n := #in~n; 62018#L18 assume !(~n < 1); 62016#L20 assume !(1 == ~n); 61034#L23 call #t~ret2 := fibo1(~n - 1);< 61455#fibo1ENTRY ~n := #in~n; 61829#L8 assume !(~n < 1); 61084#L10 assume !(1 == ~n); 61016#L13 call #t~ret0 := fibo2(~n - 1);< 61035#fibo2ENTRY ~n := #in~n; 62017#L18 assume !(~n < 1); 62015#L20 assume !(1 == ~n); 61021#L23 call #t~ret2 := fibo1(~n - 1);< 61062#fibo1ENTRY ~n := #in~n; 61063#L8 assume !(~n < 1); 61020#L10 assume 1 == ~n;#res := 1; 61022#fibo1FINAL assume true; 61857#fibo1EXIT >#45#return; 61015#L23-1 call #t~ret3 := fibo1(~n - 2);< 61017#fibo1ENTRY ~n := #in~n; 61864#L8 assume ~n < 1;#res := 0; 61862#fibo1FINAL assume true; 61030#fibo1EXIT >#47#return; 61031#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61863#fibo2FINAL assume true; 61861#fibo2EXIT >#49#return; 61040#L13-1 call #t~ret1 := fibo2(~n - 2);< 61041#fibo2ENTRY ~n := #in~n; 61826#L18 assume !(~n < 1); 61824#L20 assume 1 == ~n;#res := 1; 61822#fibo2FINAL assume true; 61819#fibo2EXIT >#51#return; 61816#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61813#fibo1FINAL assume true; 61453#fibo1EXIT >#45#return; 61327#L23-1 call #t~ret3 := fibo1(~n - 2);< 61328#fibo1ENTRY ~n := #in~n; 61487#L8 assume !(~n < 1); 61486#L10 assume !(1 == ~n); 61387#L13 call #t~ret0 := fibo2(~n - 1);< 61388#fibo2ENTRY ~n := #in~n; 61485#L18 assume !(~n < 1); 61400#L20 assume 1 == ~n;#res := 1; 61398#fibo2FINAL assume true; 61386#fibo2EXIT >#49#return; 61383#L13-1 call #t~ret1 := fibo2(~n - 2);< 61384#fibo2ENTRY ~n := #in~n; 61404#L18 assume ~n < 1;#res := 0; 61214#fibo2FINAL assume true; 61382#fibo2EXIT >#51#return; 61377#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61371#fibo1FINAL assume true; 61326#fibo1EXIT >#47#return; 61324#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 61312#fibo2FINAL assume true; 61311#fibo2EXIT >#51#return; 61055#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 61044#fibo1FINAL assume true; 61048#fibo1EXIT >#45#return; 61046#L23-1 call #t~ret3 := fibo1(~n - 2);< 61135#fibo1ENTRY [2019-11-20 04:06:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash -100717608, now seen corresponding path program 3 times [2019-11-20 04:06:45,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:45,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951921692] [2019-11-20 04:06:45,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4850 backedges. 762 proven. 1188 refuted. 0 times theorem prover too weak. 2900 trivial. 0 not checked. [2019-11-20 04:06:47,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951921692] [2019-11-20 04:06:47,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571575047] [2019-11-20 04:06:47,050 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:47,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-11-20 04:06:47,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:47,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 04:06:47,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4850 backedges. 590 proven. 181 refuted. 0 times theorem prover too weak. 4079 trivial. 0 not checked. [2019-11-20 04:06:47,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:47,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 35 [2019-11-20 04:06:47,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511239501] [2019-11-20 04:06:47,438 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:47,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:47,439 INFO L82 PathProgramCache]: Analyzing trace with hash -162680412, now seen corresponding path program 2 times [2019-11-20 04:06:47,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:47,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501228855] [2019-11-20 04:06:47,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 381 proven. 692 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2019-11-20 04:06:48,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501228855] [2019-11-20 04:06:48,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74816414] [2019-11-20 04:06:48,295 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:48,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:48,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:48,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 04:06:48,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 1208 proven. 52 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2019-11-20 04:06:48,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:48,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 34 [2019-11-20 04:06:48,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471455341] [2019-11-20 04:06:48,639 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 04:06:48,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:48,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-20 04:06:48,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 04:06:48,640 INFO L87 Difference]: Start difference. First operand 2767 states and 3257 transitions. cyclomatic complexity: 500 Second operand 34 states. [2019-11-20 04:06:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:49,872 INFO L93 Difference]: Finished difference Result 2905 states and 3408 transitions. [2019-11-20 04:06:49,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-20 04:06:49,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2905 states and 3408 transitions. [2019-11-20 04:06:49,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-20 04:06:49,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2905 states to 2857 states and 3360 transitions. [2019-11-20 04:06:50,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2019-11-20 04:06:50,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2019-11-20 04:06:50,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2857 states and 3360 transitions. [2019-11-20 04:06:50,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:50,001 INFO L688 BuchiCegarLoop]: Abstraction has 2857 states and 3360 transitions. [2019-11-20 04:06:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states and 3360 transitions. [2019-11-20 04:06:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2698. [2019-11-20 04:06:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-11-20 04:06:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3097 transitions. [2019-11-20 04:06:50,073 INFO L711 BuchiCegarLoop]: Abstraction has 2698 states and 3097 transitions. [2019-11-20 04:06:50,073 INFO L591 BuchiCegarLoop]: Abstraction has 2698 states and 3097 transitions. [2019-11-20 04:06:50,073 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-20 04:06:50,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2698 states and 3097 transitions. [2019-11-20 04:06:50,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-20 04:06:50,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 04:06:50,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 04:06:50,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [23, 22, 20, 20, 19, 18, 13, 12, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 6, 4, 4, 1, 1] [2019-11-20 04:06:50,085 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1] [2019-11-20 04:06:50,086 INFO L794 eck$LassoCheckResult]: Stem: 71398#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 8; 71373#L37 call main_#t~ret4 := fibo1(main_~x~0);< 71374#fibo1ENTRY ~n := #in~n; 71754#L8 assume !(~n < 1); 71753#L10 assume !(1 == ~n); 71510#L13 call #t~ret0 := fibo2(~n - 1);< 71511#fibo2ENTRY ~n := #in~n; 71637#L18 assume !(~n < 1); 71635#L20 assume !(1 == ~n); 71632#L23 call #t~ret2 := fibo1(~n - 1);< 71633#fibo1ENTRY ~n := #in~n; 72059#L8 assume !(~n < 1); 72058#L10 assume !(1 == ~n); 72055#L13 call #t~ret0 := fibo2(~n - 1);< 72057#fibo2ENTRY ~n := #in~n; 72056#L18 assume !(~n < 1); 72054#L20 assume !(1 == ~n); 72049#L23 call #t~ret2 := fibo1(~n - 1);< 72048#fibo1ENTRY ~n := #in~n; 72050#L8 assume !(~n < 1); 73359#L10 assume !(1 == ~n); 71348#L13 call #t~ret0 := fibo2(~n - 1);< 71915#fibo2ENTRY ~n := #in~n; 71914#L18 assume !(~n < 1); 71911#L20 assume !(1 == ~n); 71912#L23 call #t~ret2 := fibo1(~n - 1);< 72052#fibo1ENTRY ~n := #in~n; 72731#L8 assume !(~n < 1); 73419#L10 assume !(1 == ~n); 73416#L13 call #t~ret0 := fibo2(~n - 1);< 73417#fibo2ENTRY ~n := #in~n; 73423#L18 assume !(~n < 1); 73421#L20 assume 1 == ~n;#res := 1; 73420#fibo2FINAL assume true; 73415#fibo2EXIT >#49#return; 73412#L13-1 call #t~ret1 := fibo2(~n - 2);< 73413#fibo2ENTRY ~n := #in~n; 73424#L18 assume ~n < 1;#res := 0; 73422#fibo2FINAL assume true; 73411#fibo2EXIT >#51#return; 73409#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73408#fibo1FINAL assume true; 73407#fibo1EXIT >#45#return; 73405#L23-1 call #t~ret3 := fibo1(~n - 2);< 73406#fibo1ENTRY ~n := #in~n; 73418#L8 assume !(~n < 1); 73414#L10 assume 1 == ~n;#res := 1; 73410#fibo1FINAL assume true; 73404#fibo1EXIT >#47#return; 73402#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73401#fibo2FINAL assume true; 73399#fibo2EXIT >#49#return; 73392#L13-1 call #t~ret1 := fibo2(~n - 2);< 73396#fibo2ENTRY ~n := #in~n; 73454#L18 assume !(~n < 1); 73453#L20 assume !(1 == ~n); 73451#L23 call #t~ret2 := fibo1(~n - 1);< 73452#fibo1ENTRY ~n := #in~n; 73457#L8 assume !(~n < 1); 73456#L10 assume 1 == ~n;#res := 1; 73455#fibo1FINAL assume true; 73450#fibo1EXIT >#45#return; 73448#L23-1 call #t~ret3 := fibo1(~n - 2);< 73449#fibo1ENTRY ~n := #in~n; 73459#L8 assume ~n < 1;#res := 0; 73458#fibo1FINAL assume true; 73447#fibo1EXIT >#47#return; 73445#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73427#fibo2FINAL assume true; 73390#fibo2EXIT >#51#return; 73394#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73690#fibo1FINAL assume true; 73689#fibo1EXIT >#45#return; 73370#L23-1 call #t~ret3 := fibo1(~n - 2);< 73374#fibo1ENTRY ~n := #in~n; 73609#L8 assume !(~n < 1); 73388#L10 assume !(1 == ~n); 73607#L13 call #t~ret0 := fibo2(~n - 1);< 73608#fibo2ENTRY ~n := #in~n; 73621#L18 assume !(~n < 1); 73620#L20 assume !(1 == ~n); 73618#L23 call #t~ret2 := fibo1(~n - 1);< 73619#fibo1ENTRY ~n := #in~n; 73624#L8 assume !(~n < 1); 73623#L10 assume 1 == ~n;#res := 1; 73622#fibo1FINAL assume true; 73617#fibo1EXIT >#45#return; 73615#L23-1 call #t~ret3 := fibo1(~n - 2);< 73616#fibo1ENTRY ~n := #in~n; 73626#L8 assume ~n < 1;#res := 0; 73625#fibo1FINAL assume true; 73614#fibo1EXIT >#47#return; 73613#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73612#fibo2FINAL assume true; 73606#fibo2EXIT >#49#return; 73604#L13-1 call #t~ret1 := fibo2(~n - 2);< 73605#fibo2ENTRY ~n := #in~n; 73630#L18 assume !(~n < 1); 73629#L20 assume 1 == ~n;#res := 1; 73627#fibo2FINAL assume true; 73603#fibo2EXIT >#51#return; 73601#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73460#fibo1FINAL assume true; 73368#fibo1EXIT >#47#return; 73373#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73693#fibo2FINAL assume true; 73692#fibo2EXIT >#49#return; 71647#L13-1 call #t~ret1 := fibo2(~n - 2);< 71648#fibo2ENTRY ~n := #in~n; 73518#L18 assume !(~n < 1); 73517#L20 assume !(1 == ~n); 73511#L23 call #t~ret2 := fibo1(~n - 1);< 73515#fibo1ENTRY ~n := #in~n; 73514#L8 assume !(~n < 1); 73512#L10 assume !(1 == ~n); 72009#L13 call #t~ret0 := fibo2(~n - 1);< 73510#fibo2ENTRY ~n := #in~n; 73508#L18 assume !(~n < 1); 73506#L20 assume !(1 == ~n); 73498#L23 call #t~ret2 := fibo1(~n - 1);< 73500#fibo1ENTRY ~n := #in~n; 73509#L8 assume !(~n < 1); 73507#L10 assume 1 == ~n;#res := 1; 73505#fibo1FINAL assume true; 73497#fibo1EXIT >#45#return; 73492#L23-1 call #t~ret3 := fibo1(~n - 2);< 73495#fibo1ENTRY ~n := #in~n; 73516#L8 assume ~n < 1;#res := 0; 73513#fibo1FINAL assume true; 73491#fibo1EXIT >#47#return; 73494#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 73743#fibo2FINAL assume true; 73740#fibo2EXIT >#49#return; 73729#L13-1 call #t~ret1 := fibo2(~n - 2);< 73730#fibo2ENTRY ~n := #in~n; 73741#L18 assume !(~n < 1); 73738#L20 assume 1 == ~n;#res := 1; 73736#fibo2FINAL assume true; 73728#fibo2EXIT >#51#return; 73724#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73720#fibo1FINAL assume true; 73718#fibo1EXIT >#45#return; 73714#L23-1 call #t~ret3 := fibo1(~n - 2);< 73715#fibo1ENTRY ~n := #in~n; 73737#L8 assume !(~n < 1); 73735#L10 assume !(1 == ~n); 73726#L13 call #t~ret0 := fibo2(~n - 1);< 73727#fibo2ENTRY ~n := #in~n; 73734#L18 assume !(~n < 1); 73733#L20 assume 1 == ~n;#res := 1; 73732#fibo2FINAL assume true; 73725#fibo2EXIT >#49#return; 73722#L13-1 call #t~ret1 := fibo2(~n - 2);< 73723#fibo2ENTRY ~n := #in~n; 73731#L18 assume ~n < 1;#res := 0; 72369#fibo2FINAL assume true; 73721#fibo2EXIT >#51#return; 73719#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 73717#fibo1FINAL assume true; 73713#fibo1EXIT >#47#return; 73711#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 71756#fibo2FINAL assume true; 71761#fibo2EXIT >#51#return; 71636#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 71634#fibo1FINAL assume true; 71631#fibo1EXIT >#45#return; 71386#L23-1 call #t~ret3 := fibo1(~n - 2);< 71629#fibo1ENTRY ~n := #in~n; 71659#L8 assume !(~n < 1); 71658#L10 assume !(1 == ~n); 71430#L13 call #t~ret0 := fibo2(~n - 1);< 71435#fibo2ENTRY ~n := #in~n; 71462#L18 assume !(~n < 1); 71459#L20 assume !(1 == ~n); 71455#L23 call #t~ret2 := fibo1(~n - 1);< 71456#fibo1ENTRY ~n := #in~n; 71527#L8 assume !(~n < 1); 71526#L10 assume !(1 == ~n); 71523#L13 call #t~ret0 := fibo2(~n - 1);< 71525#fibo2ENTRY ~n := #in~n; 71552#L18 assume !(~n < 1); 71548#L20 assume !(1 == ~n); 71543#L23 call #t~ret2 := fibo1(~n - 1);< 71547#fibo1ENTRY ~n := #in~n; 71583#L8 assume !(~n < 1); 71580#L10 assume !(1 == ~n); 71576#L13 call #t~ret0 := fibo2(~n - 1);< 71577#fibo2ENTRY ~n := #in~n; 71584#L18 assume !(~n < 1); 71581#L20 assume !(1 == ~n); 71582#L23 call #t~ret2 := fibo1(~n - 1);< 71833#fibo1ENTRY ~n := #in~n; 71841#L8 assume !(~n < 1); 71837#L10 assume 1 == ~n;#res := 1; 71836#fibo1FINAL assume true; 71832#fibo1EXIT >#45#return; 71827#L23-1 call #t~ret3 := fibo1(~n - 2);< 71831#fibo1ENTRY ~n := #in~n; 71843#L8 assume ~n < 1;#res := 0; 71839#fibo1FINAL assume true; 71825#fibo1EXIT >#47#return; 71829#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72199#fibo2FINAL assume true; 72197#fibo2EXIT >#49#return; 72194#L13-1 call #t~ret1 := fibo2(~n - 2);< 72195#fibo2ENTRY ~n := #in~n; 72200#L18 assume !(~n < 1); 72198#L20 assume 1 == ~n;#res := 1; 72196#fibo2FINAL assume true; 72193#fibo2EXIT >#51#return; 72192#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72191#fibo1FINAL assume true; 72175#fibo1EXIT >#45#return; 72138#L23-1 call #t~ret3 := fibo1(~n - 2);< 72143#fibo1ENTRY ~n := #in~n; 72190#L8 assume !(~n < 1); 72188#L10 assume !(1 == ~n); 72172#L13 call #t~ret0 := fibo2(~n - 1);< 72173#fibo2ENTRY ~n := #in~n; 72181#L18 assume !(~n < 1); 72180#L20 assume 1 == ~n;#res := 1; 72179#fibo2FINAL assume true; 72171#fibo2EXIT >#49#return; 72167#L13-1 call #t~ret1 := fibo2(~n - 2);< 72169#fibo2ENTRY ~n := #in~n; 72186#L18 assume ~n < 1;#res := 0; 72184#fibo2FINAL assume true; 72166#fibo2EXIT >#51#return; 72165#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72164#fibo1FINAL assume true; 72137#fibo1EXIT >#47#return; 72132#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72126#fibo2FINAL assume true; 72123#fibo2EXIT >#49#return; 72118#L13-1 call #t~ret1 := fibo2(~n - 2);< 72121#fibo2ENTRY ~n := #in~n; 72159#L18 assume !(~n < 1); 72157#L20 assume !(1 == ~n); 72135#L23 call #t~ret2 := fibo1(~n - 1);< 72136#fibo1ENTRY ~n := #in~n; 72189#L8 assume !(~n < 1); 72174#L10 assume !(1 == ~n); 72161#L13 call #t~ret0 := fibo2(~n - 1);< 72163#fibo2ENTRY ~n := #in~n; 72183#L18 assume !(~n < 1); 72182#L20 assume 1 == ~n;#res := 1; 72170#fibo2FINAL assume true; 72160#fibo2EXIT >#49#return; 72153#L13-1 call #t~ret1 := fibo2(~n - 2);< 72156#fibo2ENTRY ~n := #in~n; 72178#L18 assume ~n < 1;#res := 0; 72158#fibo2FINAL assume true; 72152#fibo2EXIT >#51#return; 72150#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72148#fibo1FINAL assume true; 72134#fibo1EXIT >#45#return; 72128#L23-1 call #t~ret3 := fibo1(~n - 2);< 72131#fibo1ENTRY ~n := #in~n; 72176#L8 assume !(~n < 1); 72144#L10 assume 1 == ~n;#res := 1; 72133#fibo1FINAL assume true; 72127#fibo1EXIT >#47#return; 72124#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72122#fibo2FINAL assume true; 72117#fibo2EXIT >#51#return; 71645#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72485#fibo1FINAL assume true; 71454#fibo1EXIT >#45#return; 71434#L23-1 call #t~ret3 := fibo1(~n - 2);< 71450#fibo1ENTRY ~n := #in~n; 71501#L8 assume !(~n < 1); 71502#L10 assume !(1 == ~n); 71432#L13 [2019-11-20 04:06:50,086 INFO L796 eck$LassoCheckResult]: Loop: 71432#L13 call #t~ret0 := fibo2(~n - 1);< 71435#fibo2ENTRY ~n := #in~n; 71462#L18 assume !(~n < 1); 71459#L20 assume !(1 == ~n); 71455#L23 call #t~ret2 := fibo1(~n - 1);< 71456#fibo1ENTRY ~n := #in~n; 71527#L8 assume !(~n < 1); 71526#L10 assume !(1 == ~n); 71523#L13 call #t~ret0 := fibo2(~n - 1);< 71525#fibo2ENTRY ~n := #in~n; 71552#L18 assume !(~n < 1); 71548#L20 assume !(1 == ~n); 71543#L23 call #t~ret2 := fibo1(~n - 1);< 71547#fibo1ENTRY ~n := #in~n; 71583#L8 assume !(~n < 1); 71580#L10 assume !(1 == ~n); 71576#L13 call #t~ret0 := fibo2(~n - 1);< 71577#fibo2ENTRY ~n := #in~n; 71584#L18 assume !(~n < 1); 71581#L20 assume !(1 == ~n); 71582#L23 call #t~ret2 := fibo1(~n - 1);< 71833#fibo1ENTRY ~n := #in~n; 71841#L8 assume !(~n < 1); 71837#L10 assume 1 == ~n;#res := 1; 71836#fibo1FINAL assume true; 71832#fibo1EXIT >#45#return; 71827#L23-1 call #t~ret3 := fibo1(~n - 2);< 71831#fibo1ENTRY ~n := #in~n; 71843#L8 assume ~n < 1;#res := 0; 71839#fibo1FINAL assume true; 71825#fibo1EXIT >#47#return; 71829#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72199#fibo2FINAL assume true; 72197#fibo2EXIT >#49#return; 72194#L13-1 call #t~ret1 := fibo2(~n - 2);< 72195#fibo2ENTRY ~n := #in~n; 72200#L18 assume !(~n < 1); 72198#L20 assume 1 == ~n;#res := 1; 72196#fibo2FINAL assume true; 72193#fibo2EXIT >#51#return; 72192#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72191#fibo1FINAL assume true; 72175#fibo1EXIT >#45#return; 72138#L23-1 call #t~ret3 := fibo1(~n - 2);< 72143#fibo1ENTRY ~n := #in~n; 72190#L8 assume !(~n < 1); 72188#L10 assume !(1 == ~n); 72172#L13 call #t~ret0 := fibo2(~n - 1);< 72173#fibo2ENTRY ~n := #in~n; 72181#L18 assume !(~n < 1); 72180#L20 assume 1 == ~n;#res := 1; 72179#fibo2FINAL assume true; 72171#fibo2EXIT >#49#return; 72167#L13-1 call #t~ret1 := fibo2(~n - 2);< 72169#fibo2ENTRY ~n := #in~n; 72186#L18 assume ~n < 1;#res := 0; 72184#fibo2FINAL assume true; 72166#fibo2EXIT >#51#return; 72165#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72164#fibo1FINAL assume true; 72137#fibo1EXIT >#47#return; 72132#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72126#fibo2FINAL assume true; 72123#fibo2EXIT >#49#return; 72118#L13-1 call #t~ret1 := fibo2(~n - 2);< 72121#fibo2ENTRY ~n := #in~n; 72159#L18 assume !(~n < 1); 72157#L20 assume !(1 == ~n); 72135#L23 call #t~ret2 := fibo1(~n - 1);< 72136#fibo1ENTRY ~n := #in~n; 72189#L8 assume !(~n < 1); 72174#L10 assume !(1 == ~n); 72161#L13 call #t~ret0 := fibo2(~n - 1);< 72163#fibo2ENTRY ~n := #in~n; 72183#L18 assume !(~n < 1); 72182#L20 assume 1 == ~n;#res := 1; 72170#fibo2FINAL assume true; 72160#fibo2EXIT >#49#return; 72153#L13-1 call #t~ret1 := fibo2(~n - 2);< 72156#fibo2ENTRY ~n := #in~n; 72178#L18 assume ~n < 1;#res := 0; 72158#fibo2FINAL assume true; 72152#fibo2EXIT >#51#return; 72150#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72148#fibo1FINAL assume true; 72134#fibo1EXIT >#45#return; 72128#L23-1 call #t~ret3 := fibo1(~n - 2);< 72131#fibo1ENTRY ~n := #in~n; 72176#L8 assume !(~n < 1); 72144#L10 assume 1 == ~n;#res := 1; 72133#fibo1FINAL assume true; 72127#fibo1EXIT >#47#return; 72124#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 72122#fibo2FINAL assume true; 72117#fibo2EXIT >#51#return; 71645#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 72485#fibo1FINAL assume true; 71454#fibo1EXIT >#45#return; 71434#L23-1 call #t~ret3 := fibo1(~n - 2);< 71450#fibo1ENTRY ~n := #in~n; 71501#L8 assume !(~n < 1); 71502#L10 assume !(1 == ~n); 71432#L13 [2019-11-20 04:06:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1387384655, now seen corresponding path program 4 times [2019-11-20 04:06:50,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:50,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074198015] [2019-11-20 04:06:50,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 463 proven. 260 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-11-20 04:06:50,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074198015] [2019-11-20 04:06:50,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55421565] [2019-11-20 04:06:50,628 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:50,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 04:06:50,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:50,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 04:06:50,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 398 proven. 239 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2019-11-20 04:06:50,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:50,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 28 [2019-11-20 04:06:50,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535924944] [2019-11-20 04:06:50,953 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 04:06:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2000726677, now seen corresponding path program 3 times [2019-11-20 04:06:50,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:50,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308592610] [2019-11-20 04:06:50,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:06:50,977 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:06:52,127 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:52,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:52,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:52,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:52,127 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 04:06:52,128 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:52,128 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:52,128 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:52,128 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration15_Loop [2019-11-20 04:06:52,128 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:52,128 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:52,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:52,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:52,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:52,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:52,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:52,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:52,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:52,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:52,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:52,216 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:52,216 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:52,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:52,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 04:06:52,238 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:52,238 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:52,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:52,247 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:52,252 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:52,252 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:52,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:52,266 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:52,271 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:52,272 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:52,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:52,282 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:52,287 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 04:06:52,287 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:52,298 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 04:06:52,298 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:52,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 04:06:52,311 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:54,440 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 04:06:54,442 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 04:06:54,442 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 04:06:54,442 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 04:06:54,443 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 04:06:54,443 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 04:06:54,443 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:54,443 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 04:06:54,443 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 04:06:54,443 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_8-1.c_Iteration15_Loop [2019-11-20 04:06:54,443 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 04:06:54,443 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 04:06:54,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:54,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:54,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:54,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:54,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:54,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:54,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:54,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:54,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 04:06:54,544 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 04:06:54,545 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:54,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:54,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:54,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:54,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:54,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:54,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:54,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:54,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:54,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:54,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:54,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:54,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:54,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:54,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:54,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:54,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:54,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:54,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 04:06:54,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:54,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:54,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:54,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:54,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:54,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:54,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:54,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:54,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:54,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:54,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:54,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:54,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:54,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:54,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:54,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:54,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:54,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:54,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:54,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:54,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:54,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:54,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:54,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:54,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:54,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:54,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:54,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 04:06:54,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 04:06:54,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 04:06:54,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 04:06:54,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 04:06:54,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 04:06:54,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 04:06:54,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 04:06:54,616 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 04:06:54,618 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-20 04:06:54,618 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f1d9c23-4aa4-434d-8312-c469f0777d10/bin/uautomizer/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 04:06:54,622 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 04:06:54,622 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 04:06:54,622 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 04:06:54,622 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2019-11-20 04:06:54,624 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 04:06:54,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:54,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-20 04:06:54,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:54,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:54,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:54,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:54,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:54,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:54,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:54,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:55,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-20 04:06:55,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 31 proven. 131 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-20 04:06:55,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2019-11-20 04:06:55,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2698 states and 3097 transitions. cyclomatic complexity: 409 Second operand 15 states. [2019-11-20 04:06:56,504 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2698 states and 3097 transitions. cyclomatic complexity: 409. Second operand 15 states. Result 5897 states and 6736 transitions. Complement of second has 79 states. [2019-11-20 04:06:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2019-11-20 04:06:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 04:06:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2019-11-20 04:06:56,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 76 transitions. Stem has 272 letters. Loop has 102 letters. [2019-11-20 04:06:56,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:56,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 76 transitions. Stem has 374 letters. Loop has 102 letters. [2019-11-20 04:06:56,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:56,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 76 transitions. Stem has 272 letters. Loop has 204 letters. [2019-11-20 04:06:56,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 04:06:56,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5897 states and 6736 transitions. [2019-11-20 04:06:56,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-20 04:06:56,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5897 states to 3928 states and 4485 transitions. [2019-11-20 04:06:56,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2019-11-20 04:06:56,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 421 [2019-11-20 04:06:56,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3928 states and 4485 transitions. [2019-11-20 04:06:56,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 04:06:56,600 INFO L688 BuchiCegarLoop]: Abstraction has 3928 states and 4485 transitions. [2019-11-20 04:06:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states and 4485 transitions. [2019-11-20 04:06:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3899. [2019-11-20 04:06:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3899 states. [2019-11-20 04:06:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 4454 transitions. [2019-11-20 04:06:56,719 INFO L711 BuchiCegarLoop]: Abstraction has 3899 states and 4454 transitions. [2019-11-20 04:06:56,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:56,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 04:06:56,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2019-11-20 04:06:56,720 INFO L87 Difference]: Start difference. First operand 3899 states and 4454 transitions. Second operand 28 states. [2019-11-20 04:06:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:58,431 INFO L93 Difference]: Finished difference Result 2470 states and 2702 transitions. [2019-11-20 04:06:58,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-20 04:06:58,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2470 states and 2702 transitions. [2019-11-20 04:06:58,443 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 04:06:58,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2470 states to 0 states and 0 transitions. [2019-11-20 04:06:58,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 04:06:58,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 04:06:58,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 04:06:58,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 04:06:58,444 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:06:58,445 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:06:58,445 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:06:58,445 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-20 04:06:58,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 04:06:58,445 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 04:06:58,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 04:06:58,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 04:06:58 BoogieIcfgContainer [2019-11-20 04:06:58,453 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 04:06:58,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:06:58,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:06:58,454 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:06:58,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:04" (3/4) ... [2019-11-20 04:06:58,458 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 04:06:58,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:06:58,460 INFO L168 Benchmark]: Toolchain (without parser) took 54284.65 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 912.3 MB). Free memory was 950.1 MB in the beginning and 1.7 GB in the end (delta: -755.5 MB). Peak memory consumption was 156.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:06:58,461 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:06:58,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 04:06:58,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:06:58,462 INFO L168 Benchmark]: Boogie Preprocessor took 21.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:06:58,462 INFO L168 Benchmark]: RCFGBuilder took 284.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-20 04:06:58,463 INFO L168 Benchmark]: BuchiAutomizer took 53607.42 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 778.6 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -595.5 MB). Peak memory consumption was 183.1 MB. Max. memory is 11.5 GB. [2019-11-20 04:06:58,463 INFO L168 Benchmark]: Witness Printer took 5.44 ms. Allocated memory is still 1.9 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:06:58,465 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 284.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 53607.42 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 778.6 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -595.5 MB). Peak memory consumption was 183.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.44 ms. Allocated memory is still 1.9 GB. Free memory is still 1.7 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 21 terminating modules (14 trivial, 3 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 9 locations. One deterministic module has affine ranking function n and consists of 17 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 12 locations. One nondeterministic module has affine ranking function n and consists of 14 locations. One nondeterministic module has affine ranking function n and consists of 14 locations. 14 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 53.5s and 16 iterations. TraceHistogramMax:48. Analysis of lassos took 28.7s. Construction of modules took 8.6s. Büchi inclusion checks took 14.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 20. Automata minimization 0.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 1844 StatesRemovedByMinimization, 20 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had 2767 states and ocurred in iteration 13. Nontrivial modules had stage [3, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 200/391 HoareTripleCheckerStatistics: 733 SDtfs, 1863 SDslu, 3574 SDs, 0 SdLazy, 8969 SolverSat, 1547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI8 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf99 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq199 hnf90 smp92 dnf100 smp100 tf109 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 30 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...