./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2c28e4a28eb31322d66c263b5716511ec5353f2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:16:51,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:16:51,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:16:51,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:16:51,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:16:51,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:16:51,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:16:51,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:16:51,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:16:51,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:16:51,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:16:51,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:16:51,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:16:51,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:16:51,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:16:51,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:16:51,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:16:51,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:16:51,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:16:51,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:16:51,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:16:51,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:16:51,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:16:51,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:16:51,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:16:51,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:16:51,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:16:51,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:16:51,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:16:51,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:16:51,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:16:51,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:16:51,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:16:51,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:16:51,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:16:51,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:16:51,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:16:51,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:16:51,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:16:51,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:16:51,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:16:51,165 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:16:51,204 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:16:51,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:16:51,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:16:51,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:16:51,207 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:16:51,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:16:51,207 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:16:51,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:16:51,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:16:51,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:16:51,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:16:51,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:16:51,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:16:51,210 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:16:51,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:16:51,210 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:16:51,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:16:51,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:16:51,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:16:51,211 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:16:51,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:16:51,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:16:51,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:16:51,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:16:51,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:16:51,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:16:51,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:16:51,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:16:51,213 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:16:51,213 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/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_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b2c28e4a28eb31322d66c263b5716511ec5353f2 [2020-11-28 03:16:51,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:16:51,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:16:51,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:16:51,526 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:16:51,531 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:16:51,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2020-11-28 03:16:51,604 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/data/3caf55268/f7f2ace3c14f4266be17ec33afbd045f/FLAGcffb0a99d [2020-11-28 03:16:52,032 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:16:52,033 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2020-11-28 03:16:52,044 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/data/3caf55268/f7f2ace3c14f4266be17ec33afbd045f/FLAGcffb0a99d [2020-11-28 03:16:52,424 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/data/3caf55268/f7f2ace3c14f4266be17ec33afbd045f [2020-11-28 03:16:52,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:16:52,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:16:52,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:16:52,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:16:52,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:16:52,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc4734d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52, skipping insertion in model container [2020-11-28 03:16:52,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:16:52,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:16:52,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:16:52,685 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:16:52,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:16:52,727 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:16:52,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52 WrapperNode [2020-11-28 03:16:52,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:16:52,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:16:52,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:16:52,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:16:52,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:16:52,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:16:52,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:16:52,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:16:52,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:16:52,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:16:52,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:16:52,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:16:52,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/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-28 03:16:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:16:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:16:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:16:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:16:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-28 03:16:52,861 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-28 03:16:53,233 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:16:53,234 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-28 03:16:53,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:53 BoogieIcfgContainer [2020-11-28 03:16:53,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:16:53,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:16:53,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:16:53,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:16:53,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:16:52" (1/3) ... [2020-11-28 03:16:53,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3314830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:16:53, skipping insertion in model container [2020-11-28 03:16:53,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52" (2/3) ... [2020-11-28 03:16:53,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3314830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:16:53, skipping insertion in model container [2020-11-28 03:16:53,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:53" (3/3) ... [2020-11-28 03:16:53,247 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-11-28 03:16:53,261 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:16:53,265 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-28 03:16:53,276 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-28 03:16:53,310 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:16:53,311 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:16:53,311 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:16:53,311 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:16:53,311 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:16:53,312 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:16:53,312 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:16:53,312 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:16:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-11-28 03:16:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 03:16:53,336 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:16:53,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:53,338 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:16:53,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:53,350 INFO L82 PathProgramCache]: Analyzing trace with hash -730685886, now seen corresponding path program 1 times [2020-11-28 03:16:53,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:53,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456572362] [2020-11-28 03:16:53,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:53,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:16:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:53,649 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-28 03:16:53,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456572362] [2020-11-28 03:16:53,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:53,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:53,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388001289] [2020-11-28 03:16:53,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:16:53,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:53,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:16:53,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:16:53,678 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-11-28 03:16:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:53,767 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-11-28 03:16:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:16:53,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-28 03:16:53,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:16:53,786 INFO L225 Difference]: With dead ends: 35 [2020-11-28 03:16:53,791 INFO L226 Difference]: Without dead ends: 18 [2020-11-28 03:16:53,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:16:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-11-28 03:16:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-11-28 03:16:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-28 03:16:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-11-28 03:16:53,846 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-11-28 03:16:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:16:53,846 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-11-28 03:16:53,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:16:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-11-28 03:16:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:16:53,848 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:16:53,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:53,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:16:53,849 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:16:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:53,849 INFO L82 PathProgramCache]: Analyzing trace with hash -461623668, now seen corresponding path program 1 times [2020-11-28 03:16:53,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:53,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137975261] [2020-11-28 03:16:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:53,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:16:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:53,964 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-28 03:16:53,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137975261] [2020-11-28 03:16:53,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:53,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:53,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498686920] [2020-11-28 03:16:53,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:16:53,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:53,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:16:53,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:16:53,968 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-11-28 03:16:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:53,997 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-11-28 03:16:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:16:53,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-28 03:16:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:16:54,000 INFO L225 Difference]: With dead ends: 24 [2020-11-28 03:16:54,000 INFO L226 Difference]: Without dead ends: 20 [2020-11-28 03:16:54,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:16:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-28 03:16:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-11-28 03:16:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-28 03:16:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-11-28 03:16:54,010 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-11-28 03:16:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:16:54,011 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-11-28 03:16:54,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:16:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-11-28 03:16:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 03:16:54,015 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:16:54,016 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:54,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:16:54,016 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:16:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:54,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1253239047, now seen corresponding path program 1 times [2020-11-28 03:16:54,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:54,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593786427] [2020-11-28 03:16:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:16:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-28 03:16:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 03:16:54,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593786427] [2020-11-28 03:16:54,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193184037] [2020-11-28 03:16:54,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/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-28 03:16:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 03:16:54,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:16:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 03:16:54,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:16:54,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-11-28 03:16:54,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74284112] [2020-11-28 03:16:54,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 03:16:54,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:54,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 03:16:54,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:16:54,412 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-11-28 03:16:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:54,606 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-11-28 03:16:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:16:54,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-11-28 03:16:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:16:54,608 INFO L225 Difference]: With dead ends: 35 [2020-11-28 03:16:54,608 INFO L226 Difference]: Without dead ends: 20 [2020-11-28 03:16:54,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-28 03:16:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-28 03:16:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-11-28 03:16:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-28 03:16:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-11-28 03:16:54,619 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-11-28 03:16:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:16:54,620 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-11-28 03:16:54,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 03:16:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-11-28 03:16:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 03:16:54,625 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:16:54,625 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:54,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-28 03:16:54,839 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:16:54,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1685451365, now seen corresponding path program 1 times [2020-11-28 03:16:54,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:54,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572955353] [2020-11-28 03:16:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:16:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:16:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-28 03:16:54,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572955353] [2020-11-28 03:16:54,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20879140] [2020-11-28 03:16:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/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-28 03:16:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 03:16:55,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:16:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-28 03:16:55,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:16:55,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-28 03:16:55,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148703873] [2020-11-28 03:16:55,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:16:55,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:55,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:16:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:16:55,102 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2020-11-28 03:16:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:55,220 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-11-28 03:16:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:16:55,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-28 03:16:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:16:55,223 INFO L225 Difference]: With dead ends: 38 [2020-11-28 03:16:55,223 INFO L226 Difference]: Without dead ends: 34 [2020-11-28 03:16:55,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:16:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-28 03:16:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-28 03:16:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-28 03:16:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-11-28 03:16:55,238 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-11-28 03:16:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:16:55,239 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-11-28 03:16:55,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:16:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-11-28 03:16:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-28 03:16:55,242 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:16:55,243 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:55,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:16:55,448 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:16:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:55,448 INFO L82 PathProgramCache]: Analyzing trace with hash 228714308, now seen corresponding path program 2 times [2020-11-28 03:16:55,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:55,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659459993] [2020-11-28 03:16:55,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:16:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:16:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:16:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-28 03:16:55,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659459993] [2020-11-28 03:16:55,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672640612] [2020-11-28 03:16:55,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/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-28 03:16:55,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 03:16:55,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:16:55,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-28 03:16:55,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:16:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-28 03:16:55,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:16:55,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-11-28 03:16:55,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131078822] [2020-11-28 03:16:55,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-28 03:16:55,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:55,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-28 03:16:55,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-28 03:16:55,852 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 12 states. [2020-11-28 03:16:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:56,301 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2020-11-28 03:16:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-28 03:16:56,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2020-11-28 03:16:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:16:56,304 INFO L225 Difference]: With dead ends: 69 [2020-11-28 03:16:56,304 INFO L226 Difference]: Without dead ends: 38 [2020-11-28 03:16:56,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-11-28 03:16:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-11-28 03:16:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-11-28 03:16:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-11-28 03:16:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-11-28 03:16:56,312 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2020-11-28 03:16:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:16:56,313 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-11-28 03:16:56,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-28 03:16:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-11-28 03:16:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-28 03:16:56,321 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:16:56,322 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:56,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:16:56,547 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:16:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:56,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1825869943, now seen corresponding path program 3 times [2020-11-28 03:16:56,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:56,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722391957] [2020-11-28 03:16:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:16:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:16:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:16:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:16:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:16:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:16:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-11-28 03:16:56,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722391957] [2020-11-28 03:16:56,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588990501] [2020-11-28 03:16:56,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/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-28 03:16:56,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-11-28 03:16:56,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:16:56,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-28 03:16:56,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:16:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2020-11-28 03:16:56,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:16:56,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-11-28 03:16:56,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329652205] [2020-11-28 03:16:56,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-28 03:16:56,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:56,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-28 03:16:56,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:16:56,950 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 10 states. [2020-11-28 03:16:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:57,184 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2020-11-28 03:16:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-28 03:16:57,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-28 03:16:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:16:57,189 INFO L225 Difference]: With dead ends: 94 [2020-11-28 03:16:57,189 INFO L226 Difference]: Without dead ends: 90 [2020-11-28 03:16:57,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-11-28 03:16:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-28 03:16:57,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2020-11-28 03:16:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-28 03:16:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2020-11-28 03:16:57,210 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 79 [2020-11-28 03:16:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:16:57,211 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2020-11-28 03:16:57,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-28 03:16:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2020-11-28 03:16:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-11-28 03:16:57,216 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:16:57,216 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:57,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:16:57,429 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:16:57,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash -793137460, now seen corresponding path program 4 times [2020-11-28 03:16:57,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:57,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075657495] [2020-11-28 03:16:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:16:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:16:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:16:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:16:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:16:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-28 03:16:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:16:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:16:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-28 03:16:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:57,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:16:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:16:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:16:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:16:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-28 03:16:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:16:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:16:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 422 proven. 660 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2020-11-28 03:16:58,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075657495] [2020-11-28 03:16:58,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579220147] [2020-11-28 03:16:58,261 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/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-28 03:16:58,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-28 03:16:58,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:16:58,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-28 03:16:58,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:16:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2020-11-28 03:16:58,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:16:58,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 17 [2020-11-28 03:16:58,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036064401] [2020-11-28 03:16:58,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-28 03:16:58,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:58,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-28 03:16:58,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-28 03:16:58,558 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand 17 states. [2020-11-28 03:16:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:59,408 INFO L93 Difference]: Finished difference Result 169 states and 322 transitions. [2020-11-28 03:16:59,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-28 03:16:59,409 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 201 [2020-11-28 03:16:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:16:59,412 INFO L225 Difference]: With dead ends: 169 [2020-11-28 03:16:59,412 INFO L226 Difference]: Without dead ends: 91 [2020-11-28 03:16:59,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2020-11-28 03:16:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-28 03:16:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2020-11-28 03:16:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-28 03:16:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2020-11-28 03:16:59,442 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 201 [2020-11-28 03:16:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:16:59,442 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2020-11-28 03:16:59,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-28 03:16:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2020-11-28 03:16:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-11-28 03:16:59,458 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:16:59,459 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:59,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-28 03:16:59,663 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:16:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 207835975, now seen corresponding path program 5 times [2020-11-28 03:16:59,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:59,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309355113] [2020-11-28 03:16:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:59,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:16:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:17:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:17:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:17:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:17:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-28 03:17:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:17:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:17:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-28 03:17:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:17:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:17:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:17:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:17:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-28 03:17:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:17:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:17:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:17:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:17:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-28 03:17:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:17:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:17:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-28 03:17:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:17:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:17:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:17:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:17:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:17:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 921 proven. 1713 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2020-11-28 03:17:00,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309355113] [2020-11-28 03:17:00,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552051762] [2020-11-28 03:17:00,989 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/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-28 03:17:01,200 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2020-11-28 03:17:01,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:17:01,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-28 03:17:01,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:17:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1321 proven. 1303 refuted. 0 times theorem prover too weak. 4496 trivial. 0 not checked. [2020-11-28 03:17:01,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:17:01,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 21 [2020-11-28 03:17:01,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549435563] [2020-11-28 03:17:01,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-28 03:17:01,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:01,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-28 03:17:01,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-11-28 03:17:01,495 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 21 states. [2020-11-28 03:17:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:02,566 INFO L93 Difference]: Finished difference Result 192 states and 332 transitions. [2020-11-28 03:17:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-28 03:17:02,566 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 351 [2020-11-28 03:17:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:02,570 INFO L225 Difference]: With dead ends: 192 [2020-11-28 03:17:02,570 INFO L226 Difference]: Without dead ends: 119 [2020-11-28 03:17:02,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 449 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=411, Invalid=1569, Unknown=0, NotChecked=0, Total=1980 [2020-11-28 03:17:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-28 03:17:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2020-11-28 03:17:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-28 03:17:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2020-11-28 03:17:02,607 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 351 [2020-11-28 03:17:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:02,611 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2020-11-28 03:17:02,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-28 03:17:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2020-11-28 03:17:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-11-28 03:17:02,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:02,620 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:17:02,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:17:02,847 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:02,847 INFO L82 PathProgramCache]: Analyzing trace with hash 196240028, now seen corresponding path program 6 times [2020-11-28 03:17:02,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:02,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446370516] [2020-11-28 03:17:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:17:02,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:17:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:17:02,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:17:03,055 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:17:03,055 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:17:03,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:17:03,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:17:03 BoogieIcfgContainer [2020-11-28 03:17:03,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:17:03,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:17:03,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:17:03,213 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:17:03,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:53" (3/4) ... [2020-11-28 03:17:03,215 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:17:03,370 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_01c5b562-b960-4a96-ada7-43a69a4c5657/bin/uautomizer/witness.graphml [2020-11-28 03:17:03,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:17:03,372 INFO L168 Benchmark]: Toolchain (without parser) took 10942.96 ms. Allocated memory was 92.3 MB in the beginning and 260.0 MB in the end (delta: 167.8 MB). Free memory was 61.9 MB in the beginning and 119.2 MB in the end (delta: -57.3 MB). Peak memory consumption was 108.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:03,372 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 92.3 MB. Free memory was 48.5 MB in the beginning and 48.5 MB in the end (delta: 34.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:17:03,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.33 ms. Allocated memory is still 92.3 MB. Free memory was 61.7 MB in the beginning and 70.9 MB in the end (delta: -9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:03,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.76 ms. Allocated memory is still 92.3 MB. Free memory was 70.9 MB in the beginning and 69.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:17:03,373 INFO L168 Benchmark]: Boogie Preprocessor took 18.01 ms. Allocated memory is still 92.3 MB. Free memory was 69.6 MB in the beginning and 68.8 MB in the end (delta: 802.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:03,374 INFO L168 Benchmark]: RCFGBuilder took 459.19 ms. Allocated memory is still 92.3 MB. Free memory was 68.4 MB in the beginning and 57.1 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:03,374 INFO L168 Benchmark]: TraceAbstraction took 9972.39 ms. Allocated memory was 92.3 MB in the beginning and 260.0 MB in the end (delta: 167.8 MB). Free memory was 56.7 MB in the beginning and 131.8 MB in the end (delta: -75.1 MB). Peak memory consumption was 94.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:03,374 INFO L168 Benchmark]: Witness Printer took 157.57 ms. Allocated memory is still 260.0 MB. Free memory was 131.8 MB in the beginning and 119.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:03,376 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.26 ms. Allocated memory is still 92.3 MB. Free memory was 48.5 MB in the beginning and 48.5 MB in the end (delta: 34.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 298.33 ms. Allocated memory is still 92.3 MB. Free memory was 61.7 MB in the beginning and 70.9 MB in the end (delta: -9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 29.76 ms. Allocated memory is still 92.3 MB. Free memory was 70.9 MB in the beginning and 69.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.01 ms. Allocated memory is still 92.3 MB. Free memory was 69.6 MB in the beginning and 68.8 MB in the end (delta: 802.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 459.19 ms. Allocated memory is still 92.3 MB. Free memory was 68.4 MB in the beginning and 57.1 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9972.39 ms. Allocated memory was 92.3 MB in the beginning and 260.0 MB in the end (delta: 167.8 MB). Free memory was 56.7 MB in the beginning and 131.8 MB in the end (delta: -75.1 MB). Peak memory consumption was 94.7 MB. Max. memory is 16.1 GB. * Witness Printer took 157.57 ms. Allocated memory is still 260.0 MB. Free memory was 131.8 MB in the beginning and 119.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 7; [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 13 [L4] __assert_fail("0", "fibo_7-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.7s, OverallIterations: 9, TraceHistogramMax: 51, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 166 SDtfs, 458 SDslu, 528 SDs, 0 SdLazy, 1081 SolverSat, 431 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1052 GetRequests, 919 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1734 NumberOfCodeBlocks, 1642 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1437 ConstructedInterpolants, 0 QuantifiedInterpolants, 520807 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1484 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 14921/19458 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 incorrect! Received shutdown request...