./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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_10_false-unreach-call_true-termination.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 1ca069cb8d4103e8fb4700634948424bd87542bc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-91b1670 [2018-11-28 18:50:11,931 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:50:11,933 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:50:11,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:50:11,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:50:11,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:50:11,949 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:50:11,952 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:50:11,953 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:50:11,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:50:11,956 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:50:11,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:50:11,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:50:11,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:50:11,959 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:50:11,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:50:11,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:50:11,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:50:11,965 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:50:11,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:50:11,969 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:50:11,970 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:50:11,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:50:11,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:50:11,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:50:11,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:50:11,979 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:50:11,980 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:50:11,981 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:50:11,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:50:11,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:50:11,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:50:11,986 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:50:11,986 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:50:11,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:50:11,991 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:50:11,993 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:50:12,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:50:12,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:50:12,022 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:50:12,023 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:50:12,023 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:50:12,023 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:50:12,023 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:50:12,025 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:50:12,025 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:50:12,025 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:50:12,025 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:50:12,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:50:12,026 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:50:12,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:50:12,026 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:50:12,027 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:50:12,027 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:50:12,027 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:50:12,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:50:12,028 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:50:12,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:50:12,028 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:50:12,028 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:50:12,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:50:12,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:50:12,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:50:12,032 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:50:12,032 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:50:12,033 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:50:12,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:50:12,033 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 -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2018-11-28 18:50:12,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:50:12,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:50:12,096 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:50:12,097 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:50:12,098 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:50:12,099 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-28 18:50:12,160 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b483aa6a/fd18808f146346f4a9d663eb3f38ccae/FLAGfd64afe9d [2018-11-28 18:50:12,655 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:50:12,656 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-28 18:50:12,665 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b483aa6a/fd18808f146346f4a9d663eb3f38ccae/FLAGfd64afe9d [2018-11-28 18:50:13,011 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b483aa6a/fd18808f146346f4a9d663eb3f38ccae [2018-11-28 18:50:13,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:50:13,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:50:13,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:50:13,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:50:13,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:50:13,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a57947c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13, skipping insertion in model container [2018-11-28 18:50:13,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:50:13,050 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:50:13,266 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:50:13,271 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:50:13,294 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:50:13,311 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:50:13,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13 WrapperNode [2018-11-28 18:50:13,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:50:13,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:50:13,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:50:13,313 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:50:13,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:50:13,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:50:13,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:50:13,339 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:50:13,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (1/1) ... [2018-11-28 18:50:13,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:50:13,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:50:13,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:50:13,362 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:50:13,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (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 [2018-11-28 18:50:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:50:13,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:50:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:50:13,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:50:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:50:13,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:50:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-28 18:50:13,489 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-28 18:50:13,662 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:50:13,662 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:50:13,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:50:13 BoogieIcfgContainer [2018-11-28 18:50:13,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:50:13,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:50:13,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:50:13,668 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:50:13,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:50:13" (1/3) ... [2018-11-28 18:50:13,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8fa9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:50:13, skipping insertion in model container [2018-11-28 18:50:13,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:13" (2/3) ... [2018-11-28 18:50:13,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8fa9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:50:13, skipping insertion in model container [2018-11-28 18:50:13,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:50:13" (3/3) ... [2018-11-28 18:50:13,672 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2018-11-28 18:50:13,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:50:13,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:50:13,708 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:50:13,739 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:50:13,739 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:50:13,739 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:50:13,740 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:50:13,740 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:50:13,740 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:50:13,740 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:50:13,740 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:50:13,740 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:50:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-28 18:50:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:50:13,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:13,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:13,769 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:13,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:13,775 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2018-11-28 18:50:13,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:13,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:13,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:13,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:13,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:50:14,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:50:14,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:50:14,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:50:14,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:50:14,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:50:14,129 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-28 18:50:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:14,275 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-28 18:50:14,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:50:14,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:50:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:14,290 INFO L225 Difference]: With dead ends: 35 [2018-11-28 18:50:14,290 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 18:50:14,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:50:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 18:50:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 18:50:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:50:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 18:50:14,345 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-28 18:50:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:14,346 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 18:50:14,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:50:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-28 18:50:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:50:14,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:14,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:14,349 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:14,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:14,349 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2018-11-28 18:50:14,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:14,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:14,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:14,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:14,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:50:14,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:50:14,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:50:14,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:50:14,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:50:14,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:50:14,617 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-28 18:50:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:14,861 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-28 18:50:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:50:14,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:50:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:14,863 INFO L225 Difference]: With dead ends: 27 [2018-11-28 18:50:14,863 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 18:50:14,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:50:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 18:50:14,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-28 18:50:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:50:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 18:50:14,872 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-28 18:50:14,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:14,872 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 18:50:14,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:50:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-28 18:50:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:50:14,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:14,874 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:14,875 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:14,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2018-11-28 18:50:14,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:14,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:14,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:50:15,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:15,090 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 [2018-11-28 18:50:15,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:15,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:50:15,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:15,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-28 18:50:15,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:50:15,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:50:15,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:50:15,275 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-28 18:50:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:15,588 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-28 18:50:15,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:50:15,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-28 18:50:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:15,590 INFO L225 Difference]: With dead ends: 38 [2018-11-28 18:50:15,590 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 18:50:15,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:50:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 18:50:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 18:50:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 18:50:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-28 18:50:15,600 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-28 18:50:15,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:15,601 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 18:50:15,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:50:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-28 18:50:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:50:15,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:15,604 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:15,604 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:15,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:15,605 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2018-11-28 18:50:15,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:15,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:15,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:15,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:50:15,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:15,752 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 [2018-11-28 18:50:15,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:15,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:50:15,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:15,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 18:50:15,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:50:15,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:50:15,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:50:15,856 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-28 18:50:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:16,060 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-28 18:50:16,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:50:16,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-28 18:50:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:16,066 INFO L225 Difference]: With dead ends: 32 [2018-11-28 18:50:16,066 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 18:50:16,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:50:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 18:50:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 18:50:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 18:50:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-28 18:50:16,087 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-28 18:50:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:16,089 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-28 18:50:16,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:50:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-28 18:50:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:50:16,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:16,092 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:16,092 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:16,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:16,093 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2018-11-28 18:50:16,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:16,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:16,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:16,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 18:50:16,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:16,394 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 [2018-11-28 18:50:16,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:50:16,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:50:16,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:16,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 18:50:16,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:16,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-11-28 18:50:16,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:50:16,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:50:16,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:50:16,543 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 8 states. [2018-11-28 18:50:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:16,792 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2018-11-28 18:50:16,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:50:16,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-28 18:50:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:16,795 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:50:16,795 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:50:16,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:50:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:50:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-28 18:50:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 18:50:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-28 18:50:16,807 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-11-28 18:50:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:16,808 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-28 18:50:16,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:50:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-28 18:50:16,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 18:50:16,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:16,814 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:16,815 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:16,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:16,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2018-11-28 18:50:16,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:16,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:16,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:16,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:16,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-11-28 18:50:17,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:17,138 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 [2018-11-28 18:50:17,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:50:17,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-28 18:50:17,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:17,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-28 18:50:17,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:17,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-28 18:50:17,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:50:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:50:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:50:17,296 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-11-28 18:50:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:17,822 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-11-28 18:50:17,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:50:17,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-28 18:50:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:17,827 INFO L225 Difference]: With dead ends: 76 [2018-11-28 18:50:17,827 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 18:50:17,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:50:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 18:50:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-28 18:50:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 18:50:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-11-28 18:50:17,845 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-11-28 18:50:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:17,846 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-11-28 18:50:17,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:50:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-11-28 18:50:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 18:50:17,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:17,850 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:17,850 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:17,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:17,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2018-11-28 18:50:17,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:17,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:17,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:17,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:17,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-28 18:50:18,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:18,192 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 [2018-11-28 18:50:18,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:50:18,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:50:18,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:18,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-28 18:50:18,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:18,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-11-28 18:50:18,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 18:50:18,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 18:50:18,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:50:18,435 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 19 states. [2018-11-28 18:50:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:19,837 INFO L93 Difference]: Finished difference Result 75 states and 150 transitions. [2018-11-28 18:50:19,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 18:50:19,839 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-11-28 18:50:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:19,847 INFO L225 Difference]: With dead ends: 75 [2018-11-28 18:50:19,847 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 18:50:19,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 18:50:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 18:50:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2018-11-28 18:50:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 18:50:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-28 18:50:19,881 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 82 [2018-11-28 18:50:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:19,881 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-11-28 18:50:19,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 18:50:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-11-28 18:50:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-28 18:50:19,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:19,897 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 19, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:19,897 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:19,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1548772748, now seen corresponding path program 5 times [2018-11-28 18:50:19,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:19,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:19,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:19,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 93 proven. 312 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2018-11-28 18:50:20,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:20,179 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 [2018-11-28 18:50:20,195 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 18:50:20,348 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-28 18:50:20,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:20,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 822 proven. 67 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2018-11-28 18:50:20,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:20,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-11-28 18:50:20,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:50:20,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:50:20,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:50:20,936 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 12 states. [2018-11-28 18:50:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:21,473 INFO L93 Difference]: Finished difference Result 125 states and 254 transitions. [2018-11-28 18:50:21,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 18:50:21,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2018-11-28 18:50:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:21,478 INFO L225 Difference]: With dead ends: 125 [2018-11-28 18:50:21,478 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 18:50:21,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-11-28 18:50:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 18:50:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2018-11-28 18:50:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 18:50:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2018-11-28 18:50:21,494 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 164 [2018-11-28 18:50:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:21,494 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-11-28 18:50:21,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:50:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2018-11-28 18:50:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-28 18:50:21,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:21,499 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:21,499 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:21,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:21,499 INFO L82 PathProgramCache]: Analyzing trace with hash 713359980, now seen corresponding path program 6 times [2018-11-28 18:50:21,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:21,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:21,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:21,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 162 proven. 102 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2018-11-28 18:50:21,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:21,743 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 [2018-11-28 18:50:21,753 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 18:50:21,857 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-28 18:50:21,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:21,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 495 proven. 39 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2018-11-28 18:50:22,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:22,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-11-28 18:50:22,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:50:22,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:50:22,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:50:22,047 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 11 states. [2018-11-28 18:50:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:22,350 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2018-11-28 18:50:22,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:50:22,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2018-11-28 18:50:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:22,355 INFO L225 Difference]: With dead ends: 121 [2018-11-28 18:50:22,355 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 18:50:22,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:50:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 18:50:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-11-28 18:50:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 18:50:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-11-28 18:50:22,369 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 136 [2018-11-28 18:50:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:22,370 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-11-28 18:50:22,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:50:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-28 18:50:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-28 18:50:22,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:22,374 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:22,375 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:22,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:22,375 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 7 times [2018-11-28 18:50:22,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:22,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:22,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2018-11-28 18:50:22,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:22,603 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 [2018-11-28 18:50:22,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:22,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2018-11-28 18:50:22,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:22,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-11-28 18:50:22,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:50:22,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:50:22,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:50:22,872 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 10 states. [2018-11-28 18:50:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:23,042 INFO L93 Difference]: Finished difference Result 79 states and 118 transitions. [2018-11-28 18:50:23,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:50:23,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2018-11-28 18:50:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:23,045 INFO L225 Difference]: With dead ends: 79 [2018-11-28 18:50:23,046 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 18:50:23,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:50:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 18:50:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-28 18:50:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 18:50:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2018-11-28 18:50:23,061 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 218 [2018-11-28 18:50:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:23,062 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2018-11-28 18:50:23,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:50:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2018-11-28 18:50:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-28 18:50:23,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:23,069 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:23,069 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:23,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:23,069 INFO L82 PathProgramCache]: Analyzing trace with hash 223191898, now seen corresponding path program 8 times [2018-11-28 18:50:23,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:23,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:23,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:23,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:23,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 248 proven. 1232 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2018-11-28 18:50:23,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:23,321 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 [2018-11-28 18:50:23,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:50:23,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:50:23,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:23,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2018-11-28 18:50:23,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:23,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2018-11-28 18:50:23,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:50:23,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:50:23,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:50:23,745 INFO L87 Difference]: Start difference. First operand 72 states and 104 transitions. Second operand 11 states. [2018-11-28 18:50:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:24,262 INFO L93 Difference]: Finished difference Result 81 states and 125 transitions. [2018-11-28 18:50:24,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:50:24,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 354 [2018-11-28 18:50:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:24,268 INFO L225 Difference]: With dead ends: 81 [2018-11-28 18:50:24,268 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 18:50:24,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:50:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 18:50:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-28 18:50:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 18:50:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2018-11-28 18:50:24,282 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 354 [2018-11-28 18:50:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:24,283 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2018-11-28 18:50:24,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:50:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2018-11-28 18:50:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-11-28 18:50:24,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:24,299 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 71, 44, 44, 44, 44, 44, 44, 44, 27, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:24,300 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:24,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash 792682385, now seen corresponding path program 9 times [2018-11-28 18:50:24,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:24,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:24,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:24,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:24,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 1129 proven. 2170 refuted. 0 times theorem prover too weak. 18634 trivial. 0 not checked. [2018-11-28 18:50:24,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:24,777 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 [2018-11-28 18:50:24,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:50:24,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-28 18:50:24,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:24,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 2734 proven. 73 refuted. 0 times theorem prover too weak. 19126 trivial. 0 not checked. [2018-11-28 18:50:25,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:25,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 14 [2018-11-28 18:50:25,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 18:50:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 18:50:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:50:25,130 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand 14 states. [2018-11-28 18:50:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:25,556 INFO L93 Difference]: Finished difference Result 151 states and 263 transitions. [2018-11-28 18:50:25,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 18:50:25,558 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 612 [2018-11-28 18:50:25,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:25,560 INFO L225 Difference]: With dead ends: 151 [2018-11-28 18:50:25,561 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 18:50:25,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2018-11-28 18:50:25,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 18:50:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-11-28 18:50:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 18:50:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2018-11-28 18:50:25,575 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 612 [2018-11-28 18:50:25,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:25,576 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2018-11-28 18:50:25,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 18:50:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2018-11-28 18:50:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2018-11-28 18:50:25,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:25,584 INFO L402 BasicCegarLoop]: trace histogram [107, 107, 87, 53, 53, 53, 53, 53, 53, 53, 34, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:25,584 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:25,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash -991175636, now seen corresponding path program 10 times [2018-11-28 18:50:25,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:25,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:25,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:25,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:25,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:26,247 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-28 18:50:26,547 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-11-28 18:50:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 31937 backedges. 2088 proven. 2724 refuted. 0 times theorem prover too weak. 27125 trivial. 0 not checked. [2018-11-28 18:50:27,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:27,317 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 [2018-11-28 18:50:27,332 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:50:27,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:50:27,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:27,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 31937 backedges. 524 proven. 3891 refuted. 0 times theorem prover too weak. 27522 trivial. 0 not checked. [2018-11-28 18:50:28,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:28,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 21 [2018-11-28 18:50:28,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 18:50:28,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 18:50:28,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-11-28 18:50:28,090 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand 21 states. [2018-11-28 18:50:29,809 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-28 18:50:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:29,993 INFO L93 Difference]: Finished difference Result 211 states and 409 transitions. [2018-11-28 18:50:29,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 18:50:29,994 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 736 [2018-11-28 18:50:29,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:29,998 INFO L225 Difference]: With dead ends: 211 [2018-11-28 18:50:29,998 INFO L226 Difference]: Without dead ends: 141 [2018-11-28 18:50:30,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 789 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=660, Invalid=2420, Unknown=0, NotChecked=0, Total=3080 [2018-11-28 18:50:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-28 18:50:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 124. [2018-11-28 18:50:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-28 18:50:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 180 transitions. [2018-11-28 18:50:30,020 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 180 transitions. Word has length 736 [2018-11-28 18:50:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:30,021 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 180 transitions. [2018-11-28 18:50:30,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 18:50:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 180 transitions. [2018-11-28 18:50:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2018-11-28 18:50:30,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:30,029 INFO L402 BasicCegarLoop]: trace histogram [119, 119, 96, 59, 59, 59, 59, 59, 59, 59, 37, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:30,030 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:30,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash -572992518, now seen corresponding path program 11 times [2018-11-28 18:50:30,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:30,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:30,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 728 proven. 4215 refuted. 0 times theorem prover too weak. 34545 trivial. 0 not checked. [2018-11-28 18:50:30,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:30,579 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 [2018-11-28 18:50:30,588 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 18:50:31,193 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) [2018-11-28 18:50:31,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:31,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 13692 proven. 860 refuted. 0 times theorem prover too weak. 24936 trivial. 0 not checked. [2018-11-28 18:50:33,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:33,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 22 [2018-11-28 18:50:33,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 18:50:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 18:50:33,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:50:33,266 INFO L87 Difference]: Start difference. First operand 124 states and 180 transitions. Second operand 22 states. [2018-11-28 18:50:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:35,173 INFO L93 Difference]: Finished difference Result 274 states and 490 transitions. [2018-11-28 18:50:35,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-28 18:50:35,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 817 [2018-11-28 18:50:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:35,178 INFO L225 Difference]: With dead ends: 274 [2018-11-28 18:50:35,178 INFO L226 Difference]: Without dead ends: 164 [2018-11-28 18:50:35,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 815 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=793, Invalid=3239, Unknown=0, NotChecked=0, Total=4032 [2018-11-28 18:50:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-28 18:50:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145. [2018-11-28 18:50:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-28 18:50:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 217 transitions. [2018-11-28 18:50:35,200 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 217 transitions. Word has length 817 [2018-11-28 18:50:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:35,201 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 217 transitions. [2018-11-28 18:50:35,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 18:50:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 217 transitions. [2018-11-28 18:50:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2018-11-28 18:50:35,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:35,248 INFO L402 BasicCegarLoop]: trace histogram [193, 193, 156, 96, 96, 96, 96, 96, 96, 96, 60, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:35,248 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:35,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:35,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1824723079, now seen corresponding path program 12 times [2018-11-28 18:50:35,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:35,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:35,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:35,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:35,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 6346 proven. 3281 refuted. 0 times theorem prover too weak. 94815 trivial. 0 not checked. [2018-11-28 18:50:36,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:36,518 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 [2018-11-28 18:50:36,527 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 18:50:37,491 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 149 check-sat command(s) [2018-11-28 18:50:37,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:37,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 30286 proven. 503 refuted. 0 times theorem prover too weak. 73653 trivial. 0 not checked. [2018-11-28 18:50:38,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:38,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 22 [2018-11-28 18:50:38,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 18:50:38,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 18:50:38,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:50:38,517 INFO L87 Difference]: Start difference. First operand 145 states and 217 transitions. Second operand 22 states. [2018-11-28 18:50:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:39,784 INFO L93 Difference]: Finished difference Result 330 states and 640 transitions. [2018-11-28 18:50:39,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 18:50:39,785 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1321 [2018-11-28 18:50:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:39,791 INFO L225 Difference]: With dead ends: 330 [2018-11-28 18:50:39,791 INFO L226 Difference]: Without dead ends: 171 [2018-11-28 18:50:39,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1364 GetRequests, 1323 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=423, Invalid=1383, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 18:50:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-28 18:50:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 131. [2018-11-28 18:50:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-28 18:50:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 171 transitions. [2018-11-28 18:50:39,811 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 171 transitions. Word has length 1321 [2018-11-28 18:50:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:39,813 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 171 transitions. [2018-11-28 18:50:39,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 18:50:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2018-11-28 18:50:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-11-28 18:50:39,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:39,830 INFO L402 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:39,830 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:39,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:39,830 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 13 times [2018-11-28 18:50:39,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:39,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:39,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:39,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:50:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:50:40,186 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:50:40,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:50:40 BoogieIcfgContainer [2018-11-28 18:50:40,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:50:40,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:50:40,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:50:40,394 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:50:40,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:50:13" (3/4) ... [2018-11-28 18:50:40,399 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:50:40,609 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:50:40,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:50:40,610 INFO L168 Benchmark]: Toolchain (without parser) took 27595.54 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 951.4 MB in the beginning and 1.6 GB in the end (delta: -656.4 MB). Peak memory consumption was 508.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:50:40,611 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. [2018-11-28 18:50:40,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.60 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:50:40,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.15 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:50:40,612 INFO L168 Benchmark]: Boogie Preprocessor took 22.72 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:50:40,612 INFO L168 Benchmark]: RCFGBuilder took 300.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:50:40,614 INFO L168 Benchmark]: TraceAbstraction took 26729.70 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -528.0 MB). Peak memory consumption was 510.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:50:40,615 INFO L168 Benchmark]: Witness Printer took 215.55 ms. Allocated memory is still 2.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:50:40,617 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 296.60 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 25.15 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.72 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 300.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26729.70 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -528.0 MB). Peak memory consumption was 510.0 MB. Max. memory is 11.5 GB. * Witness Printer took 215.55 ms. Allocated memory is still 2.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 26.6s OverallTime, 16 OverallIterations, 193 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 343 SDtfs, 791 SDslu, 1483 SDs, 0 SdLazy, 3277 SolverSat, 1159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4989 GetRequests, 4652 SyntacticMatches, 1 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2806 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 136 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 10497 NumberOfCodeBlocks, 9499 NumberOfCodeBlocksAsserted, 291 NumberOfCheckSat, 9257 ConstructedInterpolants, 0 QuantifiedInterpolants, 8136737 SizeOfPredicates, 77 NumberOfNonLiveVariables, 7994 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 28 InterpolantComputations, 2 PerfectInterpolantSequences, 398728/421262 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...