./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/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 d3562c726fb0df5872bc6ae08c11ec0d40862c19 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:52:41,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:41,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:41,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:41,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:41,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:41,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:41,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:41,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:41,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:41,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:41,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:41,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:41,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:41,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:41,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:41,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:41,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:41,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:41,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:41,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:41,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:41,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:41,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:41,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:41,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:41,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:41,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:41,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:41,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:41,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:41,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:41,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:41,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:41,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:41,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:41,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:41,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:41,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:41,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:41,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:41,653 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:52:41,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:41,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:41,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:41,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:41,673 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:41,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:41,673 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:41,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:52:41,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:41,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:41,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:41,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:41,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:41,675 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:41,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:41,675 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:41,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:41,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:41,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:41,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:41,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:41,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:41,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:41,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:41,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:41,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:52:41,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:52:41,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:41,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/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 -> d3562c726fb0df5872bc6ae08c11ec0d40862c19 [2019-11-25 08:52:41,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:41,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:41,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:41,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:41,827 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:41,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci04.c [2019-11-25 08:52:41,886 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/data/6460fb551/25c4919cc7e742b78782baf1ea347f98/FLAG871e12107 [2019-11-25 08:52:42,292 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:42,293 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/sv-benchmarks/c/recursive/Fibonacci04.c [2019-11-25 08:52:42,300 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/data/6460fb551/25c4919cc7e742b78782baf1ea347f98/FLAG871e12107 [2019-11-25 08:52:42,316 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/data/6460fb551/25c4919cc7e742b78782baf1ea347f98 [2019-11-25 08:52:42,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:42,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:42,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:42,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:42,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:42,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc59a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42, skipping insertion in model container [2019-11-25 08:52:42,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:42,352 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:42,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:42,536 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:52:42,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:42,625 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:52:42,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42 WrapperNode [2019-11-25 08:52:42,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:42,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:42,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:52:42,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:52:42,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:42,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:52:42,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:52:42,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:52:42,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (1/1) ... [2019-11-25 08:52:42,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:52:42,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:52:42,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:52:42,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:52:42,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/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 [2019-11-25 08:52:42,720 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-25 08:52:42,720 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-25 08:52:42,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:52:42,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:52:42,870 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:52:42,871 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-25 08:52:42,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:42 BoogieIcfgContainer [2019-11-25 08:52:42,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:52:42,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:52:42,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:52:42,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:52:42,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:52:42" (1/3) ... [2019-11-25 08:52:42,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd5ce39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:42, skipping insertion in model container [2019-11-25 08:52:42,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:42" (2/3) ... [2019-11-25 08:52:42,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd5ce39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:42, skipping insertion in model container [2019-11-25 08:52:42,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:42" (3/3) ... [2019-11-25 08:52:42,891 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2019-11-25 08:52:42,899 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:52:42,916 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:52:42,926 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:52:42,949 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:52:42,950 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:52:42,950 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:52:42,950 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:52:42,950 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:52:42,950 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:52:42,950 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:52:42,950 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:52:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-25 08:52:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:52:42,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:42,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:42,978 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:42,984 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2019-11-25 08:52:42,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:42,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625445328] [2019-11-25 08:52:42,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:43,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625445328] [2019-11-25 08:52:43,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:43,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:43,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579167678] [2019-11-25 08:52:43,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:43,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:43,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:43,167 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2019-11-25 08:52:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:43,260 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-25 08:52:43,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:43,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-25 08:52:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:43,271 INFO L225 Difference]: With dead ends: 30 [2019-11-25 08:52:43,272 INFO L226 Difference]: Without dead ends: 17 [2019-11-25 08:52:43,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-25 08:52:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-25 08:52:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-25 08:52:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-25 08:52:43,315 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-25 08:52:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:43,315 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-25 08:52:43,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-25 08:52:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:52:43,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:43,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:43,318 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:43,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:43,318 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2019-11-25 08:52:43,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:43,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998255996] [2019-11-25 08:52:43,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:43,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998255996] [2019-11-25 08:52:43,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:43,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:43,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759176740] [2019-11-25 08:52:43,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:43,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:43,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:43,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:43,367 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-11-25 08:52:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:43,439 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-25 08:52:43,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:43,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-25 08:52:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:43,441 INFO L225 Difference]: With dead ends: 23 [2019-11-25 08:52:43,441 INFO L226 Difference]: Without dead ends: 19 [2019-11-25 08:52:43,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:43,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-25 08:52:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-25 08:52:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-25 08:52:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-25 08:52:43,447 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-25 08:52:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:43,447 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-25 08:52:43,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-25 08:52:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:52:43,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:43,448 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:43,449 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:43,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:43,449 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2019-11-25 08:52:43,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:43,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975051554] [2019-11-25 08:52:43,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 08:52:43,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975051554] [2019-11-25 08:52:43,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345978193] [2019-11-25 08:52:43,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:52:43,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 08:52:43,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:43,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-25 08:52:43,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527872233] [2019-11-25 08:52:43,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:52:43,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:43,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:52:43,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:52:43,738 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 9 states. [2019-11-25 08:52:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:43,878 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-11-25 08:52:43,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:52:43,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-25 08:52:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:43,879 INFO L225 Difference]: With dead ends: 34 [2019-11-25 08:52:43,879 INFO L226 Difference]: Without dead ends: 19 [2019-11-25 08:52:43,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:52:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-25 08:52:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-25 08:52:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-25 08:52:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-11-25 08:52:43,886 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2019-11-25 08:52:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:43,886 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-25 08:52:43,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:52:43,887 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-11-25 08:52:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:52:43,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:43,888 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:44,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:44,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:44,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:44,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1834230885, now seen corresponding path program 1 times [2019-11-25 08:52:44,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:44,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455343030] [2019-11-25 08:52:44,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:52:44,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455343030] [2019-11-25 08:52:44,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130259288] [2019-11-25 08:52:44,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:52:44,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:52:44,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:44,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-25 08:52:44,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547584266] [2019-11-25 08:52:44,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:52:44,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:52:44,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:44,281 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 8 states. [2019-11-25 08:52:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:44,388 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-11-25 08:52:44,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:52:44,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-25 08:52:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:44,392 INFO L225 Difference]: With dead ends: 37 [2019-11-25 08:52:44,392 INFO L226 Difference]: Without dead ends: 33 [2019-11-25 08:52:44,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:52:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-25 08:52:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-25 08:52:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-25 08:52:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-11-25 08:52:44,405 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 23 [2019-11-25 08:52:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:44,405 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-25 08:52:44,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:52:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-11-25 08:52:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:52:44,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:44,410 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:44,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:44,614 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:44,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1301134080, now seen corresponding path program 2 times [2019-11-25 08:52:44,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:44,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311592570] [2019-11-25 08:52:44,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:52:44,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311592570] [2019-11-25 08:52:44,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100661229] [2019-11-25 08:52:44,815 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:44,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:52:44,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:52:44,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:52:44,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-25 08:52:44,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:44,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-25 08:52:44,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575680462] [2019-11-25 08:52:44,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 08:52:44,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:44,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 08:52:44,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:52:44,955 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 14 states. [2019-11-25 08:52:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:45,196 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2019-11-25 08:52:45,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:52:45,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-25 08:52:45,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:45,198 INFO L225 Difference]: With dead ends: 67 [2019-11-25 08:52:45,199 INFO L226 Difference]: Without dead ends: 34 [2019-11-25 08:52:45,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-25 08:52:45,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-25 08:52:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-25 08:52:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 08:52:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-25 08:52:45,208 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 36 [2019-11-25 08:52:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:45,209 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-25 08:52:45,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 08:52:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-25 08:52:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-25 08:52:45,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:45,212 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:45,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:45,415 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:45,416 INFO L82 PathProgramCache]: Analyzing trace with hash 300559544, now seen corresponding path program 3 times [2019-11-25 08:52:45,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:45,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463208554] [2019-11-25 08:52:45,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-25 08:52:45,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463208554] [2019-11-25 08:52:45,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867641642] [2019-11-25 08:52:45,708 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:45,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-25 08:52:45,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:52:45,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:52:45,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-25 08:52:45,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:45,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-11-25 08:52:45,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722549183] [2019-11-25 08:52:45,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:52:45,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:45,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:52:45,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:52:45,777 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 12 states. [2019-11-25 08:52:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:45,926 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2019-11-25 08:52:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:52:45,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-25 08:52:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:45,930 INFO L225 Difference]: With dead ends: 76 [2019-11-25 08:52:45,930 INFO L226 Difference]: Without dead ends: 72 [2019-11-25 08:52:45,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:52:45,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-25 08:52:45,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-11-25 08:52:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:52:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2019-11-25 08:52:45,946 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 64 [2019-11-25 08:52:45,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:45,947 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2019-11-25 08:52:45,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:52:45,947 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2019-11-25 08:52:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-25 08:52:45,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:45,950 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:46,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:46,151 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:46,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2106103662, now seen corresponding path program 4 times [2019-11-25 08:52:46,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:46,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391088811] [2019-11-25 08:52:46,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 309 proven. 340 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-11-25 08:52:46,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391088811] [2019-11-25 08:52:46,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462638821] [2019-11-25 08:52:46,746 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:46,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-25 08:52:46,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:52:46,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:52:46,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 276 proven. 112 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-11-25 08:52:46,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:46,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 24 [2019-11-25 08:52:46,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423860111] [2019-11-25 08:52:46,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-25 08:52:46,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-25 08:52:46,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-11-25 08:52:46,932 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand 24 states. [2019-11-25 08:52:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:47,472 INFO L93 Difference]: Finished difference Result 139 states and 239 transitions. [2019-11-25 08:52:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 08:52:47,473 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 146 [2019-11-25 08:52:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:47,475 INFO L225 Difference]: With dead ends: 139 [2019-11-25 08:52:47,475 INFO L226 Difference]: Without dead ends: 57 [2019-11-25 08:52:47,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2019-11-25 08:52:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-25 08:52:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2019-11-25 08:52:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-25 08:52:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-11-25 08:52:47,486 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 146 [2019-11-25 08:52:47,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:47,486 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-11-25 08:52:47,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-25 08:52:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-11-25 08:52:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-25 08:52:47,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:47,489 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:47,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:47,696 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1483723059, now seen corresponding path program 5 times [2019-11-25 08:52:47,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:47,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987923954] [2019-11-25 08:52:47,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:47,746 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:47,746 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:52:47,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:47 BoogieIcfgContainer [2019-11-25 08:52:47,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:47,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:47,795 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:47,795 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:47,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:42" (3/4) ... [2019-11-25 08:52:47,800 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:52:47,895 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f83c5e8b-c453-4295-9bfd-3a15fdc2d817/bin/uautomizer/witness.graphml [2019-11-25 08:52:47,895 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:47,900 INFO L168 Benchmark]: Toolchain (without parser) took 5578.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 950.1 MB in the beginning and 934.5 MB in the end (delta: 15.6 MB). Peak memory consumption was 221.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,900 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:47,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:47,901 INFO L168 Benchmark]: Boogie Preprocessor took 12.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:47,901 INFO L168 Benchmark]: RCFGBuilder took 209.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,902 INFO L168 Benchmark]: TraceAbstraction took 4922.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 945.0 MB in the end (delta: 165.7 MB). Peak memory consumption was 237.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,902 INFO L168 Benchmark]: Witness Printer took 102.93 ms. Allocated memory is still 1.2 GB. Free memory was 945.0 MB in the beginning and 934.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,904 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 209.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4922.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 945.0 MB in the end (delta: 165.7 MB). Peak memory consumption was 237.0 MB. Max. memory is 11.5 GB. * Witness Printer took 102.93 ms. Allocated memory is still 1.2 GB. Free memory was 945.0 MB in the beginning and 934.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) [L33] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.8s, OverallIterations: 8, TraceHistogramMax: 21, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 118 SDtfs, 245 SDslu, 395 SDs, 0 SdLazy, 895 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 706 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 104623 SizeOfPredicates, 19 NumberOfNonLiveVariables, 556 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 2220/2834 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...