./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 13:50:26,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:50:26,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:50:26,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:50:26,904 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:50:26,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:50:26,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:50:26,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:50:26,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:50:26,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:50:26,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:50:26,908 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:50:26,909 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:50:26,910 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:50:26,910 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:50:26,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:50:26,911 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:50:26,913 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:50:26,914 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:50:26,915 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:50:26,916 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:50:26,917 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:50:26,918 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:50:26,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:50:26,919 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:50:26,919 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:50:26,920 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:50:26,920 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:50:26,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:50:26,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:50:26,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:50:26,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:50:26,923 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:50:26,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:50:26,923 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:50:26,924 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:50:26,924 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 13:50:26,934 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:50:26,934 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:50:26,935 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 13:50:26,935 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 13:50:26,936 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 13:50:26,936 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 13:50:26,936 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 13:50:26,936 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:50:26,936 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 13:50:26,936 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 13:50:26,936 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 13:50:26,937 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:50:26,937 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 13:50:26,937 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 13:50:26,937 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 13:50:26,937 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 13:50:26,937 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:50:26,937 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 13:50:26,937 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 13:50:26,937 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:50:26,938 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:50:26,938 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 13:50:26,938 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 13:50:26,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 13:50:26,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:50:26,938 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 13:50:26,938 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 13:50:26,938 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 13:50:26,938 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 13:50:26,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 13:50:26,938 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2018-12-02 13:50:26,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:50:26,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:50:26,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:50:26,975 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:50:26,975 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:50:26,976 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-12-02 13:50:27,013 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/data/56831fa71/9309dc8e6a0345e5b8d56fa1d43cef15/FLAGcdefa2ee5 [2018-12-02 13:50:27,393 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:50:27,393 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-12-02 13:50:27,396 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/data/56831fa71/9309dc8e6a0345e5b8d56fa1d43cef15/FLAGcdefa2ee5 [2018-12-02 13:50:27,405 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/data/56831fa71/9309dc8e6a0345e5b8d56fa1d43cef15 [2018-12-02 13:50:27,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:50:27,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:50:27,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:50:27,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:50:27,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:50:27,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d01f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27, skipping insertion in model container [2018-12-02 13:50:27,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:50:27,425 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:50:27,506 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:50:27,509 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:50:27,517 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:50:27,525 INFO L195 MainTranslator]: Completed translation [2018-12-02 13:50:27,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27 WrapperNode [2018-12-02 13:50:27,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 13:50:27,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 13:50:27,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 13:50:27,526 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 13:50:27,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 13:50:27,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 13:50:27,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 13:50:27,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 13:50:27,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (1/1) ... [2018-12-02 13:50:27,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 13:50:27,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 13:50:27,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 13:50:27,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 13:50:27,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 13:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 13:50:27,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 13:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 13:50:27,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 13:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 13:50:27,612 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 13:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-12-02 13:50:27,613 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-12-02 13:50:27,693 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 13:50:27,694 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 13:50:27,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:50:27 BoogieIcfgContainer [2018-12-02 13:50:27,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 13:50:27,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 13:50:27,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 13:50:27,697 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 13:50:27,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:50:27" (1/3) ... [2018-12-02 13:50:27,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a99159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:50:27, skipping insertion in model container [2018-12-02 13:50:27,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:27" (2/3) ... [2018-12-02 13:50:27,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a99159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:50:27, skipping insertion in model container [2018-12-02 13:50:27,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:50:27" (3/3) ... [2018-12-02 13:50:27,699 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7_false-unreach-call_true-termination.c [2018-12-02 13:50:27,705 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 13:50:27,709 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 13:50:27,717 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 13:50:27,733 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 13:50:27,734 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 13:50:27,734 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 13:50:27,734 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 13:50:27,734 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 13:50:27,734 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 13:50:27,734 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 13:50:27,734 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 13:50:27,734 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 13:50:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-12-02 13:50:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 13:50:27,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:27,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:27,749 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:27,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:27,752 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2018-12-02 13:50:27,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:27,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:27,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:27,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:27,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:50:27,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:50:27,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:50:27,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:50:27,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:50:27,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:50:27,869 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-12-02 13:50:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:27,919 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-12-02 13:50:27,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:50:27,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 13:50:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:27,926 INFO L225 Difference]: With dead ends: 35 [2018-12-02 13:50:27,926 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 13:50:27,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:50:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 13:50:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 13:50:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 13:50:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 13:50:27,951 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-12-02 13:50:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:27,952 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 13:50:27,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:50:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-02 13:50:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 13:50:27,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:27,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:27,953 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:27,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:27,953 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2018-12-02 13:50:27,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:27,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:27,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:27,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:27,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:50:27,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:50:27,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:50:27,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:50:27,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:50:27,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:50:27,979 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-12-02 13:50:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:28,014 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-02 13:50:28,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:50:28,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 13:50:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:28,015 INFO L225 Difference]: With dead ends: 27 [2018-12-02 13:50:28,016 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 13:50:28,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:50:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 13:50:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-02 13:50:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 13:50:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 13:50:28,020 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-12-02 13:50:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:28,020 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 13:50:28,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:50:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-02 13:50:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 13:50:28,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:28,021 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-12-02 13:50:28,021 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:28,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2018-12-02 13:50:28,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:28,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:28,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:28,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:28,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 13:50:28,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:50:28,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:50:28,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:28,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 13:50:28,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:50:28,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-02 13:50:28,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 13:50:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 13:50:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:50:28,150 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-12-02 13:50:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:28,222 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-12-02 13:50:28,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:50:28,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-02 13:50:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:28,223 INFO L225 Difference]: With dead ends: 38 [2018-12-02 13:50:28,223 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 13:50:28,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-02 13:50:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 13:50:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 13:50:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 13:50:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-02 13:50:28,227 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-12-02 13:50:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:28,227 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 13:50:28,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 13:50:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-02 13:50:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 13:50:28,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:28,228 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-12-02 13:50:28,228 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:28,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2018-12-02 13:50:28,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:28,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:28,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:28,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:28,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 13:50:28,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:50:28,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:50:28,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:28,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 13:50:28,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:50:28,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 13:50:28,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:50:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:50:28,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:50:28,303 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-12-02 13:50:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:28,337 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-12-02 13:50:28,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:50:28,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-02 13:50:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:28,338 INFO L225 Difference]: With dead ends: 32 [2018-12-02 13:50:28,338 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 13:50:28,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:50:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 13:50:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 13:50:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 13:50:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-02 13:50:28,343 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-12-02 13:50:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:28,343 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-02 13:50:28,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:50:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-12-02 13:50:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 13:50:28,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:28,344 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-12-02 13:50:28,344 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:28,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2018-12-02 13:50:28,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:28,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:28,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 13:50:28,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:50:28,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:50:28,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 13:50:28,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 13:50:28,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 13:50:28,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 13:50:28,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:50:28,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-12-02 13:50:28,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 13:50:28,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 13:50:28,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:50:28,440 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 8 states. [2018-12-02 13:50:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:28,500 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2018-12-02 13:50:28,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:50:28,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-02 13:50:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:28,501 INFO L225 Difference]: With dead ends: 40 [2018-12-02 13:50:28,501 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 13:50:28,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-02 13:50:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 13:50:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-12-02 13:50:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 13:50:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-12-02 13:50:28,507 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-12-02 13:50:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:28,507 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-12-02 13:50:28,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 13:50:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-12-02 13:50:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 13:50:28,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:28,509 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-12-02 13:50:28,509 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:28,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2018-12-02 13:50:28,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:28,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:28,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:28,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:50:28,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-02 13:50:28,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:50:28,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:50:28,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 13:50:28,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-02 13:50:28,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 13:50:28,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-12-02 13:50:28,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:50:28,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-12-02 13:50:28,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 13:50:28,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 13:50:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-02 13:50:28,672 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-12-02 13:50:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:28,823 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-12-02 13:50:28,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 13:50:28,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-02 13:50:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:28,825 INFO L225 Difference]: With dead ends: 76 [2018-12-02 13:50:28,825 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 13:50:28,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-02 13:50:28,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 13:50:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-12-02 13:50:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 13:50:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-12-02 13:50:28,832 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-12-02 13:50:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:28,832 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-12-02 13:50:28,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 13:50:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-12-02 13:50:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 13:50:28,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:28,834 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-12-02 13:50:28,834 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:28,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash -395446193, now seen corresponding path program 4 times [2018-12-02 13:50:28,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:28,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:28,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:28,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:50:28,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 113 proven. 78 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-12-02 13:50:28,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:50:28,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:50:28,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 13:50:28,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 13:50:28,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 13:50:28,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-12-02 13:50:28,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:50:28,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-02 13:50:28,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 13:50:28,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 13:50:28,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-02 13:50:28,963 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 9 states. [2018-12-02 13:50:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:29,052 INFO L93 Difference]: Finished difference Result 57 states and 98 transitions. [2018-12-02 13:50:29,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 13:50:29,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 13:50:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:29,055 INFO L225 Difference]: With dead ends: 57 [2018-12-02 13:50:29,055 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 13:50:29,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-02 13:50:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 13:50:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-02 13:50:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 13:50:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-12-02 13:50:29,064 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 96 [2018-12-02 13:50:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:29,064 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-12-02 13:50:29,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 13:50:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-12-02 13:50:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-12-02 13:50:29,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:29,069 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 39, 23, 23, 23, 23, 23, 23, 23, 16, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:29,069 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:29,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1952215244, now seen corresponding path program 5 times [2018-12-02 13:50:29,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:29,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:29,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:50:29,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6077 backedges. 312 proven. 1015 refuted. 0 times theorem prover too weak. 4750 trivial. 0 not checked. [2018-12-02 13:50:29,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:50:29,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:50:29,279 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 13:50:29,315 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-12-02 13:50:29,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 13:50:29,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6077 backedges. 3486 proven. 118 refuted. 0 times theorem prover too weak. 2473 trivial. 0 not checked. [2018-12-02 13:50:29,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:50:29,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2018-12-02 13:50:29,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 13:50:29,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 13:50:29,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-02 13:50:29,422 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 14 states. [2018-12-02 13:50:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:29,605 INFO L93 Difference]: Finished difference Result 104 states and 200 transitions. [2018-12-02 13:50:29,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 13:50:29,605 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 328 [2018-12-02 13:50:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:29,606 INFO L225 Difference]: With dead ends: 104 [2018-12-02 13:50:29,606 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 13:50:29,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2018-12-02 13:50:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 13:50:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 13:50:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 13:50:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2018-12-02 13:50:29,611 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 328 [2018-12-02 13:50:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:29,612 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2018-12-02 13:50:29,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 13:50:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2018-12-02 13:50:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-02 13:50:29,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:29,613 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-12-02 13:50:29,614 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:29,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:29,614 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 6 times [2018-12-02 13:50:29,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:29,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:29,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:29,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:50:29,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2018-12-02 13:50:29,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:50:29,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:50:29,685 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 13:50:29,718 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-12-02 13:50:29,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 13:50:29,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 241 proven. 445 refuted. 0 times theorem prover too weak. 1894 trivial. 0 not checked. [2018-12-02 13:50:29,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:50:29,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-12-02 13:50:29,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 13:50:29,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 13:50:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-02 13:50:29,782 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand 11 states. [2018-12-02 13:50:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:29,903 INFO L93 Difference]: Finished difference Result 69 states and 96 transitions. [2018-12-02 13:50:29,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 13:50:29,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 218 [2018-12-02 13:50:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:29,905 INFO L225 Difference]: With dead ends: 69 [2018-12-02 13:50:29,906 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 13:50:29,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-12-02 13:50:29,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 13:50:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-12-02 13:50:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 13:50:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2018-12-02 13:50:29,913 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 218 [2018-12-02 13:50:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:29,914 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2018-12-02 13:50:29,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 13:50:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2018-12-02 13:50:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-12-02 13:50:29,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:29,916 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:29,916 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:29,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:29,917 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2018-12-02 13:50:29,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:29,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:29,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:29,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:50:29,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 995 proven. 433 refuted. 0 times theorem prover too weak. 4611 trivial. 0 not checked. [2018-12-02 13:50:30,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:50:30,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:50:30,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:30,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1001 proven. 422 refuted. 0 times theorem prover too weak. 4616 trivial. 0 not checked. [2018-12-02 13:50:30,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:50:30,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-12-02 13:50:30,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 13:50:30,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 13:50:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-02 13:50:30,213 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand 14 states. [2018-12-02 13:50:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:30,325 INFO L93 Difference]: Finished difference Result 95 states and 192 transitions. [2018-12-02 13:50:30,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 13:50:30,325 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 327 [2018-12-02 13:50:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:30,326 INFO L225 Difference]: With dead ends: 95 [2018-12-02 13:50:30,326 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 13:50:30,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-02 13:50:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 13:50:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-02 13:50:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 13:50:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2018-12-02 13:50:30,332 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 327 [2018-12-02 13:50:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:30,332 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2018-12-02 13:50:30,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 13:50:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2018-12-02 13:50:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-12-02 13:50:30,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:30,334 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 36, 22, 22, 22, 22, 22, 22, 22, 14, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:30,334 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:30,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1607910117, now seen corresponding path program 8 times [2018-12-02 13:50:30,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:30,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:30,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:30,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:50:30,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 474 proven. 1184 refuted. 0 times theorem prover too weak. 3856 trivial. 0 not checked. [2018-12-02 13:50:30,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:50:30,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:50:30,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 13:50:30,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 13:50:30,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 13:50:30,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 465 proven. 886 refuted. 0 times theorem prover too weak. 4163 trivial. 0 not checked. [2018-12-02 13:50:30,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:50:30,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2018-12-02 13:50:30,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 13:50:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 13:50:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-12-02 13:50:30,662 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand 19 states. [2018-12-02 13:50:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:31,017 INFO L93 Difference]: Finished difference Result 182 states and 320 transitions. [2018-12-02 13:50:31,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 13:50:31,017 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 313 [2018-12-02 13:50:31,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:31,019 INFO L225 Difference]: With dead ends: 182 [2018-12-02 13:50:31,019 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 13:50:31,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=319, Invalid=1013, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 13:50:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 13:50:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2018-12-02 13:50:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 13:50:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2018-12-02 13:50:31,026 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 313 [2018-12-02 13:50:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:31,026 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2018-12-02 13:50:31,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 13:50:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2018-12-02 13:50:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-12-02 13:50:31,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:31,027 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 36, 22, 22, 22, 22, 22, 22, 22, 14, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:31,027 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:31,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash 96725317, now seen corresponding path program 9 times [2018-12-02 13:50:31,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:31,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:31,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:31,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:50:31,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:50:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 814 proven. 621 refuted. 0 times theorem prover too weak. 4079 trivial. 0 not checked. [2018-12-02 13:50:31,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:50:31,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:50:31,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 13:50:31,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-02 13:50:31,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 13:50:31,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:50:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 3170 proven. 71 refuted. 0 times theorem prover too weak. 2273 trivial. 0 not checked. [2018-12-02 13:50:31,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 13:50:31,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 14 [2018-12-02 13:50:31,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 13:50:31,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 13:50:31,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-02 13:50:31,291 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 14 states. [2018-12-02 13:50:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:50:31,450 INFO L93 Difference]: Finished difference Result 172 states and 228 transitions. [2018-12-02 13:50:31,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 13:50:31,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 313 [2018-12-02 13:50:31,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:50:31,451 INFO L225 Difference]: With dead ends: 172 [2018-12-02 13:50:31,451 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 13:50:31,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2018-12-02 13:50:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 13:50:31,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-12-02 13:50:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 13:50:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2018-12-02 13:50:31,461 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 313 [2018-12-02 13:50:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:50:31,461 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2018-12-02 13:50:31,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 13:50:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2018-12-02 13:50:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-02 13:50:31,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:50:31,462 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:50:31,462 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:50:31,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:50:31,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 10 times [2018-12-02 13:50:31,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:50:31,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:50:31,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:31,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:50:31,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:50:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:50:31,514 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 13:50:31,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:50:31 BoogieIcfgContainer [2018-12-02 13:50:31,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 13:50:31,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 13:50:31,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 13:50:31,547 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 13:50:31,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:50:27" (3/4) ... [2018-12-02 13:50:31,549 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 13:50:31,598 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bdfce5b3-b87c-4ed5-8383-1c00cc610ca0/bin-2019/uautomizer/witness.graphml [2018-12-02 13:50:31,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 13:50:31,598 INFO L168 Benchmark]: Toolchain (without parser) took 4191.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 956.1 MB in the beginning and 1.3 GB in the end (delta: -324.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:50:31,599 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:50:31,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.61 ms. Allocated memory is still 1.0 GB. Free memory was 956.1 MB in the beginning and 945.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:31,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.58 ms. Allocated memory is still 1.0 GB. Free memory is still 945.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:50:31,600 INFO L168 Benchmark]: Boogie Preprocessor took 9.98 ms. Allocated memory is still 1.0 GB. Free memory is still 945.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:50:31,600 INFO L168 Benchmark]: RCFGBuilder took 146.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 945.4 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:31,600 INFO L168 Benchmark]: TraceAbstraction took 3852.02 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 202.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -192.0 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:31,600 INFO L168 Benchmark]: Witness Printer took 51.12 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2018-12-02 13:50:31,601 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.61 ms. Allocated memory is still 1.0 GB. Free memory was 956.1 MB in the beginning and 945.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.58 ms. Allocated memory is still 1.0 GB. Free memory is still 945.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.98 ms. Allocated memory is still 1.0 GB. Free memory is still 945.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 146.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 945.4 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3852.02 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 202.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -192.0 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Witness Printer took 51.12 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 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 = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) 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); [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 3.8s OverallTime, 13 OverallIterations, 47 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 368 SDslu, 809 SDs, 0 SdLazy, 1321 SolverSat, 434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1980 GetRequests, 1801 SyntacticMatches, 4 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=11, 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 25 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 3881 NumberOfCodeBlocks, 3489 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 3573 ConstructedInterpolants, 0 QuantifiedInterpolants, 1256689 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3103 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 47199/53300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...