./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b225e80ee922ecd6d28f97f9a97339f737a7de4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.23-635dfa2 [2018-12-02 06:55:49,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:55:49,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:55:49,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:55:49,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:55:49,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:55:49,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:55:49,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:55:49,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:55:49,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:55:49,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:55:49,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:55:49,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:55:49,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:55:49,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:55:49,590 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:55:49,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:55:49,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:55:49,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:55:49,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:55:49,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:55:49,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:55:49,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:55:49,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:55:49,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:55:49,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:55:49,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:55:49,597 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:55:49,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:55:49,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:55:49,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:55:49,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:55:49,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:55:49,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:55:49,599 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:55:49,600 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:55:49,600 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 06:55:49,607 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:55:49,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:55:49,608 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 06:55:49,608 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 06:55:49,608 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:55:49,608 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:55:49,609 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 06:55:49,609 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:55:49,609 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:55:49,609 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:55:49,609 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:55:49,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:55:49,609 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 06:55:49,609 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 06:55:49,609 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 06:55:49,610 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:55:49,610 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:55:49,610 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 06:55:49,610 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 06:55:49,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:55:49,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:55:49,610 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 06:55:49,610 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 06:55:49,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:55:49,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:55:49,611 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 06:55:49,611 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 06:55:49,611 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 06:55:49,611 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 06:55:49,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 06:55:49,611 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 7b225e80ee922ecd6d28f97f9a97339f737a7de4 [2018-12-02 06:55:49,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:55:49,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:55:49,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:55:49,642 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:55:49,643 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:55:49,643 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-12-02 06:55:49,682 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/data/40420ebea/2b352b77b8904437a762c031e3d626e4/FLAG31817b27b [2018-12-02 06:55:50,058 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:55:50,059 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-12-02 06:55:50,062 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/data/40420ebea/2b352b77b8904437a762c031e3d626e4/FLAG31817b27b [2018-12-02 06:55:50,070 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/data/40420ebea/2b352b77b8904437a762c031e3d626e4 [2018-12-02 06:55:50,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:55:50,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:55:50,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:55:50,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:55:50,075 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:55:50,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3163dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50, skipping insertion in model container [2018-12-02 06:55:50,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:55:50,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:55:50,172 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:55:50,175 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:55:50,184 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:55:50,191 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:55:50,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50 WrapperNode [2018-12-02 06:55:50,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:55:50,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:55:50,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:55:50,192 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:55:50,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:55:50,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:55:50,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:55:50,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:55:50,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (1/1) ... [2018-12-02 06:55:50,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:55:50,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:55:50,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:55:50,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:55:50,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/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 [2018-12-02 06:55:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 06:55:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 06:55:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:55:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:55:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 06:55:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 06:55:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-02 06:55:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-02 06:55:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-02 06:55:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-02 06:55:50,384 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:55:50,384 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 06:55:50,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:55:50 BoogieIcfgContainer [2018-12-02 06:55:50,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:55:50,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 06:55:50,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 06:55:50,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 06:55:50,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:55:50" (1/3) ... [2018-12-02 06:55:50,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb89205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:55:50, skipping insertion in model container [2018-12-02 06:55:50,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:55:50" (2/3) ... [2018-12-02 06:55:50,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb89205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:55:50, skipping insertion in model container [2018-12-02 06:55:50,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:55:50" (3/3) ... [2018-12-02 06:55:50,390 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10_false-unreach-call.c [2018-12-02 06:55:50,396 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 06:55:50,401 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 06:55:50,411 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 06:55:50,430 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 06:55:50,431 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 06:55:50,431 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 06:55:50,431 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 06:55:50,431 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:55:50,431 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:55:50,431 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 06:55:50,431 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:55:50,431 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 06:55:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-02 06:55:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 06:55:50,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:50,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:50,450 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:50,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:50,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-02 06:55:50,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:50,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:50,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:50,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:50,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:50,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:55:50,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:55:50,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:55:50,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:55:50,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:55:50,573 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-02 06:55:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:50,633 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-02 06:55:50,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:55:50,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 06:55:50,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:50,642 INFO L225 Difference]: With dead ends: 44 [2018-12-02 06:55:50,642 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 06:55:50,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:55:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 06:55:50,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 06:55:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 06:55:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-02 06:55:50,675 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-02 06:55:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:50,675 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-02 06:55:50,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:55:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-02 06:55:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 06:55:50,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:50,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:50,677 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:50,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-02 06:55:50,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:50,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:50,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:50,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:50,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:55:50,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:55:50,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:55:50,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:55:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:55:50,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:55:50,707 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-02 06:55:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:50,742 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-02 06:55:50,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:55:50,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 06:55:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:50,743 INFO L225 Difference]: With dead ends: 36 [2018-12-02 06:55:50,743 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 06:55:50,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:55:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 06:55:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-02 06:55:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 06:55:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-02 06:55:50,748 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-02 06:55:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:50,748 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-02 06:55:50,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:55:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-02 06:55:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 06:55:50,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:50,749 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:50,749 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:50,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:50,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-02 06:55:50,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:50,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:50,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:50,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 06:55:50,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:50,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:50,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:50,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 06:55:50,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:50,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-02 06:55:50,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:55:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:55:50,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:55:50,878 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-12-02 06:55:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:50,970 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-12-02 06:55:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:55:50,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-02 06:55:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:50,971 INFO L225 Difference]: With dead ends: 58 [2018-12-02 06:55:50,971 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 06:55:50,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:55:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 06:55:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-02 06:55:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 06:55:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-12-02 06:55:50,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-12-02 06:55:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:50,979 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-12-02 06:55:50,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:55:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-12-02 06:55:50,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 06:55:50,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:50,980 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:50,981 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:50,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:50,981 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-12-02 06:55:50,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:50,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:50,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 06:55:51,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:51,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:51,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:51,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 06:55:51,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:51,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 06:55:51,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:55:51,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:55:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:55:51,073 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-12-02 06:55:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:51,128 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-12-02 06:55:51,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:55:51,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-02 06:55:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:51,129 INFO L225 Difference]: With dead ends: 43 [2018-12-02 06:55:51,129 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 06:55:51,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:55:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 06:55:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-12-02 06:55:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 06:55:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-12-02 06:55:51,134 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-12-02 06:55:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:51,134 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-02 06:55:51,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:55:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-12-02 06:55:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 06:55:51,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:51,135 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:51,135 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:51,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-02 06:55:51,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:51,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:51,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:51,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 06:55:51,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:51,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:51,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:51,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 06:55:51,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:51,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-12-02 06:55:51,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:55:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:55:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:55:51,261 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-12-02 06:55:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:51,393 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-12-02 06:55:51,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:55:51,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-02 06:55:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:51,394 INFO L225 Difference]: With dead ends: 70 [2018-12-02 06:55:51,394 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 06:55:51,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-02 06:55:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 06:55:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-02 06:55:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 06:55:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-02 06:55:51,399 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-12-02 06:55:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:51,400 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-02 06:55:51,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:55:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-12-02 06:55:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 06:55:51,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:51,400 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:51,401 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:51,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-12-02 06:55:51,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:51,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:51,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 06:55:51,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:51,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:51,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:51,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 06:55:51,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:51,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-02 06:55:51,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:55:51,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:55:51,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:55:51,499 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-12-02 06:55:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:51,590 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-12-02 06:55:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:55:51,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-12-02 06:55:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:51,591 INFO L225 Difference]: With dead ends: 61 [2018-12-02 06:55:51,591 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 06:55:51,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-02 06:55:51,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 06:55:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-12-02 06:55:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 06:55:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-12-02 06:55:51,598 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-12-02 06:55:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:51,598 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-12-02 06:55:51,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:55:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-12-02 06:55:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 06:55:51,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:51,599 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:51,599 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:51,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-12-02 06:55:51,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:51,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:51,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 06:55:51,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:51,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:51,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:51,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 06:55:51,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:51,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-12-02 06:55:51,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:55:51,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:55:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:55:51,712 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-12-02 06:55:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:51,820 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-12-02 06:55:51,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:55:51,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-12-02 06:55:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:51,821 INFO L225 Difference]: With dead ends: 71 [2018-12-02 06:55:51,821 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 06:55:51,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-02 06:55:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 06:55:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-12-02 06:55:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 06:55:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-12-02 06:55:51,829 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-12-02 06:55:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:51,829 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-12-02 06:55:51,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:55:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-12-02 06:55:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 06:55:51,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:51,831 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:51,831 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:51,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-12-02 06:55:51,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:51,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:51,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-02 06:55:51,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:51,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:51,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 06:55:51,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 06:55:51,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:51,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-02 06:55:52,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:52,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-02 06:55:52,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 06:55:52,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 06:55:52,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 06:55:52,023 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-12-02 06:55:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:52,328 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-12-02 06:55:52,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 06:55:52,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-12-02 06:55:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:52,330 INFO L225 Difference]: With dead ends: 146 [2018-12-02 06:55:52,330 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 06:55:52,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-12-02 06:55:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 06:55:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-12-02 06:55:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 06:55:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-12-02 06:55:52,340 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-12-02 06:55:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:52,341 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-12-02 06:55:52,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 06:55:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-12-02 06:55:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-02 06:55:52,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:52,342 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:52,343 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:52,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2059253460, now seen corresponding path program 1 times [2018-12-02 06:55:52,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:52,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:52,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 66 proven. 113 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-12-02 06:55:52,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:52,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:52,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:52,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 29 proven. 176 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-12-02 06:55:52,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:52,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-12-02 06:55:52,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 06:55:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 06:55:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-02 06:55:52,561 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-12-02 06:55:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:53,005 INFO L93 Difference]: Finished difference Result 232 states and 520 transitions. [2018-12-02 06:55:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 06:55:53,005 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2018-12-02 06:55:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:53,007 INFO L225 Difference]: With dead ends: 232 [2018-12-02 06:55:53,007 INFO L226 Difference]: Without dead ends: 129 [2018-12-02 06:55:53,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 06:55:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-02 06:55:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-12-02 06:55:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-02 06:55:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2018-12-02 06:55:53,026 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 135 [2018-12-02 06:55:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:53,026 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-12-02 06:55:53,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 06:55:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2018-12-02 06:55:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-12-02 06:55:53,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:53,031 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 18, 18, 18, 16, 14, 14, 14, 14, 14, 14, 14, 13, 9, 9, 9, 9, 9, 9, 9, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:53,031 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:53,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2064464880, now seen corresponding path program 1 times [2018-12-02 06:55:53,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:53,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:53,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3017 backedges. 151 proven. 445 refuted. 0 times theorem prover too weak. 2421 trivial. 0 not checked. [2018-12-02 06:55:53,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:53,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:53,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:53,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3017 backedges. 105 proven. 663 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2018-12-02 06:55:53,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:53,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2018-12-02 06:55:53,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 06:55:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 06:55:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-12-02 06:55:53,400 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 18 states. [2018-12-02 06:55:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:53,845 INFO L93 Difference]: Finished difference Result 290 states and 587 transitions. [2018-12-02 06:55:53,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 06:55:53,845 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 323 [2018-12-02 06:55:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:53,848 INFO L225 Difference]: With dead ends: 290 [2018-12-02 06:55:53,848 INFO L226 Difference]: Without dead ends: 179 [2018-12-02 06:55:53,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 06:55:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-02 06:55:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2018-12-02 06:55:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-02 06:55:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 252 transitions. [2018-12-02 06:55:53,865 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 252 transitions. Word has length 323 [2018-12-02 06:55:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:53,866 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 252 transitions. [2018-12-02 06:55:53,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 06:55:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 252 transitions. [2018-12-02 06:55:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-12-02 06:55:53,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:53,875 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 30, 30, 29, 26, 18, 18, 18, 18, 18, 18, 18, 15, 15, 15, 15, 15, 15, 15, 14, 8, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:53,875 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:53,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1400582904, now seen corresponding path program 2 times [2018-12-02 06:55:53,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:53,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:53,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:55:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6167 backedges. 346 proven. 540 refuted. 0 times theorem prover too weak. 5281 trivial. 0 not checked. [2018-12-02 06:55:54,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:54,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:54,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 06:55:54,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 06:55:54,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:54,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6167 backedges. 187 proven. 1116 refuted. 0 times theorem prover too weak. 4864 trivial. 0 not checked. [2018-12-02 06:55:54,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:54,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2018-12-02 06:55:54,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 06:55:54,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 06:55:54,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-12-02 06:55:54,346 INFO L87 Difference]: Start difference. First operand 154 states and 252 transitions. Second operand 21 states. [2018-12-02 06:55:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:54,905 INFO L93 Difference]: Finished difference Result 324 states and 658 transitions. [2018-12-02 06:55:54,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 06:55:54,906 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 464 [2018-12-02 06:55:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:54,907 INFO L225 Difference]: With dead ends: 324 [2018-12-02 06:55:54,907 INFO L226 Difference]: Without dead ends: 182 [2018-12-02 06:55:54,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=1812, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 06:55:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-02 06:55:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 157. [2018-12-02 06:55:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-02 06:55:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 272 transitions. [2018-12-02 06:55:54,918 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 272 transitions. Word has length 464 [2018-12-02 06:55:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:54,919 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 272 transitions. [2018-12-02 06:55:54,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 06:55:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2018-12-02 06:55:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-12-02 06:55:54,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:54,922 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 37, 34, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 15, 12, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:54,922 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:54,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:54,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1384039073, now seen corresponding path program 3 times [2018-12-02 06:55:54,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:54,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:54,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:54,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:54,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10819 backedges. 358 proven. 1439 refuted. 0 times theorem prover too weak. 9022 trivial. 0 not checked. [2018-12-02 06:55:55,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:55,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:55,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 06:55:55,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-02 06:55:55,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:55,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10819 backedges. 2588 proven. 100 refuted. 0 times theorem prover too weak. 8131 trivial. 0 not checked. [2018-12-02 06:55:55,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:55,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2018-12-02 06:55:55,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 06:55:55,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 06:55:55,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-12-02 06:55:55,408 INFO L87 Difference]: Start difference. First operand 157 states and 272 transitions. Second operand 21 states. [2018-12-02 06:55:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:55,906 INFO L93 Difference]: Finished difference Result 396 states and 825 transitions. [2018-12-02 06:55:55,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 06:55:55,906 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 612 [2018-12-02 06:55:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:55,908 INFO L225 Difference]: With dead ends: 396 [2018-12-02 06:55:55,909 INFO L226 Difference]: Without dead ends: 233 [2018-12-02 06:55:55,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 06:55:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-02 06:55:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 217. [2018-12-02 06:55:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-02 06:55:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 364 transitions. [2018-12-02 06:55:55,928 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 364 transitions. Word has length 612 [2018-12-02 06:55:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:55,929 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 364 transitions. [2018-12-02 06:55:55,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 06:55:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 364 transitions. [2018-12-02 06:55:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1257 [2018-12-02 06:55:55,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:55,939 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 90, 90, 76, 75, 46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 30, 30, 18, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:55,939 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:55,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:55,940 INFO L82 PathProgramCache]: Analyzing trace with hash 563423934, now seen corresponding path program 4 times [2018-12-02 06:55:55,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:55,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:55,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 46857 backedges. 639 proven. 3045 refuted. 0 times theorem prover too weak. 43173 trivial. 0 not checked. [2018-12-02 06:55:56,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:56,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:56,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 06:55:56,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 06:55:56,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:56,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 46857 backedges. 541 proven. 3845 refuted. 0 times theorem prover too weak. 42471 trivial. 0 not checked. [2018-12-02 06:55:57,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:57,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-12-02 06:55:57,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 06:55:57,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 06:55:57,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-12-02 06:55:57,242 INFO L87 Difference]: Start difference. First operand 217 states and 364 transitions. Second operand 22 states. [2018-12-02 06:55:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:57,807 INFO L93 Difference]: Finished difference Result 494 states and 994 transitions. [2018-12-02 06:55:57,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-02 06:55:57,807 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1256 [2018-12-02 06:55:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:57,809 INFO L225 Difference]: With dead ends: 494 [2018-12-02 06:55:57,809 INFO L226 Difference]: Without dead ends: 268 [2018-12-02 06:55:57,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1248 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=393, Invalid=1959, Unknown=0, NotChecked=0, Total=2352 [2018-12-02 06:55:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-02 06:55:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 239. [2018-12-02 06:55:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-12-02 06:55:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 416 transitions. [2018-12-02 06:55:57,821 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 416 transitions. Word has length 1256 [2018-12-02 06:55:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:57,822 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 416 transitions. [2018-12-02 06:55:57,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 06:55:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 416 transitions. [2018-12-02 06:55:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1185 [2018-12-02 06:55:57,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:57,828 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 83, 83, 70, 69, 45, 45, 45, 45, 45, 45, 45, 41, 41, 41, 41, 41, 41, 41, 28, 25, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:57,828 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:57,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:57,829 INFO L82 PathProgramCache]: Analyzing trace with hash 582987293, now seen corresponding path program 5 times [2018-12-02 06:55:57,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:57,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:57,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:57,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:57,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 41633 backedges. 740 proven. 3195 refuted. 0 times theorem prover too weak. 37698 trivial. 0 not checked. [2018-12-02 06:55:58,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:58,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:58,367 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 06:55:58,428 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-12-02 06:55:58,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:58,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:55:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 41633 backedges. 13701 proven. 49 refuted. 0 times theorem prover too weak. 27883 trivial. 0 not checked. [2018-12-02 06:55:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:55:58,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 16 [2018-12-02 06:55:58,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 06:55:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 06:55:58,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 06:55:58,825 INFO L87 Difference]: Start difference. First operand 239 states and 416 transitions. Second operand 16 states. [2018-12-02 06:55:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:55:59,084 INFO L93 Difference]: Finished difference Result 461 states and 846 transitions. [2018-12-02 06:55:59,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 06:55:59,085 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1184 [2018-12-02 06:55:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:55:59,087 INFO L225 Difference]: With dead ends: 461 [2018-12-02 06:55:59,087 INFO L226 Difference]: Without dead ends: 232 [2018-12-02 06:55:59,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1209 GetRequests, 1184 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-12-02 06:55:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-12-02 06:55:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-12-02 06:55:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 06:55:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 387 transitions. [2018-12-02 06:55:59,100 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 387 transitions. Word has length 1184 [2018-12-02 06:55:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:55:59,100 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 387 transitions. [2018-12-02 06:55:59,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 06:55:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 387 transitions. [2018-12-02 06:55:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1255 [2018-12-02 06:55:59,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:55:59,112 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 89, 89, 76, 73, 47, 47, 47, 47, 47, 47, 47, 44, 44, 44, 44, 44, 44, 44, 32, 26, 18, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:55:59,112 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:55:59,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:55:59,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1211297702, now seen corresponding path program 6 times [2018-12-02 06:55:59,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:55:59,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:55:59,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:59,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:55:59,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:55:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:55:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 46734 backedges. 2723 proven. 1817 refuted. 0 times theorem prover too weak. 42194 trivial. 0 not checked. [2018-12-02 06:55:59,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:55:59,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:55:59,681 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 06:55:59,772 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-12-02 06:55:59,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:55:59,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:56:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 46734 backedges. 7335 proven. 63 refuted. 0 times theorem prover too weak. 39336 trivial. 0 not checked. [2018-12-02 06:56:00,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:56:00,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 24 [2018-12-02 06:56:00,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 06:56:00,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 06:56:00,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-12-02 06:56:00,248 INFO L87 Difference]: Start difference. First operand 232 states and 387 transitions. Second operand 24 states. [2018-12-02 06:56:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:56:00,745 INFO L93 Difference]: Finished difference Result 527 states and 990 transitions. [2018-12-02 06:56:00,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 06:56:00,745 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1254 [2018-12-02 06:56:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:56:00,747 INFO L225 Difference]: With dead ends: 527 [2018-12-02 06:56:00,748 INFO L226 Difference]: Without dead ends: 296 [2018-12-02 06:56:00,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1294 GetRequests, 1254 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 06:56:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-02 06:56:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2018-12-02 06:56:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-02 06:56:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 426 transitions. [2018-12-02 06:56:00,760 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 426 transitions. Word has length 1254 [2018-12-02 06:56:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:56:00,760 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 426 transitions. [2018-12-02 06:56:00,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 06:56:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 426 transitions. [2018-12-02 06:56:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2018-12-02 06:56:00,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:56:00,765 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 59, 57, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 23, 22, 15, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:56:00,765 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:56:00,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:56:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1782520000, now seen corresponding path program 7 times [2018-12-02 06:56:00,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:56:00,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:56:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:00,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:56:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:56:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 28371 backedges. 693 proven. 3058 refuted. 0 times theorem prover too weak. 24620 trivial. 0 not checked. [2018-12-02 06:56:01,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:56:01,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:56:01,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:56:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:56:01,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:56:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 28371 backedges. 624 proven. 2375 refuted. 0 times theorem prover too weak. 25372 trivial. 0 not checked. [2018-12-02 06:56:01,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:56:01,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 23 [2018-12-02 06:56:01,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 06:56:01,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 06:56:01,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-12-02 06:56:01,659 INFO L87 Difference]: Start difference. First operand 266 states and 426 transitions. Second operand 23 states. [2018-12-02 06:56:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:56:02,304 INFO L93 Difference]: Finished difference Result 579 states and 989 transitions. [2018-12-02 06:56:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-02 06:56:02,304 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 981 [2018-12-02 06:56:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:56:02,308 INFO L225 Difference]: With dead ends: 579 [2018-12-02 06:56:02,308 INFO L226 Difference]: Without dead ends: 319 [2018-12-02 06:56:02,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1030 GetRequests, 978 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=425, Invalid=2437, Unknown=0, NotChecked=0, Total=2862 [2018-12-02 06:56:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-02 06:56:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 277. [2018-12-02 06:56:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-02 06:56:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 442 transitions. [2018-12-02 06:56:02,330 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 442 transitions. Word has length 981 [2018-12-02 06:56:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:56:02,330 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 442 transitions. [2018-12-02 06:56:02,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 06:56:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 442 transitions. [2018-12-02 06:56:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-12-02 06:56:02,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:56:02,339 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 76, 76, 63, 62, 39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 24, 24, 17, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:56:02,339 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:56:02,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:56:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1936823548, now seen corresponding path program 8 times [2018-12-02 06:56:02,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:56:02,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:56:02,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:02,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:56:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:56:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 33344 backedges. 2044 proven. 813 refuted. 0 times theorem prover too weak. 30487 trivial. 0 not checked. [2018-12-02 06:56:02,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:56:02,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:56:02,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 06:56:02,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 06:56:02,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:56:02,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:56:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 33344 backedges. 1026 proven. 2777 refuted. 0 times theorem prover too weak. 29541 trivial. 0 not checked. [2018-12-02 06:56:03,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:56:03,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-12-02 06:56:03,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 06:56:03,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 06:56:03,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-12-02 06:56:03,312 INFO L87 Difference]: Start difference. First operand 277 states and 442 transitions. Second operand 25 states. [2018-12-02 06:56:04,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:56:04,264 INFO L93 Difference]: Finished difference Result 724 states and 1441 transitions. [2018-12-02 06:56:04,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-02 06:56:04,265 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1062 [2018-12-02 06:56:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:56:04,267 INFO L225 Difference]: With dead ends: 724 [2018-12-02 06:56:04,267 INFO L226 Difference]: Without dead ends: 320 [2018-12-02 06:56:04,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 1055 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=450, Invalid=3090, Unknown=0, NotChecked=0, Total=3540 [2018-12-02 06:56:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-02 06:56:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 291. [2018-12-02 06:56:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 06:56:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 416 transitions. [2018-12-02 06:56:04,282 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 416 transitions. Word has length 1062 [2018-12-02 06:56:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:56:04,283 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 416 transitions. [2018-12-02 06:56:04,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 06:56:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 416 transitions. [2018-12-02 06:56:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1635 [2018-12-02 06:56:04,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:56:04,293 INFO L402 BasicCegarLoop]: trace histogram [122, 122, 117, 117, 98, 95, 61, 61, 61, 61, 61, 61, 61, 58, 58, 58, 58, 58, 58, 58, 40, 34, 24, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:56:04,294 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:56:04,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:56:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash -858441778, now seen corresponding path program 9 times [2018-12-02 06:56:04,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:56:04,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:56:04,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:04,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:56:04,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:56:05,076 INFO L134 CoverageAnalysis]: Checked inductivity of 79818 backedges. 5004 proven. 1223 refuted. 0 times theorem prover too weak. 73591 trivial. 0 not checked. [2018-12-02 06:56:05,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:56:05,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:56:05,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 06:56:05,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-02 06:56:05,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:56:05,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:56:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 79818 backedges. 5092 proven. 146 refuted. 0 times theorem prover too weak. 74580 trivial. 0 not checked. [2018-12-02 06:56:05,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:56:05,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 21 [2018-12-02 06:56:05,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 06:56:05,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 06:56:05,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-02 06:56:05,852 INFO L87 Difference]: Start difference. First operand 291 states and 416 transitions. Second operand 21 states. [2018-12-02 06:56:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:56:06,247 INFO L93 Difference]: Finished difference Result 579 states and 848 transitions. [2018-12-02 06:56:06,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 06:56:06,247 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1634 [2018-12-02 06:56:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:56:06,251 INFO L225 Difference]: With dead ends: 579 [2018-12-02 06:56:06,251 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 06:56:06,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1673 GetRequests, 1635 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 06:56:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 06:56:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 309. [2018-12-02 06:56:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-12-02 06:56:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 432 transitions. [2018-12-02 06:56:06,272 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 432 transitions. Word has length 1634 [2018-12-02 06:56:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:56:06,274 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 432 transitions. [2018-12-02 06:56:06,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 06:56:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 432 transitions. [2018-12-02 06:56:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1404 [2018-12-02 06:56:06,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:56:06,285 INFO L402 BasicCegarLoop]: trace histogram [106, 106, 99, 99, 84, 82, 53, 53, 53, 53, 53, 53, 53, 49, 49, 49, 49, 49, 49, 49, 35, 29, 22, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:56:06,286 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:56:06,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:56:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1840423821, now seen corresponding path program 10 times [2018-12-02 06:56:06,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:56:06,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:56:06,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:06,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:56:06,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:56:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 58687 backedges. 1874 proven. 3762 refuted. 0 times theorem prover too weak. 53051 trivial. 0 not checked. [2018-12-02 06:56:06,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:56:06,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:56:06,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 06:56:07,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 06:56:07,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:56:07,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:56:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 58687 backedges. 1489 proven. 3077 refuted. 0 times theorem prover too weak. 54121 trivial. 0 not checked. [2018-12-02 06:56:07,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:56:07,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 24 [2018-12-02 06:56:07,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 06:56:07,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 06:56:07,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-12-02 06:56:07,689 INFO L87 Difference]: Start difference. First operand 309 states and 432 transitions. Second operand 24 states. [2018-12-02 06:56:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:56:08,210 INFO L93 Difference]: Finished difference Result 664 states and 962 transitions. [2018-12-02 06:56:08,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 06:56:08,210 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1403 [2018-12-02 06:56:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:56:08,212 INFO L225 Difference]: With dead ends: 664 [2018-12-02 06:56:08,213 INFO L226 Difference]: Without dead ends: 312 [2018-12-02 06:56:08,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1447 GetRequests, 1400 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=1929, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 06:56:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-02 06:56:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 293. [2018-12-02 06:56:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-12-02 06:56:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 389 transitions. [2018-12-02 06:56:08,234 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 389 transitions. Word has length 1403 [2018-12-02 06:56:08,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:56:08,234 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 389 transitions. [2018-12-02 06:56:08,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 06:56:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 389 transitions. [2018-12-02 06:56:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2018-12-02 06:56:08,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:56:08,243 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 95, 95, 78, 78, 49, 49, 49, 49, 49, 49, 49, 47, 47, 47, 47, 47, 47, 47, 31, 29, 20, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:56:08,244 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:56:08,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:56:08,244 INFO L82 PathProgramCache]: Analyzing trace with hash 190824083, now seen corresponding path program 11 times [2018-12-02 06:56:08,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:56:08,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:56:08,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:08,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:56:08,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:56:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 51906 backedges. 4880 proven. 821 refuted. 0 times theorem prover too weak. 46205 trivial. 0 not checked. [2018-12-02 06:56:08,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:56:08,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:56:08,899 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 06:56:09,238 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) [2018-12-02 06:56:09,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:56:09,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:56:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 51906 backedges. 24470 proven. 2751 refuted. 0 times theorem prover too weak. 24685 trivial. 0 not checked. [2018-12-02 06:56:09,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:56:09,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 33 [2018-12-02 06:56:09,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 06:56:09,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 06:56:09,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 06:56:09,800 INFO L87 Difference]: Start difference. First operand 293 states and 389 transitions. Second operand 33 states. [2018-12-02 06:56:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:56:10,876 INFO L93 Difference]: Finished difference Result 617 states and 845 transitions. [2018-12-02 06:56:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-02 06:56:10,876 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1321 [2018-12-02 06:56:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:56:10,878 INFO L225 Difference]: With dead ends: 617 [2018-12-02 06:56:10,878 INFO L226 Difference]: Without dead ends: 323 [2018-12-02 06:56:10,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1398 GetRequests, 1314 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=828, Invalid=6482, Unknown=0, NotChecked=0, Total=7310 [2018-12-02 06:56:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-02 06:56:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 243. [2018-12-02 06:56:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-02 06:56:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2018-12-02 06:56:10,889 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 1321 [2018-12-02 06:56:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:56:10,890 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2018-12-02 06:56:10,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 06:56:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2018-12-02 06:56:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-12-02 06:56:10,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:56:10,895 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 65, 65, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 25, 25, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:56:10,895 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:56:10,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:56:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1604839333, now seen corresponding path program 12 times [2018-12-02 06:56:10,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:56:10,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:56:10,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:10,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:56:10,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:56:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36000 backedges. 1478 proven. 4114 refuted. 0 times theorem prover too weak. 30408 trivial. 0 not checked. [2018-12-02 06:56:11,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:56:11,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:56:11,428 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 06:56:11,647 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2018-12-02 06:56:11,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:56:11,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:56:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 36000 backedges. 1332 proven. 1637 refuted. 0 times theorem prover too weak. 33031 trivial. 0 not checked. [2018-12-02 06:56:11,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:56:11,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12] total 25 [2018-12-02 06:56:11,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 06:56:11,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 06:56:11,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-12-02 06:56:11,988 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 25 states. [2018-12-02 06:56:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:56:12,743 INFO L93 Difference]: Finished difference Result 452 states and 535 transitions. [2018-12-02 06:56:12,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-02 06:56:12,743 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1103 [2018-12-02 06:56:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:56:12,744 INFO L225 Difference]: With dead ends: 452 [2018-12-02 06:56:12,744 INFO L226 Difference]: Without dead ends: 284 [2018-12-02 06:56:12,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1174 GetRequests, 1108 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=613, Invalid=3943, Unknown=0, NotChecked=0, Total=4556 [2018-12-02 06:56:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-02 06:56:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 243. [2018-12-02 06:56:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-02 06:56:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 284 transitions. [2018-12-02 06:56:12,754 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 284 transitions. Word has length 1103 [2018-12-02 06:56:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:56:12,755 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 284 transitions. [2018-12-02 06:56:12,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 06:56:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 284 transitions. [2018-12-02 06:56:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-12-02 06:56:12,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:56:12,760 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:56:12,761 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:56:12,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:56:12,761 INFO L82 PathProgramCache]: Analyzing trace with hash 416823031, now seen corresponding path program 13 times [2018-12-02 06:56:12,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:56:12,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:56:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:12,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:56:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:56:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:56:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:56:12,864 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 06:56:12,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:56:12 BoogieIcfgContainer [2018-12-02 06:56:12,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 06:56:12,936 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:56:12,936 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:56:12,936 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:56:12,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:55:50" (3/4) ... [2018-12-02 06:56:12,938 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 06:56:13,028 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_041b37e9-00c3-460c-adaf-d4ed31a61879/bin-2019/uautomizer/witness.graphml [2018-12-02 06:56:13,028 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:56:13,028 INFO L168 Benchmark]: Toolchain (without parser) took 22956.36 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 962.4 MB in the beginning and 1.4 GB in the end (delta: -425.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-02 06:56:13,029 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:56:13,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 118.92 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:56:13,030 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.62 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:56:13,030 INFO L168 Benchmark]: Boogie Preprocessor took 10.70 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:56:13,030 INFO L168 Benchmark]: RCFGBuilder took 169.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 946.3 MB in the beginning and 1.2 GB in the end (delta: -206.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-02 06:56:13,030 INFO L168 Benchmark]: TraceAbstraction took 22550.21 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -234.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-02 06:56:13,030 INFO L168 Benchmark]: Witness Printer took 92.18 ms. Allocated memory is still 3.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:56:13,031 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 118.92 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.62 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.70 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 169.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 946.3 MB in the beginning and 1.2 GB in the end (delta: -206.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22550.21 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -234.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 92.18 ms. Allocated memory is still 3.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 10; VAL [x=10] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) 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 fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) 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 fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) 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 fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L37] int result = fibo1(x); [L38] COND TRUE result == 55 VAL [result=55, x=10] [L39] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 22.5s OverallTime, 22 OverallIterations, 122 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 815 SDtfs, 1908 SDslu, 6833 SDs, 0 SdLazy, 12569 SolverSat, 2220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13664 GetRequests, 12954 SyntacticMatches, 3 SemanticMatches, 707 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7923 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 409 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 27235 NumberOfCodeBlocks, 22827 NumberOfCodeBlocksAsserted, 232 NumberOfCheckSat, 25983 ConstructedInterpolants, 0 QuantifiedInterpolants, 33160907 SizeOfPredicates, 138 NumberOfNonLiveVariables, 18808 ConjunctsInSsa, 278 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 844691/888004 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...