./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 675300a4b632e073b31d1e86ab5660e0c5ab887b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:43:12,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:43:12,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:43:12,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:43:12,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:43:12,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:43:12,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:43:12,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:43:12,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:43:12,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:43:12,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:43:12,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:43:12,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:43:12,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:43:12,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:43:12,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:43:12,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:43:12,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:43:12,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:43:12,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:43:12,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:43:12,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:43:12,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:43:12,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:43:12,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:43:12,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:43:12,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:43:12,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:43:12,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:43:12,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:43:12,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:43:12,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:43:12,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:43:12,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:43:12,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:43:12,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:43:12,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:43:12,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:43:12,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:43:12,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:43:12,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:43:12,994 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2020-11-30 01:43:13,043 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:43:13,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:43:13,045 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 01:43:13,045 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 01:43:13,046 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 01:43:13,046 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 01:43:13,046 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 01:43:13,047 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 01:43:13,047 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 01:43:13,047 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 01:43:13,049 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 01:43:13,049 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 01:43:13,049 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 01:43:13,050 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 01:43:13,050 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 01:43:13,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:43:13,051 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:43:13,051 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:43:13,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:43:13,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:43:13,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:43:13,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:43:13,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:43:13,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:43:13,053 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2020-11-30 01:43:13,054 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:43:13,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:43:13,054 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:43:13,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:43:13,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:43:13,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:43:13,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:43:13,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:43:13,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:43:13,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:43:13,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:43:13,059 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 01:43:13,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:43:13,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:43:13,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:43:13,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:43:13,060 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan 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(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 675300a4b632e073b31d1e86ab5660e0c5ab887b [2020-11-30 01:43:13,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:43:13,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:43:13,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:43:13,454 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:43:13,455 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:43:13,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci02.c [2020-11-30 01:43:13,579 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/data/f2e7bcd92/67de0cd95f734f668185e31e67dfe97c/FLAGc3eccc71c [2020-11-30 01:43:14,044 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:43:14,044 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/sv-benchmarks/c/recursive/Fibonacci02.c [2020-11-30 01:43:14,053 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/data/f2e7bcd92/67de0cd95f734f668185e31e67dfe97c/FLAGc3eccc71c [2020-11-30 01:43:14,427 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/data/f2e7bcd92/67de0cd95f734f668185e31e67dfe97c [2020-11-30 01:43:14,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:43:14,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:43:14,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:43:14,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:43:14,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:43:14,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a0e68c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14, skipping insertion in model container [2020-11-30 01:43:14,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:43:14,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:43:14,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:43:14,702 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:43:14,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:43:14,752 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:43:14,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14 WrapperNode [2020-11-30 01:43:14,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:43:14,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:43:14,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:43:14,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:43:14,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:43:14,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:43:14,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:43:14,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:43:14,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (1/1) ... [2020-11-30 01:43:14,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:43:14,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:43:14,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:43:14,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:43:14,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:43:14,905 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-30 01:43:14,905 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-30 01:43:14,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:43:14,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:43:14,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:43:14,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:43:15,299 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:43:15,300 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 01:43:15,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:43:15 BoogieIcfgContainer [2020-11-30 01:43:15,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:43:15,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:43:15,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:43:15,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:43:15,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:43:14" (1/3) ... [2020-11-30 01:43:15,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38313221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:43:15, skipping insertion in model container [2020-11-30 01:43:15,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:43:14" (2/3) ... [2020-11-30 01:43:15,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38313221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:43:15, skipping insertion in model container [2020-11-30 01:43:15,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:43:15" (3/3) ... [2020-11-30 01:43:15,310 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2020-11-30 01:43:15,321 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:43:15,326 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-11-30 01:43:15,340 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-30 01:43:15,364 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:43:15,364 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:43:15,364 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:43:15,364 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:43:15,365 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:43:15,365 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:43:15,365 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:43:15,365 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:43:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-11-30 01:43:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 01:43:15,394 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:15,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 01:43:15,396 INFO L429 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:15,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1961225628, now seen corresponding path program 1 times [2020-11-30 01:43:15,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:15,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83379589] [2020-11-30 01:43:15,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:43:15,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83379589] [2020-11-30 01:43:15,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:43:15,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:43:15,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060657476] [2020-11-30 01:43:15,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:43:15,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:15,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:43:15,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:43:15,697 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-11-30 01:43:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:15,829 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-11-30 01:43:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:43:15,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-11-30 01:43:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:15,838 INFO L225 Difference]: With dead ends: 25 [2020-11-30 01:43:15,838 INFO L226 Difference]: Without dead ends: 21 [2020-11-30 01:43:15,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:43:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-11-30 01:43:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-11-30 01:43:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-30 01:43:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-11-30 01:43:15,876 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2020-11-30 01:43:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:15,877 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-11-30 01:43:15,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:43:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-11-30 01:43:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 01:43:15,878 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:15,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:43:15,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:43:15,879 INFO L429 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:15,880 INFO L82 PathProgramCache]: Analyzing trace with hash -668452282, now seen corresponding path program 1 times [2020-11-30 01:43:15,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:15,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280242319] [2020-11-30 01:43:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:43:15,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280242319] [2020-11-30 01:43:15,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:43:15,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:43:15,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505439214] [2020-11-30 01:43:15,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:43:15,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:15,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:43:15,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:43:15,929 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2020-11-30 01:43:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:15,959 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-11-30 01:43:15,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:43:15,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-30 01:43:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:15,962 INFO L225 Difference]: With dead ends: 23 [2020-11-30 01:43:15,962 INFO L226 Difference]: Without dead ends: 21 [2020-11-30 01:43:15,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:43:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-11-30 01:43:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-11-30 01:43:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-30 01:43:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-11-30 01:43:15,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2020-11-30 01:43:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:15,977 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-11-30 01:43:15,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:43:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-11-30 01:43:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:43:15,979 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:15,979 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:43:15,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:43:15,980 INFO L429 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1804304395, now seen corresponding path program 1 times [2020-11-30 01:43:15,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:15,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632505562] [2020-11-30 01:43:15,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-30 01:43:16,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632505562] [2020-11-30 01:43:16,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:43:16,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:43:16,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221480065] [2020-11-30 01:43:16,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:43:16,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:16,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:43:16,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:43:16,148 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2020-11-30 01:43:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:16,212 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-11-30 01:43:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:43:16,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-11-30 01:43:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:16,214 INFO L225 Difference]: With dead ends: 35 [2020-11-30 01:43:16,214 INFO L226 Difference]: Without dead ends: 33 [2020-11-30 01:43:16,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:43:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-11-30 01:43:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-11-30 01:43:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-30 01:43:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-11-30 01:43:16,227 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 28 [2020-11-30 01:43:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:16,228 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-11-30 01:43:16,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:43:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-11-30 01:43:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:43:16,229 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:16,230 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:43:16,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:43:16,230 INFO L429 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1447159358, now seen corresponding path program 1 times [2020-11-30 01:43:16,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:16,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138863708] [2020-11-30 01:43:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 01:43:16,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138863708] [2020-11-30 01:43:16,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374222828] [2020-11-30 01:43:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:16,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 01:43:16,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:43:16,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:43:16,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1724999946] [2020-11-30 01:43:16,760 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-11-30 01:43:16,760 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 01:43:16,766 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:43:16,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:43:16,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2020-11-30 01:43:16,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117772477] [2020-11-30 01:43:16,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-30 01:43:16,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:16,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 01:43:16,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:43:16,771 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 15 states. [2020-11-30 01:43:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:17,414 INFO L93 Difference]: Finished difference Result 125 states and 171 transitions. [2020-11-30 01:43:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:43:17,416 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-11-30 01:43:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:17,419 INFO L225 Difference]: With dead ends: 125 [2020-11-30 01:43:17,420 INFO L226 Difference]: Without dead ends: 92 [2020-11-30 01:43:17,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:43:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-30 01:43:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2020-11-30 01:43:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-30 01:43:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2020-11-30 01:43:17,482 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 23 [2020-11-30 01:43:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:17,482 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2020-11-30 01:43:17,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-30 01:43:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2020-11-30 01:43:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:43:17,490 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:17,492 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:43:17,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:17,720 INFO L429 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:17,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:17,721 INFO L82 PathProgramCache]: Analyzing trace with hash 933213507, now seen corresponding path program 2 times [2020-11-30 01:43:17,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:17,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11526610] [2020-11-30 01:43:17,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-30 01:43:17,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11526610] [2020-11-30 01:43:17,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566157753] [2020-11-30 01:43:17,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:17,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-30 01:43:17,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:43:17,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:43:17,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-30 01:43:17,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-30 01:43:18,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:43:18,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 9 [2020-11-30 01:43:18,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152786509] [2020-11-30 01:43:18,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:43:18,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:18,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:43:18,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:43:18,028 INFO L87 Difference]: Start difference. First operand 80 states and 111 transitions. Second operand 6 states. [2020-11-30 01:43:18,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:18,116 INFO L93 Difference]: Finished difference Result 94 states and 127 transitions. [2020-11-30 01:43:18,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:43:18,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-11-30 01:43:18,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:18,121 INFO L225 Difference]: With dead ends: 94 [2020-11-30 01:43:18,121 INFO L226 Difference]: Without dead ends: 93 [2020-11-30 01:43:18,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:43:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-30 01:43:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2020-11-30 01:43:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-30 01:43:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 115 transitions. [2020-11-30 01:43:18,154 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 115 transitions. Word has length 29 [2020-11-30 01:43:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:18,154 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 115 transitions. [2020-11-30 01:43:18,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:43:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2020-11-30 01:43:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:43:18,156 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:18,159 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:43:18,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:18,372 INFO L429 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:18,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:18,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1135152301, now seen corresponding path program 1 times [2020-11-30 01:43:18,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:18,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625193625] [2020-11-30 01:43:18,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-30 01:43:18,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625193625] [2020-11-30 01:43:18,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477802338] [2020-11-30 01:43:18,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:18,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 01:43:18,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:43:18,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:43:18,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1310558082] [2020-11-30 01:43:18,980 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-11-30 01:43:18,980 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 01:43:18,981 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:43:18,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:43:18,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2020-11-30 01:43:18,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457476391] [2020-11-30 01:43:18,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 01:43:18,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:18,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 01:43:18,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:43:18,989 INFO L87 Difference]: Start difference. First operand 84 states and 115 transitions. Second operand 19 states. [2020-11-30 01:43:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:20,028 INFO L93 Difference]: Finished difference Result 286 states and 441 transitions. [2020-11-30 01:43:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-30 01:43:20,028 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2020-11-30 01:43:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:20,032 INFO L225 Difference]: With dead ends: 286 [2020-11-30 01:43:20,032 INFO L226 Difference]: Without dead ends: 210 [2020-11-30 01:43:20,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2020-11-30 01:43:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-11-30 01:43:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2020-11-30 01:43:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-11-30 01:43:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 254 transitions. [2020-11-30 01:43:20,069 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 254 transitions. Word has length 30 [2020-11-30 01:43:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:20,069 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 254 transitions. [2020-11-30 01:43:20,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 01:43:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 254 transitions. [2020-11-30 01:43:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 01:43:20,072 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:20,072 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:43:20,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:20,284 INFO L429 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:20,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1354732194, now seen corresponding path program 1 times [2020-11-30 01:43:20,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:20,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803164906] [2020-11-30 01:43:20,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-11-30 01:43:20,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803164906] [2020-11-30 01:43:20,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:43:20,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:43:20,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047093648] [2020-11-30 01:43:20,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:43:20,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:43:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:43:20,378 INFO L87 Difference]: Start difference. First operand 174 states and 254 transitions. Second operand 5 states. [2020-11-30 01:43:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:20,423 INFO L93 Difference]: Finished difference Result 191 states and 277 transitions. [2020-11-30 01:43:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:43:20,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-11-30 01:43:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:20,427 INFO L225 Difference]: With dead ends: 191 [2020-11-30 01:43:20,427 INFO L226 Difference]: Without dead ends: 189 [2020-11-30 01:43:20,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:43:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-11-30 01:43:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 181. [2020-11-30 01:43:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-11-30 01:43:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2020-11-30 01:43:20,455 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 48 [2020-11-30 01:43:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:20,458 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2020-11-30 01:43:20,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:43:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2020-11-30 01:43:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-30 01:43:20,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:20,463 INFO L422 BasicCegarLoop]: trace histogram [11, 9, 7, 7, 7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-11-30 01:43:20,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:43:20,464 INFO L429 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash 616163065, now seen corresponding path program 1 times [2020-11-30 01:43:20,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:20,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509565547] [2020-11-30 01:43:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2020-11-30 01:43:20,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509565547] [2020-11-30 01:43:20,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587699747] [2020-11-30 01:43:20,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:20,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 01:43:20,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 116 proven. 75 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-11-30 01:43:20,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 35 proven. 175 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-30 01:43:21,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1097452281] [2020-11-30 01:43:21,215 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-11-30 01:43:21,215 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 01:43:21,216 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:43:21,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:43:21,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 15, 15] total 24 [2020-11-30 01:43:21,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867563777] [2020-11-30 01:43:21,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-30 01:43:21,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:21,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-30 01:43:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2020-11-30 01:43:21,225 INFO L87 Difference]: Start difference. First operand 181 states and 267 transitions. Second operand 24 states. [2020-11-30 01:43:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:22,258 INFO L93 Difference]: Finished difference Result 496 states and 796 transitions. [2020-11-30 01:43:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 01:43:22,258 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 81 [2020-11-30 01:43:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:22,263 INFO L225 Difference]: With dead ends: 496 [2020-11-30 01:43:22,263 INFO L226 Difference]: Without dead ends: 329 [2020-11-30 01:43:22,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2020-11-30 01:43:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-11-30 01:43:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 301. [2020-11-30 01:43:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-11-30 01:43:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 413 transitions. [2020-11-30 01:43:22,324 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 413 transitions. Word has length 81 [2020-11-30 01:43:22,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:22,325 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 413 transitions. [2020-11-30 01:43:22,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-30 01:43:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 413 transitions. [2020-11-30 01:43:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-30 01:43:22,336 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:22,337 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-11-30 01:43:22,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:22,567 INFO L429 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:22,568 INFO L82 PathProgramCache]: Analyzing trace with hash 45919278, now seen corresponding path program 1 times [2020-11-30 01:43:22,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:22,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146043582] [2020-11-30 01:43:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-11-30 01:43:22,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146043582] [2020-11-30 01:43:22,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134520035] [2020-11-30 01:43:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:22,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-30 01:43:22,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 108 proven. 184 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-30 01:43:23,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 3 proven. 293 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-30 01:43:23,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1728997417] [2020-11-30 01:43:23,328 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-11-30 01:43:23,328 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 01:43:23,328 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:43:23,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:43:23,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 21, 21] total 25 [2020-11-30 01:43:23,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980957373] [2020-11-30 01:43:23,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-30 01:43:23,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:23,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-30 01:43:23,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2020-11-30 01:43:23,332 INFO L87 Difference]: Start difference. First operand 301 states and 413 transitions. Second operand 25 states. [2020-11-30 01:43:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:24,222 INFO L93 Difference]: Finished difference Result 642 states and 931 transitions. [2020-11-30 01:43:24,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-30 01:43:24,222 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2020-11-30 01:43:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:24,226 INFO L225 Difference]: With dead ends: 642 [2020-11-30 01:43:24,226 INFO L226 Difference]: Without dead ends: 361 [2020-11-30 01:43:24,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=996, Unknown=0, NotChecked=0, Total=1260 [2020-11-30 01:43:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-11-30 01:43:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 324. [2020-11-30 01:43:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-11-30 01:43:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 439 transitions. [2020-11-30 01:43:24,268 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 439 transitions. Word has length 86 [2020-11-30 01:43:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:24,269 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 439 transitions. [2020-11-30 01:43:24,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-30 01:43:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 439 transitions. [2020-11-30 01:43:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-30 01:43:24,271 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:24,272 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 01:43:24,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:24,499 INFO L429 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:24,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:24,500 INFO L82 PathProgramCache]: Analyzing trace with hash 472266744, now seen corresponding path program 2 times [2020-11-30 01:43:24,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:24,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538882162] [2020-11-30 01:43:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 178 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-30 01:43:24,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538882162] [2020-11-30 01:43:24,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123055321] [2020-11-30 01:43:24,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:24,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-30 01:43:24,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:43:24,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 01:43:24,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2020-11-30 01:43:24,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2020-11-30 01:43:25,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1744717631] [2020-11-30 01:43:25,161 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-11-30 01:43:25,161 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 01:43:25,161 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:43:25,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:43:25,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 27 [2020-11-30 01:43:25,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571990668] [2020-11-30 01:43:25,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-30 01:43:25,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:25,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-30 01:43:25,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2020-11-30 01:43:25,168 INFO L87 Difference]: Start difference. First operand 324 states and 439 transitions. Second operand 27 states. [2020-11-30 01:43:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:26,290 INFO L93 Difference]: Finished difference Result 492 states and 667 transitions. [2020-11-30 01:43:26,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-30 01:43:26,291 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2020-11-30 01:43:26,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:26,294 INFO L225 Difference]: With dead ends: 492 [2020-11-30 01:43:26,294 INFO L226 Difference]: Without dead ends: 188 [2020-11-30 01:43:26,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=585, Invalid=1485, Unknown=0, NotChecked=0, Total=2070 [2020-11-30 01:43:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-11-30 01:43:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2020-11-30 01:43:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-30 01:43:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 204 transitions. [2020-11-30 01:43:26,312 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 204 transitions. Word has length 85 [2020-11-30 01:43:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:26,313 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 204 transitions. [2020-11-30 01:43:26,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-30 01:43:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 204 transitions. [2020-11-30 01:43:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-30 01:43:26,314 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:26,314 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 01:43:26,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:26,527 INFO L429 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1862580727, now seen corresponding path program 3 times [2020-11-30 01:43:26,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:26,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36859429] [2020-11-30 01:43:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2020-11-30 01:43:26,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36859429] [2020-11-30 01:43:26,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399549924] [2020-11-30 01:43:26,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:26,751 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 01:43:26,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:43:26,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:43:26,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2020-11-30 01:43:26,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2020-11-30 01:43:27,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1708773639] [2020-11-30 01:43:27,076 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-11-30 01:43:27,076 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 01:43:27,077 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:43:27,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:43:27,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2020-11-30 01:43:27,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640420423] [2020-11-30 01:43:27,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 01:43:27,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:27,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 01:43:27,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:43:27,081 INFO L87 Difference]: Start difference. First operand 176 states and 204 transitions. Second operand 16 states. [2020-11-30 01:43:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:27,209 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2020-11-30 01:43:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:43:27,209 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-11-30 01:43:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:27,211 INFO L225 Difference]: With dead ends: 179 [2020-11-30 01:43:27,211 INFO L226 Difference]: Without dead ends: 177 [2020-11-30 01:43:27,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:43:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-11-30 01:43:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2020-11-30 01:43:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-30 01:43:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2020-11-30 01:43:27,223 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 79 [2020-11-30 01:43:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:27,224 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2020-11-30 01:43:27,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 01:43:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2020-11-30 01:43:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-30 01:43:27,232 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:27,232 INFO L422 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1] [2020-11-30 01:43:27,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:27,448 INFO L429 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash 23899264, now seen corresponding path program 2 times [2020-11-30 01:43:27,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:27,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103251787] [2020-11-30 01:43:27,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 14 proven. 67 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2020-11-30 01:43:27,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103251787] [2020-11-30 01:43:27,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96005811] [2020-11-30 01:43:27,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:27,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-30 01:43:27,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:43:27,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 01:43:27,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2020-11-30 01:43:27,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2020-11-30 01:43:28,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1086775824] [2020-11-30 01:43:28,058 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-11-30 01:43:28,058 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 01:43:28,058 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:43:28,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:43:28,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 18 [2020-11-30 01:43:28,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007335062] [2020-11-30 01:43:28,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 01:43:28,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:28,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 01:43:28,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:43:28,062 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. Second operand 19 states. [2020-11-30 01:43:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:28,209 INFO L93 Difference]: Finished difference Result 176 states and 201 transitions. [2020-11-30 01:43:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:43:28,210 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 113 [2020-11-30 01:43:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:28,211 INFO L225 Difference]: With dead ends: 176 [2020-11-30 01:43:28,211 INFO L226 Difference]: Without dead ends: 174 [2020-11-30 01:43:28,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:43:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-30 01:43:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-11-30 01:43:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-11-30 01:43:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2020-11-30 01:43:28,222 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 113 [2020-11-30 01:43:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:28,222 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2020-11-30 01:43:28,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 01:43:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2020-11-30 01:43:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-11-30 01:43:28,225 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:28,225 INFO L422 BasicCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1] [2020-11-30 01:43:28,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-11-30 01:43:28,450 INFO L429 AbstractCegarLoop]: === Iteration 13 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:28,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:28,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1679124650, now seen corresponding path program 4 times [2020-11-30 01:43:28,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:28,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351362392] [2020-11-30 01:43:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 183 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2020-11-30 01:43:28,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351362392] [2020-11-30 01:43:28,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149730480] [2020-11-30 01:43:28,761 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:28,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 29 conjunts are in the unsatisfiable core [2020-11-30 01:43:28,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2020-11-30 01:43:29,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 144 proven. 122 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2020-11-30 01:43:30,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [995775120] [2020-11-30 01:43:30,616 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-11-30 01:43:30,616 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 01:43:30,617 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:43:30,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:43:30,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 31 [2020-11-30 01:43:30,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784534291] [2020-11-30 01:43:30,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-11-30 01:43:30,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:30,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-30 01:43:30,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2020-11-30 01:43:30,621 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 32 states. [2020-11-30 01:43:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:30,780 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2020-11-30 01:43:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-30 01:43:30,781 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 165 [2020-11-30 01:43:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:30,783 INFO L225 Difference]: With dead ends: 175 [2020-11-30 01:43:30,783 INFO L226 Difference]: Without dead ends: 174 [2020-11-30 01:43:30,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2020-11-30 01:43:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-30 01:43:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-11-30 01:43:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-11-30 01:43:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2020-11-30 01:43:30,795 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 165 [2020-11-30 01:43:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:30,796 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2020-11-30 01:43:30,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-11-30 01:43:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2020-11-30 01:43:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2020-11-30 01:43:30,803 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:30,803 INFO L422 BasicCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 19, 19, 13, 8, 1, 1, 1] [2020-11-30 01:43:31,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:31,023 INFO L429 AbstractCegarLoop]: === Iteration 14 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:31,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:31,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1610731973, now seen corresponding path program 5 times [2020-11-30 01:43:31,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:31,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131587984] [2020-11-30 01:43:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 830 proven. 1451 refuted. 0 times theorem prover too weak. 3684 trivial. 0 not checked. [2020-11-30 01:43:31,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131587984] [2020-11-30 01:43:31,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106108314] [2020-11-30 01:43:31,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:31,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2020-11-30 01:43:31,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:43:31,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 81 conjunts are in the unsatisfiable core [2020-11-30 01:43:31,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2020-11-30 01:43:32,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:33,259 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-30 01:43:36,081 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:43:36,267 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:43:36,447 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:43:36,644 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:43:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 1149 proven. 996 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2020-11-30 01:43:39,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [800055555] [2020-11-30 01:43:39,935 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-11-30 01:43:39,935 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 01:43:39,936 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:43:39,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:43:39,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 29] total 45 [2020-11-30 01:43:39,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783231204] [2020-11-30 01:43:39,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-11-30 01:43:39,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:43:39,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-11-30 01:43:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1607, Unknown=0, NotChecked=0, Total=2070 [2020-11-30 01:43:39,940 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 46 states. [2020-11-30 01:43:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:43:40,111 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2020-11-30 01:43:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 01:43:40,118 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 408 [2020-11-30 01:43:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:43:40,120 INFO L225 Difference]: With dead ends: 175 [2020-11-30 01:43:40,120 INFO L226 Difference]: Without dead ends: 174 [2020-11-30 01:43:40,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=510, Invalid=1746, Unknown=0, NotChecked=0, Total=2256 [2020-11-30 01:43:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-30 01:43:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-11-30 01:43:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-11-30 01:43:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2020-11-30 01:43:40,131 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 408 [2020-11-30 01:43:40,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:43:40,132 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2020-11-30 01:43:40,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-11-30 01:43:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2020-11-30 01:43:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2020-11-30 01:43:40,177 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:43:40,178 INFO L422 BasicCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 34, 21, 1, 1, 1] [2020-11-30 01:43:40,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:40,391 INFO L429 AbstractCegarLoop]: === Iteration 15 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 01:43:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:43:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 225703961, now seen corresponding path program 6 times [2020-11-30 01:43:40,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:43:40,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695895230] [2020-11-30 01:43:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:43:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:43:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6794 proven. 10214 refuted. 0 times theorem prover too weak. 24405 trivial. 0 not checked. [2020-11-30 01:43:42,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695895230] [2020-11-30 01:43:42,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583426538] [2020-11-30 01:43:42,701 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:43:43,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 01:43:43,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:43:43,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 1997 conjuncts, 217 conjunts are in the unsatisfiable core [2020-11-30 01:43:43,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:43:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2020-11-30 01:43:44,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:43:46,053 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:43:46,217 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:43:46,389 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:43:46,561 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:43:47,833 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-11-30 01:43:48,256 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-11-30 01:43:48,708 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-11-30 01:43:49,142 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-11-30 01:43:51,978 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-30 01:43:52,595 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:43:52,763 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:43:52,939 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:43:53,112 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:43:57,524 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:43:57,697 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:43:57,884 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:43:58,072 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:43:59,439 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-11-30 01:43:59,861 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-11-30 01:44:00,286 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-11-30 01:44:00,699 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-11-30 01:44:02,144 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:44:02,322 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:44:02,504 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:44:02,697 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:44:03,655 WARN L193 SmtUtils]: Spent 950.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2020-11-30 01:44:04,604 WARN L193 SmtUtils]: Spent 944.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2020-11-30 01:44:05,915 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 304 [2020-11-30 01:44:06,861 WARN L193 SmtUtils]: Spent 942.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2020-11-30 01:44:08,563 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:44:08,754 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:44:08,955 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:44:09,157 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:44:12,972 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-30 01:44:13,695 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:44:13,900 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:44:14,096 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:44:14,298 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:44:15,718 WARN L193 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-11-30 01:44:16,150 WARN L193 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-11-30 01:44:16,620 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-11-30 01:44:17,091 WARN L193 SmtUtils]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2020-11-30 01:44:21,079 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:44:21,278 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-30 01:44:21,497 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:44:21,707 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-30 01:44:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 7863 proven. 7339 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2020-11-30 01:44:26,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1119492747] [2020-11-30 01:44:26,164 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-11-30 01:44:26,164 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 01:44:26,165 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:44:26,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:44:26,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 41] total 59 [2020-11-30 01:44:26,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122203499] [2020-11-30 01:44:26,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 60 states [2020-11-30 01:44:26,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:44:26,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2020-11-30 01:44:26,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=2770, Unknown=0, NotChecked=0, Total=3540 [2020-11-30 01:44:26,172 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 60 states. [2020-11-30 01:44:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:44:26,478 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2020-11-30 01:44:26,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-30 01:44:26,480 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1063 [2020-11-30 01:44:26,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:44:26,483 INFO L225 Difference]: With dead ends: 174 [2020-11-30 01:44:26,483 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 01:44:26,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2342 GetRequests, 2283 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=810, Invalid=2850, Unknown=0, NotChecked=0, Total=3660 [2020-11-30 01:44:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 01:44:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 01:44:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 01:44:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 01:44:26,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1063 [2020-11-30 01:44:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:44:26,488 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:44:26,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2020-11-30 01:44:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 01:44:26,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 01:44:26,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-30 01:44:26,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-30 01:44:27,637 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 13 [2020-11-30 01:44:28,488 WARN L193 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2020-11-30 01:44:28,503 INFO L274 CegarLoopResult]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,503 INFO L274 CegarLoopResult]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,503 INFO L274 CegarLoopResult]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,503 INFO L274 CegarLoopResult]: For program point L19(lines 19 23) no Hoare annotation was computed. [2020-11-30 01:44:28,503 INFO L274 CegarLoopResult]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2020-11-30 01:44:28,504 INFO L274 CegarLoopResult]: For program point L17(lines 17 23) no Hoare annotation was computed. [2020-11-30 01:44:28,504 INFO L274 CegarLoopResult]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,504 INFO L274 CegarLoopResult]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2020-11-30 01:44:28,504 INFO L274 CegarLoopResult]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,504 INFO L274 CegarLoopResult]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,504 INFO L277 CegarLoopResult]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2020-11-30 01:44:28,504 INFO L274 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,504 INFO L274 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,504 INFO L270 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (and (or (and (<= |fibonacci_#in~n| fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 9))) (not (<= |fibonacci_#in~n| 1))) [2020-11-30 01:44:28,504 INFO L274 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,504 INFO L274 CegarLoopResult]: For program point L22-4(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,505 INFO L274 CegarLoopResult]: For program point L22-5(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,505 INFO L270 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (let ((.cse2 (<= fibonacci_~n |fibonacci_#in~n|)) (.cse0 (<= |fibonacci_#in~n| fibonacci_~n)) (.cse1 (<= 2 |fibonacci_#t~ret7|))) (and (or (not (<= |fibonacci_#in~n| 8)) (and .cse0 (<= |fibonacci_#t~ret7| 13) .cse1 .cse2) (not (<= 8 |fibonacci_#in~n|))) (not (<= |fibonacci_#in~n| 1)) (or (not (<= |fibonacci_#in~n| 6)) (and (<= |fibonacci_#t~ret7| 5) .cse2)) (or (not (<= |fibonacci_#in~n| 9)) (and (<= |fibonacci_#t~ret7| 21) .cse0 .cse1 .cse2) (not (<= 9 |fibonacci_#in~n|))) (or (<= |fibonacci_#t~ret7| 3) (not (<= |fibonacci_#in~n| 5))) (or (and .cse0 (= |fibonacci_#t~ret7| 1)) (not (<= |fibonacci_#in~n| 3))) (or (<= |fibonacci_#t~ret7| 2) (not (<= |fibonacci_#in~n| 4))) (or (and .cse0 (<= |fibonacci_#t~ret7| 8) .cse1 (<= fibonacci_~n 7)) (not (< 3 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 7))))) [2020-11-30 01:44:28,505 INFO L274 CegarLoopResult]: For program point L22-7(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,505 INFO L274 CegarLoopResult]: For program point L22-8(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,505 INFO L274 CegarLoopResult]: For program point L22-9(line 22) no Hoare annotation was computed. [2020-11-30 01:44:28,505 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-30 01:44:28,505 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-30 01:44:28,506 INFO L270 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) [2020-11-30 01:44:28,506 INFO L270 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 9) [2020-11-30 01:44:28,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:44:28 BoogieIcfgContainer [2020-11-30 01:44:28,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:44:28,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:44:28,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:44:28,520 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:44:28,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:43:15" (3/4) ... [2020-11-30 01:44:28,524 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 01:44:28,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2020-11-30 01:44:28,534 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2020-11-30 01:44:28,534 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-30 01:44:28,534 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-11-30 01:44:28,535 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 01:44:28,564 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6f8b4040-45e1-4216-830b-7e04c0bb1f7b/bin/utaipan/witness.graphml [2020-11-30 01:44:28,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:44:28,566 INFO L168 Benchmark]: Toolchain (without parser) took 74133.23 ms. Allocated memory was 113.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 78.4 MB in the beginning and 513.4 MB in the end (delta: -435.1 MB). Peak memory consumption was 763.8 MB. Max. memory is 16.1 GB. [2020-11-30 01:44:28,566 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 113.2 MB. Free memory was 86.6 MB in the beginning and 86.5 MB in the end (delta: 25.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:44:28,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.93 ms. Allocated memory is still 113.2 MB. Free memory was 78.1 MB in the beginning and 89.9 MB in the end (delta: -11.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:44:28,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.84 ms. Allocated memory is still 113.2 MB. Free memory was 89.9 MB in the beginning and 89.1 MB in the end (delta: 807.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:44:28,567 INFO L168 Benchmark]: Boogie Preprocessor took 20.89 ms. Allocated memory is still 113.2 MB. Free memory was 89.1 MB in the beginning and 87.8 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:44:28,568 INFO L168 Benchmark]: RCFGBuilder took 467.29 ms. Allocated memory is still 113.2 MB. Free memory was 87.8 MB in the beginning and 72.5 MB in the end (delta: 15.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:44:28,568 INFO L168 Benchmark]: TraceAbstraction took 73215.98 ms. Allocated memory was 113.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 71.7 MB in the beginning and 516.6 MB in the end (delta: -444.9 MB). Peak memory consumption was 756.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:44:28,569 INFO L168 Benchmark]: Witness Printer took 44.81 ms. Allocated memory is still 1.3 GB. Free memory was 516.6 MB in the beginning and 513.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:44:28,571 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 113.2 MB. Free memory was 86.6 MB in the beginning and 86.5 MB in the end (delta: 25.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 318.93 ms. Allocated memory is still 113.2 MB. Free memory was 78.1 MB in the beginning and 89.9 MB in the end (delta: -11.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.84 ms. Allocated memory is still 113.2 MB. Free memory was 89.9 MB in the beginning and 89.1 MB in the end (delta: 807.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.89 ms. Allocated memory is still 113.2 MB. Free memory was 89.1 MB in the beginning and 87.8 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 467.29 ms. Allocated memory is still 113.2 MB. Free memory was 87.8 MB in the beginning and 72.5 MB in the end (delta: 15.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 73215.98 ms. Allocated memory was 113.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 71.7 MB in the beginning and 516.6 MB in the end (delta: -444.9 MB). Peak memory consumption was 756.4 MB. Max. memory is 16.1 GB. * Witness Printer took 44.81 ms. Allocated memory is still 1.3 GB. Free memory was 516.6 MB in the beginning and 513.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: x <= 9 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 71.3s, OverallIterations: 15, TraceHistogramMax: 109, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 426 SDtfs, 2062 SDslu, 2091 SDs, 0 SdLazy, 3408 SolverSat, 666 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4824 GetRequests, 4461 SyntacticMatches, 9 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4072 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 150 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 383 PreInvPairs, 403 NumberOfFragments, 139 HoareAnnotationTreeSize, 383 FomulaSimplifications, 282 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 5 FomulaSimplificationsInter, 963 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 58.4s InterpolantComputationTime, 4413 NumberOfCodeBlocks, 4269 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 6538 ConstructedInterpolants, 0 QuantifiedInterpolants, 10417766 SizeOfPredicates, 29 NumberOfNonLiveVariables, 4070 ConjunctsInSsa, 402 ConjunctsInUnsatCore, 37 InterpolantComputations, 6 PerfectInterpolantSequences, 119636/149987 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...