./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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 f0bc64117ef8398002009c167867d7baf0a85044 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-1dbac8b [2018-11-10 07:36:16,011 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:36:16,012 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:36:16,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:36:16,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:36:16,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:36:16,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:36:16,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:36:16,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:36:16,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:36:16,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:36:16,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:36:16,026 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:36:16,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:36:16,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:36:16,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:36:16,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:36:16,030 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:36:16,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:36:16,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:36:16,033 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:36:16,034 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:36:16,036 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:36:16,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:36:16,036 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:36:16,037 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:36:16,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:36:16,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:36:16,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:36:16,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:36:16,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:36:16,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:36:16,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:36:16,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:36:16,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:36:16,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:36:16,042 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 07:36:16,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:36:16,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:36:16,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:36:16,053 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:36:16,053 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:36:16,053 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:36:16,053 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:36:16,054 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:36:16,054 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:36:16,054 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:36:16,054 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:36:16,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:36:16,054 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:36:16,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:36:16,055 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:36:16,055 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:36:16,055 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:36:16,055 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:36:16,055 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:36:16,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:36:16,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:36:16,056 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:36:16,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:36:16,056 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:36:16,056 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:36:16,056 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:36:16,056 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:36:16,057 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:36:16,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:36:16,057 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_0738038b-a10b-478b-adaf-035bf1859e83/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 -> f0bc64117ef8398002009c167867d7baf0a85044 [2018-11-10 07:36:16,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:36:16,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:36:16,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:36:16,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:36:16,091 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:36:16,091 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-10 07:36:16,127 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/data/a2e14a280/c65375c269a14da48a36d7748ac75fbd/FLAGadb1a1a61 [2018-11-10 07:36:16,464 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:36:16,464 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-10 07:36:16,469 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/data/a2e14a280/c65375c269a14da48a36d7748ac75fbd/FLAGadb1a1a61 [2018-11-10 07:36:16,478 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/data/a2e14a280/c65375c269a14da48a36d7748ac75fbd [2018-11-10 07:36:16,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:36:16,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:36:16,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:36:16,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:36:16,486 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:36:16,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:36:16" (1/1) ... [2018-11-10 07:36:16,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd2abbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16, skipping insertion in model container [2018-11-10 07:36:16,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:36:16" (1/1) ... [2018-11-10 07:36:16,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:36:16,511 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:36:16,621 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:36:16,623 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:36:16,632 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:36:16,642 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:36:16,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16 WrapperNode [2018-11-10 07:36:16,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:36:16,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:36:16,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:36:16,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:36:16,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16" (1/1) ... [2018-11-10 07:36:16,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16" (1/1) ... [2018-11-10 07:36:16,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16" (1/1) ... [2018-11-10 07:36:16,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16" (1/1) ... [2018-11-10 07:36:16,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16" (1/1) ... [2018-11-10 07:36:16,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16" (1/1) ... [2018-11-10 07:36:16,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16" (1/1) ... [2018-11-10 07:36:16,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:36:16,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:36:16,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:36:16,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:36:16,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:16,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:36:16,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:36:16,725 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-10 07:36:16,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:36:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 07:36:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 07:36:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-10 07:36:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:36:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:36:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:36:16,816 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:36:16,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:36:16 BoogieIcfgContainer [2018-11-10 07:36:16,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:36:16,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:36:16,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:36:16,820 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:36:16,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:36:16" (1/3) ... [2018-11-10 07:36:16,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0bdf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:36:16, skipping insertion in model container [2018-11-10 07:36:16,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:16" (2/3) ... [2018-11-10 07:36:16,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0bdf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:36:16, skipping insertion in model container [2018-11-10 07:36:16,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:36:16" (3/3) ... [2018-11-10 07:36:16,822 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-10 07:36:16,828 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:36:16,833 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:36:16,842 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:36:16,859 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:36:16,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:36:16,859 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:36:16,859 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:36:16,859 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:36:16,859 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:36:16,859 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:36:16,859 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:36:16,859 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:36:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-10 07:36:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 07:36:16,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:16,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:16,876 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:16,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:16,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-11-10 07:36:16,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:16,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:16,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:36:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:36:16,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:36:16,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:36:16,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:36:17,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:36:17,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:36:17,003 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-10 07:36:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:17,079 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-10 07:36:17,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:36:17,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 07:36:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:17,086 INFO L225 Difference]: With dead ends: 35 [2018-11-10 07:36:17,086 INFO L226 Difference]: Without dead ends: 21 [2018-11-10 07:36:17,088 INFO L605 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-11-10 07:36:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-10 07:36:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 07:36:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 07:36:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-10 07:36:17,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-10 07:36:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:17,116 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 07:36:17,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:36:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-10 07:36:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 07:36:17,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:17,118 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:17,118 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:17,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-11-10 07:36:17,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:17,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:17,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:17,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:36:17,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:36:17,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:36:17,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:36:17,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:36:17,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:36:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:36:17,162 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-10 07:36:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:17,228 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-10 07:36:17,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:36:17,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 07:36:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:17,229 INFO L225 Difference]: With dead ends: 27 [2018-11-10 07:36:17,230 INFO L226 Difference]: Without dead ends: 23 [2018-11-10 07:36:17,230 INFO L605 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-11-10 07:36:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-10 07:36:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-10 07:36:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 07:36:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-10 07:36:17,236 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-10 07:36:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:17,237 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 07:36:17,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:36:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-10 07:36:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:36:17,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:17,238 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:17,238 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:17,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:17,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-11-10 07:36:17,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:17,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:17,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:17,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:36:17,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 07:36:17,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:17,314 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:17,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:36:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:17,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 07:36:17,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:17,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-10 07:36:17,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:36:17,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:36:17,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:36:17,408 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-10 07:36:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:17,505 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-10 07:36:17,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:36:17,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-10 07:36:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:17,506 INFO L225 Difference]: With dead ends: 38 [2018-11-10 07:36:17,506 INFO L226 Difference]: Without dead ends: 23 [2018-11-10 07:36:17,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-10 07:36:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-10 07:36:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 07:36:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 07:36:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 07:36:17,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-10 07:36:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:17,510 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 07:36:17,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:36:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-10 07:36:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:36:17,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:17,512 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:17,512 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:17,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-11-10 07:36:17,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:17,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:17,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:17,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:36:17,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 07:36:17,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:17,556 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:17,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:36:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:17,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 07:36:17,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:17,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 07:36:17,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:36:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:36:17,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:36:17,593 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-10 07:36:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:17,652 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-10 07:36:17,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:36:17,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-10 07:36:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:17,653 INFO L225 Difference]: With dead ends: 32 [2018-11-10 07:36:17,653 INFO L226 Difference]: Without dead ends: 28 [2018-11-10 07:36:17,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:36:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-10 07:36:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-10 07:36:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 07:36:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-10 07:36:17,658 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-10 07:36:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:17,658 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-10 07:36:17,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:36:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-10 07:36:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:36:17,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:17,659 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:17,659 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:17,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-11-10 07:36:17,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:17,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:17,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:17,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:36:17,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 07:36:17,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:17,724 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:17,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:36:17,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:36:17,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:36:17,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 07:36:17,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:17,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-10 07:36:17,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 07:36:17,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:36:17,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:36:17,828 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 9 states. [2018-11-10 07:36:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:17,915 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2018-11-10 07:36:17,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:36:17,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-10 07:36:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:17,916 INFO L225 Difference]: With dead ends: 42 [2018-11-10 07:36:17,916 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 07:36:17,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-10 07:36:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 07:36:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-10 07:36:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 07:36:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-10 07:36:17,925 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-11-10 07:36:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:17,925 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-10 07:36:17,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 07:36:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-10 07:36:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 07:36:17,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:17,928 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:17,928 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:17,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:17,928 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 3 times [2018-11-10 07:36:17,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:17,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:17,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:17,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:36:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-11-10 07:36:18,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:18,074 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:18,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:36:18,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 07:36:18,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:36:18,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-10 07:36:18,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:18,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-10 07:36:18,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 07:36:18,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 07:36:18,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-10 07:36:18,165 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-11-10 07:36:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:18,341 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-11-10 07:36:18,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:36:18,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-10 07:36:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:18,343 INFO L225 Difference]: With dead ends: 76 [2018-11-10 07:36:18,343 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 07:36:18,344 INFO L605 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-11-10 07:36:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 07:36:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-10 07:36:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 07:36:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-11-10 07:36:18,352 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-11-10 07:36:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:18,353 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-11-10 07:36:18,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 07:36:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-11-10 07:36:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 07:36:18,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:18,355 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:18,355 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:18,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 4 times [2018-11-10 07:36:18,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:18,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:18,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:36:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-10 07:36:18,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:18,419 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:18,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:36:18,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:36:18,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:36:18,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 07:36:18,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:18,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-11-10 07:36:18,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:36:18,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:36:18,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:36:18,480 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 8 states. [2018-11-10 07:36:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:18,552 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2018-11-10 07:36:18,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:36:18,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-10 07:36:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:18,554 INFO L225 Difference]: With dead ends: 52 [2018-11-10 07:36:18,554 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 07:36:18,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-10 07:36:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 07:36:18,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-10 07:36:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 07:36:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-10 07:36:18,561 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 68 [2018-11-10 07:36:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:18,561 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-11-10 07:36:18,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:36:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-11-10 07:36:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 07:36:18,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:18,563 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:18,563 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:18,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:18,564 INFO L82 PathProgramCache]: Analyzing trace with hash 995062905, now seen corresponding path program 5 times [2018-11-10 07:36:18,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:18,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:18,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:18,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:36:18,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 195 proven. 269 refuted. 0 times theorem prover too weak. 1505 trivial. 0 not checked. [2018-11-10 07:36:18,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:18,661 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:18,667 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 07:36:18,691 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-10 07:36:18,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:36:18,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 958 proven. 4 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2018-11-10 07:36:18,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:18,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 07:36:18,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:36:18,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:36:18,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:36:18,736 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 7 states. [2018-11-10 07:36:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:18,841 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2018-11-10 07:36:18,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:36:18,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-11-10 07:36:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:18,843 INFO L225 Difference]: With dead ends: 88 [2018-11-10 07:36:18,843 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 07:36:18,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-10 07:36:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 07:36:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-10 07:36:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 07:36:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2018-11-10 07:36:18,848 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 192 [2018-11-10 07:36:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:18,849 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2018-11-10 07:36:18,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:36:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2018-11-10 07:36:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 07:36:18,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:18,850 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:18,850 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:18,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1737041458, now seen corresponding path program 6 times [2018-11-10 07:36:18,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:18,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:18,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:18,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:36:18,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 213 proven. 64 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-11-10 07:36:18,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:18,925 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:18,931 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 07:36:18,983 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-11-10 07:36:18,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:36:18,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 54 proven. 273 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-10 07:36:19,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:19,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-11-10 07:36:19,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 07:36:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:36:19,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:36:19,036 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 9 states. [2018-11-10 07:36:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:19,108 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-11-10 07:36:19,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:36:19,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-11-10 07:36:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:19,110 INFO L225 Difference]: With dead ends: 54 [2018-11-10 07:36:19,110 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 07:36:19,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:36:19,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 07:36:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-10 07:36:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 07:36:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2018-11-10 07:36:19,117 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 123 [2018-11-10 07:36:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:19,118 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2018-11-10 07:36:19,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 07:36:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2018-11-10 07:36:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 07:36:19,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:19,121 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:19,121 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:19,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1009195755, now seen corresponding path program 7 times [2018-11-10 07:36:19,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:19,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:19,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:36:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2018-11-10 07:36:19,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:19,215 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:19,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:36:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:19,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2018-11-10 07:36:19,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:19,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-11-10 07:36:19,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 07:36:19,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:36:19,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:36:19,343 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 10 states. [2018-11-10 07:36:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:19,521 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2018-11-10 07:36:19,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 07:36:19,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2018-11-10 07:36:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:19,523 INFO L225 Difference]: With dead ends: 59 [2018-11-10 07:36:19,523 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 07:36:19,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:36:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 07:36:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-10 07:36:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 07:36:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 88 transitions. [2018-11-10 07:36:19,531 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 88 transitions. Word has length 218 [2018-11-10 07:36:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:19,532 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 88 transitions. [2018-11-10 07:36:19,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 07:36:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 88 transitions. [2018-11-10 07:36:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-11-10 07:36:19,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:19,544 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 63, 39, 39, 39, 39, 39, 39, 39, 24, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:19,544 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:19,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:19,544 INFO L82 PathProgramCache]: Analyzing trace with hash 47677017, now seen corresponding path program 8 times [2018-11-10 07:36:19,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:19,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:19,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:19,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:36:19,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 17241 backedges. 381 proven. 2015 refuted. 0 times theorem prover too weak. 14845 trivial. 0 not checked. [2018-11-10 07:36:19,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:19,757 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:19,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:36:19,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:36:19,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:36:19,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17241 backedges. 347 proven. 2436 refuted. 0 times theorem prover too weak. 14458 trivial. 0 not checked. [2018-11-10 07:36:20,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:20,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2018-11-10 07:36:20,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 07:36:20,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 07:36:20,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:36:20,024 INFO L87 Difference]: Start difference. First operand 55 states and 88 transitions. Second operand 11 states. [2018-11-10 07:36:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:20,168 INFO L93 Difference]: Finished difference Result 64 states and 109 transitions. [2018-11-10 07:36:20,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:36:20,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 544 [2018-11-10 07:36:20,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:20,170 INFO L225 Difference]: With dead ends: 64 [2018-11-10 07:36:20,170 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 07:36:20,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-11-10 07:36:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 07:36:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-10 07:36:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 07:36:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 105 transitions. [2018-11-10 07:36:20,176 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 105 transitions. Word has length 544 [2018-11-10 07:36:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:20,176 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 105 transitions. [2018-11-10 07:36:20,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 07:36:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 105 transitions. [2018-11-10 07:36:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2018-11-10 07:36:20,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:20,180 INFO L375 BasicCegarLoop]: trace histogram [111, 111, 89, 55, 55, 55, 55, 55, 55, 55, 34, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:20,180 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:20,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1049826623, now seen corresponding path program 9 times [2018-11-10 07:36:20,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:20,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:20,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:20,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:36:20,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 34276 backedges. 831 proven. 4013 refuted. 0 times theorem prover too weak. 29432 trivial. 0 not checked. [2018-11-10 07:36:20,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:20,557 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/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-11-10 07:36:20,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:36:20,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-10 07:36:20,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:36:20,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 34276 backedges. 6909 proven. 189 refuted. 0 times theorem prover too weak. 27178 trivial. 0 not checked. [2018-11-10 07:36:20,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:20,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2018-11-10 07:36:20,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 07:36:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 07:36:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:36:20,893 INFO L87 Difference]: Start difference. First operand 60 states and 105 transitions. Second operand 16 states. [2018-11-10 07:36:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:21,165 INFO L93 Difference]: Finished difference Result 126 states and 258 transitions. [2018-11-10 07:36:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 07:36:21,165 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 762 [2018-11-10 07:36:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:21,166 INFO L225 Difference]: With dead ends: 126 [2018-11-10 07:36:21,166 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 07:36:21,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2018-11-10 07:36:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 07:36:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-10 07:36:21,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 07:36:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2018-11-10 07:36:21,173 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 762 [2018-11-10 07:36:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:21,173 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2018-11-10 07:36:21,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 07:36:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2018-11-10 07:36:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-11-10 07:36:21,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:21,177 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:21,177 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:21,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1942503438, now seen corresponding path program 10 times [2018-11-10 07:36:21,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:21,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:21,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:21,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:36:21,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:36:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1240 proven. 3038 refuted. 0 times theorem prover too weak. 12129 trivial. 0 not checked. [2018-11-10 07:36:21,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:36:21,530 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:36:21,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:36:21,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:36:21,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:36:21,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:36:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 8261 proven. 1793 refuted. 0 times theorem prover too weak. 6353 trivial. 0 not checked. [2018-11-10 07:36:21,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:36:21,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 20 [2018-11-10 07:36:21,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 07:36:21,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 07:36:21,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-11-10 07:36:21,845 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 20 states. [2018-11-10 07:36:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:36:22,260 INFO L93 Difference]: Finished difference Result 178 states and 335 transitions. [2018-11-10 07:36:22,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 07:36:22,260 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 531 [2018-11-10 07:36:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:36:22,263 INFO L225 Difference]: With dead ends: 178 [2018-11-10 07:36:22,263 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 07:36:22,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 536 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=446, Invalid=1534, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 07:36:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 07:36:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2018-11-10 07:36:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 07:36:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2018-11-10 07:36:22,275 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 531 [2018-11-10 07:36:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:36:22,275 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2018-11-10 07:36:22,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 07:36:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2018-11-10 07:36:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-10 07:36:22,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:36:22,278 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:36:22,278 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:36:22,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:36:22,278 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 11 times [2018-11-10 07:36:22,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:36:22,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:36:22,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:22,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:36:22,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:36:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:36:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:36:22,359 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 07:36:22,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:36:22 BoogieIcfgContainer [2018-11-10 07:36:22,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:36:22,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:36:22,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:36:22,406 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:36:22,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:36:16" (3/4) ... [2018-11-10 07:36:22,408 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 07:36:22,475 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0738038b-a10b-478b-adaf-035bf1859e83/bin-2019/uautomizer/witness.graphml [2018-11-10 07:36:22,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:36:22,476 INFO L168 Benchmark]: Toolchain (without parser) took 5994.37 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 664.8 MB). Free memory was 959.1 MB in the beginning and 1.3 GB in the end (delta: -321.8 MB). Peak memory consumption was 343.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:36:22,477 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:36:22,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.47 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:36:22,477 INFO L168 Benchmark]: Boogie Preprocessor took 16.03 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:36:22,477 INFO L168 Benchmark]: RCFGBuilder took 157.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 948.3 MB in the beginning and 1.2 GB in the end (delta: -202.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:36:22,479 INFO L168 Benchmark]: TraceAbstraction took 5588.27 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 500.7 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -130.4 MB). Peak memory consumption was 370.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:36:22,480 INFO L168 Benchmark]: Witness Printer took 69.47 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:36:22,481 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.47 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.03 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 157.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 948.3 MB in the beginning and 1.2 GB in the end (delta: -202.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5588.27 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 500.7 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -130.4 MB). Peak memory consumption was 370.3 MB. Max. memory is 11.5 GB. * Witness Printer took 69.47 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L27] EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 5.5s OverallTime, 14 OverallIterations, 111 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 403 SDslu, 880 SDs, 0 SdLazy, 1321 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2846 GetRequests, 2657 SyntacticMatches, 2 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=13, 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, 13 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 5744 NumberOfCodeBlocks, 4933 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 5257 ConstructedInterpolants, 0 QuantifiedInterpolants, 3072011 SizeOfPredicates, 62 NumberOfNonLiveVariables, 4011 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 132231/147816 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...