./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_10_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_10_false-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-0ed9222-m [2019-01-12 14:57:01,787 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:57:01,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:57:01,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:57:01,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:57:01,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:57:01,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:57:01,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:57:01,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:57:01,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:57:01,808 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:57:01,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:57:01,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:57:01,811 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:57:01,812 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:57:01,813 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:57:01,813 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:57:01,815 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:57:01,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:57:01,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:57:01,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:57:01,821 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:57:01,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:57:01,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:57:01,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:57:01,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:57:01,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:57:01,827 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:57:01,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:57:01,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:57:01,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:57:01,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:57:01,830 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:57:01,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:57:01,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:57:01,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:57:01,832 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:57:01,848 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:57:01,848 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:57:01,849 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:57:01,849 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:57:01,850 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:57:01,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:57:01,850 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:57:01,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:57:01,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:57:01,851 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:57:01,851 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:57:01,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:57:01,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:57:01,851 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:57:01,852 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:57:01,852 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:57:01,852 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:57:01,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:57:01,852 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:57:01,853 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:57:01,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:57:01,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:57:01,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:57:01,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:57:01,854 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:57:01,854 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:57:01,854 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:57:01,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:57:01,854 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-12 14:57:01,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:57:01,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:57:01,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:57:01,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:57:01,920 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:57:01,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2019-01-12 14:57:01,987 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a92304e5/df3873f4df6a4dabb5b2ecdaa0060c08/FLAG298182f02 [2019-01-12 14:57:02,443 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:57:02,444 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2019-01-12 14:57:02,451 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a92304e5/df3873f4df6a4dabb5b2ecdaa0060c08/FLAG298182f02 [2019-01-12 14:57:02,791 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a92304e5/df3873f4df6a4dabb5b2ecdaa0060c08 [2019-01-12 14:57:02,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:57:02,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:57:02,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:57:02,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:57:02,802 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:57:02,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:57:02" (1/1) ... [2019-01-12 14:57:02,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@389c3b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:02, skipping insertion in model container [2019-01-12 14:57:02,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:57:02" (1/1) ... [2019-01-12 14:57:02,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:57:02,832 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:57:03,029 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:57:03,034 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:57:03,052 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:57:03,067 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:57:03,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03 WrapperNode [2019-01-12 14:57:03,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:57:03,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:57:03,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:57:03,068 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:57:03,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (1/1) ... [2019-01-12 14:57:03,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (1/1) ... [2019-01-12 14:57:03,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:57:03,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:57:03,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:57:03,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:57:03,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (1/1) ... [2019-01-12 14:57:03,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (1/1) ... [2019-01-12 14:57:03,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (1/1) ... [2019-01-12 14:57:03,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (1/1) ... [2019-01-12 14:57:03,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (1/1) ... [2019-01-12 14:57:03,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (1/1) ... [2019-01-12 14:57:03,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (1/1) ... [2019-01-12 14:57:03,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:57:03,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:57:03,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:57:03,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:57:03,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:03,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:57:03,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:57:03,247 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-01-12 14:57:03,247 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-01-12 14:57:03,248 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-01-12 14:57:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-01-12 14:57:03,587 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:57:03,588 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:57:03,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:57:03 BoogieIcfgContainer [2019-01-12 14:57:03,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:57:03,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:57:03,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:57:03,593 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:57:03,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:57:02" (1/3) ... [2019-01-12 14:57:03,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5e542b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:57:03, skipping insertion in model container [2019-01-12 14:57:03,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:03" (2/3) ... [2019-01-12 14:57:03,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5e542b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:57:03, skipping insertion in model container [2019-01-12 14:57:03,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:57:03" (3/3) ... [2019-01-12 14:57:03,596 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10_false-unreach-call.c [2019-01-12 14:57:03,605 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:57:03,611 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:57:03,624 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:57:03,654 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:57:03,655 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:57:03,655 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:57:03,655 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:57:03,655 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:57:03,655 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:57:03,655 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:57:03,655 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:57:03,656 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:57:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 14:57:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:57:03,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:03,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:03,682 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:03,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-01-12 14:57:03,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:03,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:03,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:03,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:03,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:57:03,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:57:03,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:57:03,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:57:03,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:57:03,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:57:03,908 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-01-12 14:57:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:04,057 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-01-12 14:57:04,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:57:04,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:57:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:04,070 INFO L225 Difference]: With dead ends: 38 [2019-01-12 14:57:04,071 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 14:57:04,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:57:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 14:57:04,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 14:57:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 14:57:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 14:57:04,119 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-01-12 14:57:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:04,119 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 14:57:04,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:57:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 14:57:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 14:57:04,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:04,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:04,122 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-01-12 14:57:04,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:04,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:04,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:04,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:04,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:57:04,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:57:04,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:57:04,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:57:04,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:57:04,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:57:04,229 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-01-12 14:57:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:04,507 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-01-12 14:57:04,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:57:04,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 14:57:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:04,509 INFO L225 Difference]: With dead ends: 32 [2019-01-12 14:57:04,509 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 14:57:04,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:57:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 14:57:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 14:57:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 14:57:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 14:57:04,520 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-01-12 14:57:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:04,521 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 14:57:04,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:57:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 14:57:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:57:04,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:04,524 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:04,524 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-01-12 14:57:04,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:04,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:04,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:04,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 14:57:04,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:04,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:04,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:04,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 14:57:04,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:04,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-01-12 14:57:04,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:57:04,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:57:04,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:57:04,856 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2019-01-12 14:57:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:05,493 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2019-01-12 14:57:05,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:57:05,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-12 14:57:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:05,495 INFO L225 Difference]: With dead ends: 54 [2019-01-12 14:57:05,495 INFO L226 Difference]: Without dead ends: 30 [2019-01-12 14:57:05,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:57:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-12 14:57:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-12 14:57:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 14:57:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-12 14:57:05,512 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2019-01-12 14:57:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:05,513 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-12 14:57:05,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:57:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-01-12 14:57:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:57:05,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:05,518 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] [2019-01-12 14:57:05,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:05,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-01-12 14:57:05,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:05,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:05,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:05,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:05,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 14:57:05,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:05,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:05,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:05,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 14:57:05,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:05,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:57:05,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:57:05,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:57:05,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:57:05,750 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2019-01-12 14:57:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:05,981 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-01-12 14:57:05,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:57:05,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-12 14:57:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:05,985 INFO L225 Difference]: With dead ends: 39 [2019-01-12 14:57:05,986 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 14:57:05,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:57:05,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 14:57:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-12 14:57:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 14:57:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-01-12 14:57:05,996 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2019-01-12 14:57:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:05,996 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-12 14:57:05,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:57:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-01-12 14:57:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:57:05,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:05,999 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] [2019-01-12 14:57:05,999 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-01-12 14:57:05,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:06,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 14:57:06,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:06,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:06,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:06,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 14:57:06,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:06,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-01-12 14:57:06,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:57:06,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:57:06,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:57:06,297 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 10 states. [2019-01-12 14:57:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:06,633 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-01-12 14:57:06,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:57:06,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-12 14:57:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:06,636 INFO L225 Difference]: With dead ends: 66 [2019-01-12 14:57:06,637 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 14:57:06,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:57:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 14:57:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 14:57:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 14:57:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-01-12 14:57:06,648 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2019-01-12 14:57:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:06,649 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-12 14:57:06,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:57:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-01-12 14:57:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:57:06,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:06,651 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] [2019-01-12 14:57:06,651 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:06,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-01-12 14:57:06,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:06,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:06,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 14:57:06,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:06,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:06,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:06,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 14:57:06,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:06,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2019-01-12 14:57:06,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:57:06,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:57:06,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:57:06,911 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2019-01-12 14:57:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:07,273 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2019-01-12 14:57:07,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:57:07,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-12 14:57:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:07,277 INFO L225 Difference]: With dead ends: 57 [2019-01-12 14:57:07,277 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 14:57:07,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:57:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 14:57:07,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2019-01-12 14:57:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 14:57:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2019-01-12 14:57:07,290 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 36 [2019-01-12 14:57:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:07,290 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2019-01-12 14:57:07,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:57:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2019-01-12 14:57:07,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 14:57:07,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:07,293 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] [2019-01-12 14:57:07,293 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:07,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:07,294 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-01-12 14:57:07,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:07,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:07,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:07,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:07,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 14:57:07,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:07,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:07,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:07,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-12 14:57:07,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:07,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2019-01-12 14:57:07,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:57:07,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:57:07,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:57:07,544 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 10 states. [2019-01-12 14:57:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:07,935 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. [2019-01-12 14:57:07,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:57:07,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-01-12 14:57:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:07,940 INFO L225 Difference]: With dead ends: 67 [2019-01-12 14:57:07,941 INFO L226 Difference]: Without dead ends: 63 [2019-01-12 14:57:07,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:57:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-12 14:57:07,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2019-01-12 14:57:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 14:57:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-01-12 14:57:07,956 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 50 [2019-01-12 14:57:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:07,956 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-01-12 14:57:07,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:57:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-01-12 14:57:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-12 14:57:07,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:07,960 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] [2019-01-12 14:57:07,960 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1353550601, now seen corresponding path program 2 times [2019-01-12 14:57:07,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:07,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:07,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:07,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:07,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 14:57:08,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:08,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:08,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:57:08,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:57:08,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:08,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-12 14:57:08,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:08,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-01-12 14:57:08,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 14:57:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 14:57:08,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:57:08,474 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 16 states. [2019-01-12 14:57:09,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:09,434 INFO L93 Difference]: Finished difference Result 142 states and 295 transitions. [2019-01-12 14:57:09,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 14:57:09,435 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2019-01-12 14:57:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:09,440 INFO L225 Difference]: With dead ends: 142 [2019-01-12 14:57:09,441 INFO L226 Difference]: Without dead ends: 99 [2019-01-12 14:57:09,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2019-01-12 14:57:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-12 14:57:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2019-01-12 14:57:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 14:57:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 153 transitions. [2019-01-12 14:57:09,468 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 153 transitions. Word has length 76 [2019-01-12 14:57:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:09,468 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 153 transitions. [2019-01-12 14:57:09,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 14:57:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 153 transitions. [2019-01-12 14:57:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-12 14:57:09,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:09,483 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 14, 13, 13, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:09,483 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1639902325, now seen corresponding path program 2 times [2019-01-12 14:57:09,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:09,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:09,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:09,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:09,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 84 proven. 256 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2019-01-12 14:57:09,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:09,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:09,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:57:09,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:57:09,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:09,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 47 proven. 357 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2019-01-12 14:57:10,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:10,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-01-12 14:57:10,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 14:57:10,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 14:57:10,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-01-12 14:57:10,431 INFO L87 Difference]: Start difference. First operand 83 states and 153 transitions. Second operand 18 states. [2019-01-12 14:57:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:12,032 INFO L93 Difference]: Finished difference Result 228 states and 516 transitions. [2019-01-12 14:57:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 14:57:12,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 212 [2019-01-12 14:57:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:12,037 INFO L225 Difference]: With dead ends: 228 [2019-01-12 14:57:12,037 INFO L226 Difference]: Without dead ends: 125 [2019-01-12 14:57:12,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 14:57:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-12 14:57:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2019-01-12 14:57:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-12 14:57:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 180 transitions. [2019-01-12 14:57:12,062 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 180 transitions. Word has length 212 [2019-01-12 14:57:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:12,063 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 180 transitions. [2019-01-12 14:57:12,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 14:57:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 180 transitions. [2019-01-12 14:57:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-01-12 14:57:12,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:12,071 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 22, 22, 22, 19, 16, 16, 16, 16, 16, 16, 16, 14, 11, 11, 11, 11, 11, 11, 11, 8, 6, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:12,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1260419359, now seen corresponding path program 1 times [2019-01-12 14:57:12,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:12,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:12,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:12,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 153 proven. 558 refuted. 0 times theorem prover too weak. 3427 trivial. 0 not checked. [2019-01-12 14:57:12,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:12,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:12,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:12,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 107 proven. 817 refuted. 0 times theorem prover too weak. 3214 trivial. 0 not checked. [2019-01-12 14:57:12,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:12,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2019-01-12 14:57:12,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 14:57:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 14:57:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-01-12 14:57:12,964 INFO L87 Difference]: Start difference. First operand 114 states and 180 transitions. Second operand 18 states. [2019-01-12 14:57:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:14,384 INFO L93 Difference]: Finished difference Result 286 states and 583 transitions. [2019-01-12 14:57:14,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 14:57:14,385 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 374 [2019-01-12 14:57:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:14,389 INFO L225 Difference]: With dead ends: 286 [2019-01-12 14:57:14,390 INFO L226 Difference]: Without dead ends: 175 [2019-01-12 14:57:14,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 14:57:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-12 14:57:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2019-01-12 14:57:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-12 14:57:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 248 transitions. [2019-01-12 14:57:14,419 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 248 transitions. Word has length 374 [2019-01-12 14:57:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:14,420 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 248 transitions. [2019-01-12 14:57:14,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 14:57:14,420 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 248 transitions. [2019-01-12 14:57:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2019-01-12 14:57:14,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:14,431 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 30, 30, 30, 27, 19, 19, 19, 19, 19, 19, 19, 15, 15, 15, 15, 15, 15, 15, 15, 9, 8, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:14,432 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash 835580942, now seen corresponding path program 1 times [2019-01-12 14:57:14,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:14,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:14,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:14,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6594 backedges. 351 proven. 568 refuted. 0 times theorem prover too weak. 5675 trivial. 0 not checked. [2019-01-12 14:57:14,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:14,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:14,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:14,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6594 backedges. 192 proven. 1155 refuted. 0 times theorem prover too weak. 5247 trivial. 0 not checked. [2019-01-12 14:57:15,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:15,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2019-01-12 14:57:15,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 14:57:15,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 14:57:15,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-01-12 14:57:15,383 INFO L87 Difference]: Start difference. First operand 150 states and 248 transitions. Second operand 21 states. [2019-01-12 14:57:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:16,820 INFO L93 Difference]: Finished difference Result 320 states and 654 transitions. [2019-01-12 14:57:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 14:57:16,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 474 [2019-01-12 14:57:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:16,829 INFO L225 Difference]: With dead ends: 320 [2019-01-12 14:57:16,830 INFO L226 Difference]: Without dead ends: 178 [2019-01-12 14:57:16,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=350, Invalid=1812, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 14:57:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-12 14:57:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2019-01-12 14:57:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-12 14:57:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 268 transitions. [2019-01-12 14:57:16,868 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 268 transitions. Word has length 474 [2019-01-12 14:57:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:16,869 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 268 transitions. [2019-01-12 14:57:16,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 14:57:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 268 transitions. [2019-01-12 14:57:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2019-01-12 14:57:16,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:16,901 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 58, 58, 49, 48, 32, 32, 32, 32, 32, 32, 32, 29, 29, 29, 29, 29, 29, 29, 20, 16, 16, 10, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:16,901 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:16,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1634765403, now seen corresponding path program 2 times [2019-01-12 14:57:16,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:16,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:16,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:16,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:16,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:17,688 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 14:57:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 20844 backedges. 420 proven. 2133 refuted. 0 times theorem prover too weak. 18291 trivial. 0 not checked. [2019-01-12 14:57:18,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:18,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:18,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:57:18,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:57:18,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:18,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 20844 backedges. 316 proven. 2544 refuted. 0 times theorem prover too weak. 17984 trivial. 0 not checked. [2019-01-12 14:57:19,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:19,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2019-01-12 14:57:19,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 14:57:19,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 14:57:19,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-01-12 14:57:19,135 INFO L87 Difference]: Start difference. First operand 153 states and 268 transitions. Second operand 23 states. [2019-01-12 14:57:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:20,903 INFO L93 Difference]: Finished difference Result 359 states and 799 transitions. [2019-01-12 14:57:20,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-12 14:57:20,904 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 838 [2019-01-12 14:57:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:20,909 INFO L225 Difference]: With dead ends: 359 [2019-01-12 14:57:20,909 INFO L226 Difference]: Without dead ends: 212 [2019-01-12 14:57:20,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 831 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=462, Invalid=2508, Unknown=0, NotChecked=0, Total=2970 [2019-01-12 14:57:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-12 14:57:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 184. [2019-01-12 14:57:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-01-12 14:57:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 323 transitions. [2019-01-12 14:57:20,936 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 323 transitions. Word has length 838 [2019-01-12 14:57:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:20,939 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 323 transitions. [2019-01-12 14:57:20,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 14:57:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 323 transitions. [2019-01-12 14:57:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2019-01-12 14:57:20,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:20,952 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 75, 75, 64, 62, 42, 42, 42, 42, 42, 42, 42, 37, 37, 37, 37, 37, 37, 37, 25, 22, 22, 11, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:20,953 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:20,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:20,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1139463444, now seen corresponding path program 3 times [2019-01-12 14:57:20,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:20,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:20,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:20,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:20,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 35059 backedges. 678 proven. 2918 refuted. 0 times theorem prover too weak. 31463 trivial. 0 not checked. [2019-01-12 14:57:21,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:21,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:21,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:57:22,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-12 14:57:22,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:22,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 35059 backedges. 8459 proven. 34 refuted. 0 times theorem prover too weak. 26566 trivial. 0 not checked. [2019-01-12 14:57:22,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:22,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2019-01-12 14:57:22,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:57:22,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:57:22,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:57:22,958 INFO L87 Difference]: Start difference. First operand 184 states and 323 transitions. Second operand 17 states. [2019-01-12 14:57:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:24,058 INFO L93 Difference]: Finished difference Result 402 states and 756 transitions. [2019-01-12 14:57:24,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 14:57:24,059 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1083 [2019-01-12 14:57:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:24,063 INFO L225 Difference]: With dead ends: 402 [2019-01-12 14:57:24,064 INFO L226 Difference]: Without dead ends: 220 [2019-01-12 14:57:24,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2019-01-12 14:57:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-01-12 14:57:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-01-12 14:57:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-12 14:57:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 360 transitions. [2019-01-12 14:57:24,088 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 360 transitions. Word has length 1083 [2019-01-12 14:57:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:24,090 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 360 transitions. [2019-01-12 14:57:24,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:57:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 360 transitions. [2019-01-12 14:57:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1714 [2019-01-12 14:57:24,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:24,115 INFO L402 BasicCegarLoop]: trace histogram [135, 135, 116, 116, 105, 99, 67, 67, 67, 67, 67, 67, 67, 58, 58, 58, 58, 58, 58, 58, 47, 32, 30, 17, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:24,115 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:24,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:24,117 INFO L82 PathProgramCache]: Analyzing trace with hash 584717408, now seen corresponding path program 4 times [2019-01-12 14:57:24,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:24,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:24,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:24,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 88627 backedges. 4284 proven. 2050 refuted. 0 times theorem prover too weak. 82293 trivial. 0 not checked. [2019-01-12 14:57:25,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:25,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:25,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:57:26,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:57:26,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:26,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 88627 backedges. 1075 proven. 5255 refuted. 0 times theorem prover too weak. 82297 trivial. 0 not checked. [2019-01-12 14:57:28,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:28,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 22 [2019-01-12 14:57:28,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 14:57:28,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 14:57:28,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:57:28,350 INFO L87 Difference]: Start difference. First operand 220 states and 360 transitions. Second operand 22 states. [2019-01-12 14:57:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:29,110 INFO L93 Difference]: Finished difference Result 320 states and 636 transitions. [2019-01-12 14:57:29,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 14:57:29,111 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1713 [2019-01-12 14:57:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:29,120 INFO L225 Difference]: With dead ends: 320 [2019-01-12 14:57:29,120 INFO L226 Difference]: Without dead ends: 236 [2019-01-12 14:57:29,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1747 GetRequests, 1714 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 14:57:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-12 14:57:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2019-01-12 14:57:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-12 14:57:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 342 transitions. [2019-01-12 14:57:29,148 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 342 transitions. Word has length 1713 [2019-01-12 14:57:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:29,149 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 342 transitions. [2019-01-12 14:57:29,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 14:57:29,150 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 342 transitions. [2019-01-12 14:57:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2019-01-12 14:57:29,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:29,160 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 58, 58, 50, 47, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 21, 17, 11, 11, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:29,160 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:29,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:29,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1131952941, now seen corresponding path program 5 times [2019-01-12 14:57:29,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:29,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:29,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:29,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:29,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 19602 backedges. 589 proven. 2484 refuted. 0 times theorem prover too weak. 16529 trivial. 0 not checked. [2019-01-12 14:57:29,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:29,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:29,922 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:57:30,235 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-01-12 14:57:30,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:30,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19602 backedges. 10699 proven. 176 refuted. 0 times theorem prover too weak. 8727 trivial. 0 not checked. [2019-01-12 14:57:31,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:31,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 26 [2019-01-12 14:57:31,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 14:57:31,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 14:57:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-01-12 14:57:31,396 INFO L87 Difference]: Start difference. First operand 233 states and 342 transitions. Second operand 26 states. [2019-01-12 14:57:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:33,197 INFO L93 Difference]: Finished difference Result 520 states and 873 transitions. [2019-01-12 14:57:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 14:57:33,198 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 814 [2019-01-12 14:57:33,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:33,204 INFO L225 Difference]: With dead ends: 520 [2019-01-12 14:57:33,205 INFO L226 Difference]: Without dead ends: 293 [2019-01-12 14:57:33,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 808 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=305, Invalid=1857, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 14:57:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-01-12 14:57:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 278. [2019-01-12 14:57:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-01-12 14:57:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 401 transitions. [2019-01-12 14:57:33,242 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 401 transitions. Word has length 814 [2019-01-12 14:57:33,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:33,242 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 401 transitions. [2019-01-12 14:57:33,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 14:57:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 401 transitions. [2019-01-12 14:57:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1154 [2019-01-12 14:57:33,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:33,269 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 83, 83, 68, 68, 43, 43, 43, 43, 43, 43, 43, 41, 41, 41, 41, 41, 41, 41, 27, 25, 18, 15, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:33,270 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:33,272 INFO L82 PathProgramCache]: Analyzing trace with hash 573643595, now seen corresponding path program 6 times [2019-01-12 14:57:33,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:33,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:33,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:33,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:33,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:34,134 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 14:57:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 39680 backedges. 803 proven. 3852 refuted. 0 times theorem prover too weak. 35025 trivial. 0 not checked. [2019-01-12 14:57:34,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:34,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:34,839 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:57:35,066 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-01-12 14:57:35,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:35,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 39680 backedges. 722 proven. 2394 refuted. 0 times theorem prover too weak. 36564 trivial. 0 not checked. [2019-01-12 14:57:36,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:36,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 23 [2019-01-12 14:57:36,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 14:57:36,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 14:57:36,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-01-12 14:57:36,073 INFO L87 Difference]: Start difference. First operand 278 states and 401 transitions. Second operand 23 states. [2019-01-12 14:57:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:37,580 INFO L93 Difference]: Finished difference Result 600 states and 900 transitions. [2019-01-12 14:57:37,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-12 14:57:37,581 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1153 [2019-01-12 14:57:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:37,586 INFO L225 Difference]: With dead ends: 600 [2019-01-12 14:57:37,586 INFO L226 Difference]: Without dead ends: 327 [2019-01-12 14:57:37,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1207 GetRequests, 1152 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=460, Invalid=2732, Unknown=0, NotChecked=0, Total=3192 [2019-01-12 14:57:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-01-12 14:57:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 304. [2019-01-12 14:57:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-12 14:57:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 423 transitions. [2019-01-12 14:57:37,622 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 423 transitions. Word has length 1153 [2019-01-12 14:57:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:37,623 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 423 transitions. [2019-01-12 14:57:37,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 14:57:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 423 transitions. [2019-01-12 14:57:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2019-01-12 14:57:37,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:37,637 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 68, 68, 57, 57, 36, 36, 36, 36, 36, 36, 36, 34, 34, 34, 34, 34, 34, 34, 23, 21, 16, 11, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:37,638 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:37,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:37,638 INFO L82 PathProgramCache]: Analyzing trace with hash -310373497, now seen corresponding path program 7 times [2019-01-12 14:57:37,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:37,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:37,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:37,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:37,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 27580 backedges. 1793 proven. 798 refuted. 0 times theorem prover too weak. 24989 trivial. 0 not checked. [2019-01-12 14:57:38,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:38,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:38,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:38,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 27580 backedges. 981 proven. 1966 refuted. 0 times theorem prover too weak. 24633 trivial. 0 not checked. [2019-01-12 14:57:39,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:39,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 16 [2019-01-12 14:57:39,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 14:57:39,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 14:57:39,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:57:39,312 INFO L87 Difference]: Start difference. First operand 304 states and 423 transitions. Second operand 16 states. [2019-01-12 14:57:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:41,260 INFO L93 Difference]: Finished difference Result 332 states and 464 transitions. [2019-01-12 14:57:41,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 14:57:41,261 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 963 [2019-01-12 14:57:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:41,269 INFO L225 Difference]: With dead ends: 332 [2019-01-12 14:57:41,269 INFO L226 Difference]: Without dead ends: 307 [2019-01-12 14:57:41,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 965 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-01-12 14:57:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-01-12 14:57:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299. [2019-01-12 14:57:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-01-12 14:57:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 389 transitions. [2019-01-12 14:57:41,297 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 389 transitions. Word has length 963 [2019-01-12 14:57:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:41,298 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 389 transitions. [2019-01-12 14:57:41,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 14:57:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 389 transitions. [2019-01-12 14:57:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1127 [2019-01-12 14:57:41,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:41,316 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 81, 81, 67, 66, 42, 42, 42, 42, 42, 42, 42, 40, 40, 40, 40, 40, 40, 40, 27, 24, 17, 15, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:41,316 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash -290957254, now seen corresponding path program 8 times [2019-01-12 14:57:41,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:41,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:41,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:41,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:41,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 37824 backedges. 2290 proven. 1939 refuted. 0 times theorem prover too weak. 33595 trivial. 0 not checked. [2019-01-12 14:57:42,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:42,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:42,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:57:42,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:57:42,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:42,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 37824 backedges. 1612 proven. 1429 refuted. 0 times theorem prover too weak. 34783 trivial. 0 not checked. [2019-01-12 14:57:43,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:43,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 24 [2019-01-12 14:57:43,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 14:57:43,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 14:57:43,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:57:43,748 INFO L87 Difference]: Start difference. First operand 299 states and 389 transitions. Second operand 24 states. [2019-01-12 14:57:45,450 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-12 14:57:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:46,404 INFO L93 Difference]: Finished difference Result 556 states and 733 transitions. [2019-01-12 14:57:46,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-12 14:57:46,405 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1126 [2019-01-12 14:57:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:46,411 INFO L225 Difference]: With dead ends: 556 [2019-01-12 14:57:46,411 INFO L226 Difference]: Without dead ends: 307 [2019-01-12 14:57:46,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1184 GetRequests, 1124 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=516, Invalid=3266, Unknown=0, NotChecked=0, Total=3782 [2019-01-12 14:57:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-01-12 14:57:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2019-01-12 14:57:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-01-12 14:57:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 339 transitions. [2019-01-12 14:57:46,438 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 339 transitions. Word has length 1126 [2019-01-12 14:57:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:46,439 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 339 transitions. [2019-01-12 14:57:46,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 14:57:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 339 transitions. [2019-01-12 14:57:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1141 [2019-01-12 14:57:46,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:46,457 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 68, 67, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 26, 26, 17, 15, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:46,457 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:46,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:46,458 INFO L82 PathProgramCache]: Analyzing trace with hash 908328235, now seen corresponding path program 9 times [2019-01-12 14:57:46,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:46,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:46,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:46,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:46,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:47,095 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 14:57:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 4072 proven. 821 refuted. 0 times theorem prover too weak. 33876 trivial. 0 not checked. [2019-01-12 14:57:47,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:47,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:57:47,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:57:47,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-12 14:57:47,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:47,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 3168 proven. 249 refuted. 0 times theorem prover too weak. 35352 trivial. 0 not checked. [2019-01-12 14:57:49,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:49,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 24 [2019-01-12 14:57:49,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 14:57:49,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 14:57:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:57:49,197 INFO L87 Difference]: Start difference. First operand 272 states and 339 transitions. Second operand 24 states. [2019-01-12 14:57:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:50,399 INFO L93 Difference]: Finished difference Result 334 states and 413 transitions. [2019-01-12 14:57:50,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-12 14:57:50,401 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1140 [2019-01-12 14:57:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:50,407 INFO L225 Difference]: With dead ends: 334 [2019-01-12 14:57:50,407 INFO L226 Difference]: Without dead ends: 313 [2019-01-12 14:57:50,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 1142 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=340, Invalid=2012, Unknown=0, NotChecked=0, Total=2352 [2019-01-12 14:57:50,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-12 14:57:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 281. [2019-01-12 14:57:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-12 14:57:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 342 transitions. [2019-01-12 14:57:50,438 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 342 transitions. Word has length 1140 [2019-01-12 14:57:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:50,441 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 342 transitions. [2019-01-12 14:57:50,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 14:57:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 342 transitions. [2019-01-12 14:57:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2019-01-12 14:57:50,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:50,462 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] [2019-01-12 14:57:50,462 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:50,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1008927292, now seen corresponding path program 10 times [2019-01-12 14:57:50,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:50,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:50,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:50,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:50,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:57:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:57:50,854 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:57:51,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:57:51 BoogieIcfgContainer [2019-01-12 14:57:51,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:57:51,123 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:57:51,123 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:57:51,124 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:57:51,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:57:03" (3/4) ... [2019-01-12 14:57:51,127 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:57:51,408 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:57:51,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:57:51,413 INFO L168 Benchmark]: Toolchain (without parser) took 48617.16 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 950.0 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:57:51,414 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:57:51,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.35 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:57:51,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.98 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:57:51,416 INFO L168 Benchmark]: Boogie Preprocessor took 19.54 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:57:51,417 INFO L168 Benchmark]: RCFGBuilder took 465.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:57:51,418 INFO L168 Benchmark]: TraceAbstraction took 47532.61 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-01-12 14:57:51,418 INFO L168 Benchmark]: Witness Printer took 289.11 ms. Allocated memory is still 3.7 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-12 14:57:51,422 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.35 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.98 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.54 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 465.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47532.61 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 289.11 ms. Allocated memory is still 3.7 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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; [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) [L37] int result = fibo1(x); [L38] COND TRUE result == 55 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. UNSAFE Result, 47.4s OverallTime, 20 OverallIterations, 135 TraceHistogramMax, 20.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 588 SDtfs, 1384 SDslu, 4316 SDs, 0 SdLazy, 8808 SolverSat, 1628 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10661 GetRequests, 10104 SyntacticMatches, 3 SemanticMatches, 554 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4837 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=16, 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.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 258 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 21491 NumberOfCodeBlocks, 18480 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 20247 ConstructedInterpolants, 0 QuantifiedInterpolants, 23839877 SizeOfPredicates, 117 NumberOfNonLiveVariables, 15665 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 36 InterpolantComputations, 2 PerfectInterpolantSequences, 605474/640380 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...